default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuis Tenorio
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]David Kozak
, Cesare Molinari, Lorenzo Rosasco, Luis Tenorio, Silvia Villa:
Zeroth-order optimization with orthogonal random directions. Math. Program. 199(1): 1179-1219 (2023)- [j9]Eldad Haber, Moshe Eliasof, Luis Tenorio:
Estimating a Potential Without the Agony of the Partition Function. SIAM J. Math. Data Sci. 5(4): 1005-1027 (2023) - 2022
- [i6]Eldad Haber, Moshe Eliasof, Luis Tenorio:
Estimating a potential without the agony of the partition function. CoRR abs/2208.09433 (2022) - [i5]Alexander Vidal, Samy Wu Fung, Luis Tenorio, Stanley J. Osher, Levon Nurbekyan:
Taming Hyperparameter Tuning in Continuous Normalizing Flows Using the JKO Scheme. CoRR abs/2211.16757 (2022) - 2021
- [j8]David Kozak, Stephen Becker, Alireza Doostan, Luis Tenorio:
A stochastic subspace approach to gradient-free optimization in high dimensions. Comput. Optim. Appl. 79(2): 339-368 (2021)
2010 – 2019
- 2019
- [i4]Julianne Chung, Matthias Chung, J. Tanner Slagel, Luis Tenorio:
Sampled Limited Memory Methods for Massive Linear Inverse Problems. CoRR abs/1912.07962 (2019) - 2017
- [j7]Alessio Spantini, Tiangang Cui, Karen Willcox, Luis Tenorio, Youssef M. Marzouk:
Goal-Oriented Optimal Approximations of Bayesian Linear Inverse Problems. SIAM J. Sci. Comput. 39(5) (2017) - [i3]Julianne Chung, Matthias Chung, J. Tanner Slagel, Luis Tenorio:
Stochastic Newton and Quasi-Newton Methods for Large Linear Least-squares Problems. CoRR abs/1702.07367 (2017) - 2015
- [j6]Brian R. Zaharatos, Mark Campanelli, Luis Tenorio:
On the estimability of the PV single-diode model parameters. Stat. Anal. Data Min. 8(5-6): 329-339 (2015) - [j5]Oscar Aguilar, Moritz Allmaras, Wolfgang Bangerth, Luis Tenorio:
Statistics of Parameter Estimates: A Concrete Example. SIAM Rev. 57(1): 131-149 (2015) - [j4]Alessio Spantini, Antti Solonen, Tiangang Cui, James Martin, Luis Tenorio, Youssef M. Marzouk:
Optimal Low-rank Approximations of Bayesian Linear Inverse Problems. SIAM J. Sci. Comput. 37(6) (2015) - 2013
- [c1]Ali Al-Matouq, Tyrone L. Vincent, Luis Tenorio:
Reduced complexity dynamic programming solution for Kalman filtering of linear discrete time descriptor systems. ACC 2013: 340-345 - [i2]Yariv Dror Mizrahi, Nando de Freitas, Luis Tenorio:
Efficient Learning of Practical Markov Random Fields with Exact Inference. CoRR abs/1308.6342 (2013) - 2012
- [j3]Eldad Haber, Zhuojun Magnant, Christian Lucero, Luis Tenorio:
Numerical methods for A-optimal designs with a sparsity constraint for ill-posed inverse problems. Comput. Optim. Appl. 52(1): 293-314 (2012) - [i1]Ali Al-Matouq, Tyrone Vincent, Luis Tenorio:
Derivation of the Maximum a Posterori Estimate for Discrete Time Descriptor Systems. CoRR abs/1207.3136 (2012)
2000 – 2009
- 2008
- [j2]Peter McKenzie, Alexandra M. Newman, Luis Tenorio:
Front Range Aggregates Optimizes Feeder Movements at Its Quarry. Interfaces 38(6): 436-447 (2008) - 2001
- [j1]Luis Tenorio:
Statistical Regularization of Inverse Problems. SIAM Rev. 43(2): 347-366 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
