default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJorge J. Moré
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j38]Jorge J. Moré, Stefan M. Wild
:
Do you trust derivatives or differences? J. Comput. Phys. 273: 268-277 (2014)- 2012
- [j37]Jorge J. Moré, Stefan M. Wild:
Estimating Derivatives of Noisy Simulations. ACM Trans. Math. Softw. 38(3): 19:1-19:21 (2012) - 2011
- [j36]Jorge J. Moré, Stefan M. Wild:
Estimating Computational Noise. SIAM J. Sci. Comput. 33(3): 1292-1314 (2011)
2000 – 2009
- 2009
- [j35]Jorge J. Moré, Stefan M. Wild:
Benchmarking Derivative-Free Optimization Algorithms. SIAM J. Optim. 20(1): 172-191 (2009) - 2006
- [j34]Elizabeth D. Dolan, Jorge J. Moré, Todd S. Munson:
Optimality Measures for Performance Profiles. SIAM J. Optim. 16(3): 891-909 (2006) - 2005
- [j33]Sven Leyffer, Jorge J. Moré:
Foreword: Special Issue on Deterministic Global Optimization and Applications. Math. Program. 103(2): 203-205 (2005) - 2004
- [j32]Jorge J. Moré, Todd S. Munson:
Computing mountain passes and transition states. Math. Program. 100(1): 151-182 (2004) - 2002
- [j31]Elizabeth D. Dolan, Jorge J. Moré:
Benchmarking optimization software with performance profiles. Math. Program. 91(2): 201-213 (2002) - 2001
- [j30]Steven Benson, Lois C. McInnes, Jorge J. Moré:
A case study in the performance and scalability of optimization algorithms. ACM Trans. Math. Softw. 27(3): 361-376 (2001) - [i3]Jorge J. Moré:
Automatic Differentiation Tools in Optimization Software. CoRR cs.MS/0101001 (2001) - [i2]Steven Benson, Lois C. McInnes, Jorge J. Moré:
GPCG: A Case Study in the Performance and Scalability of Optimization Algorithms. CoRR cs.MS/0101018 (2001) - [i1]Elizabeth D. Dolan, Jorge J. Moré:
Benchmarking Optimization Software with Performance Profiles. CoRR cs.MS/0102001 (2001) - 2000
- [j29]Michael C. Ferris, Michael P. Mesnier, Jorge J. Moré:
NEOS and Condor: solving optimization problems over the Internet. ACM Trans. Math. Softw. 26(1): 1-18 (2000)
1990 – 1999
- 1999
- [j28]Jorge J. Moré, Zhijun Wu:
Distance Geometry Optimization for Protein Structures. J. Glob. Optim. 15(3): 219-234 (1999) - [j27]Chih-Jen Lin, Jorge J. Moré:
Newton's Method for Large Bound-Constrained Optimization Problems. SIAM J. Optim. 9(4): 1100-1127 (1999) - [j26]Chih-Jen Lin, Jorge J. Moré:
Incomplete Cholesky Factorizations with Limited Memory. SIAM J. Sci. Comput. 21(1): 24-45 (1999) - 1997
- [j25]Ali Bouaricha, Jorge J. Moré:
Impact of Partial Separability on Large-Scale Optimization. Comput. Optim. Appl. 7(1): 27-40 (1997) - [j24]Christian H. Bischof, Ali Bouaricha, Peyvand M. Khademi, Jorge J. Moré:
Computing Gradients in Large-Scale Optimization Using Automatic Differentiation. INFORMS J. Comput. 9(2): 185-194 (1997) - [j23]Jorge J. Moré, Zhijun Wu:
Global Continuation for Distance Geometry Problems. SIAM J. Optim. 7(3): 814-836 (1997) - 1996
- [j22]Jorge J. Moré:
Global Methods for Nonlinear Complementarity Problems. Math. Oper. Res. 21(3): 589-614 (1996) - 1995
- [c2]Jorge J. Moré, Zhijun Wu:
E-optimal solutions to distance geometry problems via global continuation. Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding 1995: 151-168 - 1994
- [j21]Brett M. Averick, Christian H. Bischof, Robert E. Bixby, Alan Carle, John E. Dennis Jr., Mahmoud El-Alem, Amr El-Bakry, Andreas Griewank, G. Johnson, Robert M. Lewis, Jorge J. Moré, Richard A. Tapia, Virginia Torczon, Karen Williamson:
Numerical Optimization At the Center for Research On Parallel Computation. Int. J. High Perform. Comput. Appl. 8(2): 143-153 (1994) - [j20]James V. Burke, Jorge J. Moré:
Exposing Constraints. SIAM J. Optim. 4(3): 573-595 (1994) - [j19]Brett M. Averick, Jorge J. Moré:
Evaluation of Large-scale Optimization Problems on Vector and Parallel Architectures. SIAM J. Optim. 4(4): 708-721 (1994) - [j18]Brett M. Averick, Jorge J. Moré, Christian H. Bischof, Alan Carle, Andreas Griewank:
Computing Large Sparse Jacobian Matrices Using Automatic Differentiation. SIAM J. Sci. Comput. 15(2): 285-294 (1994) - [j17]Jorge J. Moré, David J. Thuente:
Line search algorithms with guaranteed sufficient decrease. ACM Trans. Math. Softw. 20(3): 286-307 (1994) - 1991
- [j16]Jorge J. Moré, Stephen A. Vavasis:
On the solution of concave knapsack problems. Math. Program. 49: 397-411 (1991) - [j15]Jorge J. Moré, Gerardo Toraldo:
On the Solution of Large Quadratic Programming Problems with Bound Constraints. SIAM J. Optim. 1(1): 93-113 (1991) - 1990
- [j14]James V. Burke, Jorge J. Moré, Gerardo Toraldo:
Convergence Properties of Trust Region Methods for Linear and Convex Constraints. Math. Program. 47: 305-336 (1990)
1980 – 1989
- 1987
- [j13]Paul H. Calamai, Jorge J. Moré:
Projected gradient methods for linearly constrained problems. Math. Program. 39(1): 93-116 (1987) - 1985
- [j12]Thomas F. Coleman, Burton S. Garbow, Jorge J. Moré:
Software for Estimating Sparse Hessian Matrices. ACM Trans. Math. Softw. 11(4): 363-377 (1985) - [j11]Thomas F. Coleman, Burton S. Garbow, Jorge J. Moré:
Algorithm 636: FORTRAN Subroutines for Estimating Sparse Hessian Matrices. ACM Trans. Math. Softw. 11(4): 378 (1985) - 1984
- [j10]Thomas F. Coleman, Jorge J. Moré:
Estimation of sparse hessian matrices and graph coloring problems. Math. Program. 28(3): 243-270 (1984) - [j9]Thomas F. Coleman, Burton S. Garbow, Jorge J. Moré:
Software for estimating sparse Jacobian matrices. ACM Trans. Math. Softw. 10(3): 329-345 (1984) - [j8]Thomas F. Coleman, Burton S. Garbow, Jorge J. Moré:
Algorithm 618: FORTRAN subroutines for estimating sparse Jacobian Matrices. ACM Trans. Math. Softw. 10(3): 346-347 (1984) - 1982
- [c1]Jorge J. Moré:
Recent Developments in Algorithms and Software for Trust Region Methods. ISMP 1982: 258-287 - 1981
- [j7]Jorge J. Moré, Burton S. Garbow, Kenneth E. Hillstrom:
Testing Unconstrained Optimization Software. ACM Trans. Math. Softw. 7(1): 17-41 (1981) - [j6]Jorge J. Moré, Burton S. Garbow, Kenneth E. Hillstrom:
Algorithm 566: FORTRAN Subroutines for Testing Unconstrained Optimization Software [C5], [E4]. ACM Trans. Math. Softw. 7(1): 136-140 (1981) - 1980
- [j5]Jorge J. Moré, Michel Cosnard:
Algorithm 554: BRENTM, A Fortran Subroutine for the Numerical Solution of Nonlinear Equations [C5]. ACM Trans. Math. Softw. 6(2): 240-251 (1980)
1970 – 1979
- 1979
- [j4]Jorge J. Moré, Danny C. Sorensen:
On the use of directions of negative curvature in a modified newton method. Math. Program. 16(1): 1-20 (1979) - [j3]Jorge J. Moré, Michel Cosnard:
Numerical Solution of Nonlinear Equations. ACM Trans. Math. Softw. 5(1): 64-85 (1979) - 1974
- [j2]Jorge J. Moré:
Classes of functions and feasibility conditions in nonlinear complementarity problems. Math. Program. 6(1): 327-338 (1974) - 1973
- [j1]Jorge J. Moré, Richard W. Cottle, Louis J. Billera, Mark J. Eisner:
Book reviews. Math. Program. 4(1): 349-353 (1973)
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-04-24 23:13 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:
