The DOI matches its Crossref record; 70 of the 70 references it cites were found in a registry or an index.
Recent advances in trust region algorithms
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Algorithm for Least-Squares Estimation of Nonlinear Parameters
Marquardt, D. W. (1963) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0111030 · Cited by 30,728
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
A method for the solution of certain non-linear problems in least squares
Levenberg, K. (1944) · Quarterly of Applied Mathematics · doi:10.1090/qam/10666 · Cited by 12,359
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Optimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
On the limited memory BFGS method for large scale optimization
Liu, D. C., & Nocedal, J. (1989) · Mathematical Programming · doi:10.1007/bf01589116 · Cited by 8,560
Faires, J. D. (1978) · Cited by 6,711
The Levenberg-Marquardt algorithm: Implementation and theory
Moré, J. J. (1978) · Lecture Notes in Mathematics · doi:10.1007/bfb0067700 · Cited by 5,773
An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
Coleman, T. F., & Li, Y. (1996) · SIAM Journal on Optimization · doi:10.1137/0806023 · Cited by 3,320
Conn, A. R., Gould, N. I. M., & Toint, P. L. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719857 · Cited by 2,981
Introduction to Derivative-Free Optimization
Conn, A. R., Scheinberg, K., & Vicente, L. N. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718768 · Cited by 1,840
Mathematics and its applications
Yau, S. T. (2005) · The 2002 International Conference on Control and Automation, 2002. ICCA. Final Program and Book of Abstracts. · doi:10.1109/icca.2002.1229256 · Cited by 1,488
Powell, M. J. D. (1994) · Advances in Optimization and Numerical Analysis · doi:10.1007/978-94-015-8330-5_4 · Cited by 1,369
Coleman, T. F., & Li, Y. (1994) · Mathematical Programming · doi:10.1007/bf01582221 · Cited by 1,135
An interior algorithm for nonlinear optimization that combines line search and trust region steps
Waltz, R. A., Morales, J. L., Nocedal, J., & Orban, D. (2006) · Mathematical Programming · doi:10.1007/s10107-004-0560-5 · Cited by 1,057
Knitro: An Integrated Package for Nonlinear Optimization
Byrd, R. H., Nocedal, J., & Waltz, R. A. (2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30065-1_4 · Cited by 979
Numerical methods for nonlinear algebraic equations
Rabinowitz, P. (1970) · Gordon and Breach Science Publishers eBooks · Cited by 900
Nonlinear programming without a penalty function
Fletcher, R., & Leyffer, S. (2002) · Mathematical Programming · doi:10.1007/s101070100244 · Cited by 874
The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
Steihaug, T. (1983) · SIAM Journal on Numerical Analysis · doi:10.1137/0720042 · Cited by 824
Cubic regularization of Newton method and its global performance
Nesterov, Y., & Polyak, B. T. (2006) · Mathematical Programming · doi:10.1007/s10107-006-0706-8 · Cited by 781
Mathematical Programming The State of the Art
Bachem, A., Grötschel, M., & Korte, B. H. (1983) · Springer eBooks · doi:10.1007/978-3-642-68874-4 · Cited by 728
Practical Methods of Optimization. Volume 1: Unconstrained Optimization
Williams, T. (1980) · Cited by 697
Gould, N. I. M., Orban, D., & Toint, P. L. (2003) · ACM Transactions on Mathematical Software · doi:10.1145/962437.962439 · Cited by 584
Newton’s Method with a Model Trust Region Modification
Sorensen, D. C. (1982) · SIAM Journal on Numerical Analysis · doi:10.1137/0719026 · Cited by 560
Direct search algorithms for optimization calculations
Powell, M. J. D. (1998) · Acta Numerica · doi:10.1017/s0962492900002841 · Cited by 558
The NEWUOA software for unconstrained optimization without derivatives
Powell, M. J. D. (2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30065-1_16 · Cited by 473
Trust-Region Methods on Riemannian Manifolds
Absil, P.-A., Baker, C. G., & Gallivan, K. A. (2007) · Foundations of Computational Mathematics · doi:10.1007/s10208-005-0179-9 · Cited by 461
A New Algorithm for Unconstrained Optimization
POWELL, M. J. D. (1970) · Nonlinear Programming · doi:10.1016/b978-0-12-597050-1.50006-3 · Cited by 447
Recent Developments in Algorithms and Software for Trust Region Methods
Moré, J. J. (1983) · Mathematical Programming The State of the Art · doi:10.1007/978-3-642-68874-4_11 · Cited by 359
A Trust Region Algorithm for Nonlinearly Constrained Optimization
Byrd, R. H., Schnabel, R. B., & Shultz, G. A. (1987) · SIAM Journal on Numerical Analysis · doi:10.1137/0724076 · Cited by 353
UOBYQA: unconstrained optimization by quadratic approximation
Powell, M. J. D. (2002) · Mathematical Programming · doi:10.1007/s101070100290 · Cited by 352
Cartis, C., Gould, N. I. M., & Toint, P. L. (2009) · Mathematical Programming · doi:10.1007/s10107-009-0286-5 · Cited by 348
Large-Scale Nonlinear Optimization
(2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30065-1 · Cited by 333
On Cones of Nonnegative Quadratic Functions
Sturm, J. F., & Zhang, S. (2003) · Mathematics of Operations Research · doi:10.1287/moor.28.2.246.14485 · Cited by 319
Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
Conn, A. R., Gould, N. I. M., & Toint, P. L. (1988) · SIAM Journal on Numerical Analysis · doi:10.1137/0725029 · Cited by 317
Computing Optimal Locally Constrained Steps
Gay, D. M. (1981) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0902016 · Cited by 293
Cartis, C., Gould, N. I. M., & Toint, P. L. (2010) · Mathematical Programming · doi:10.1007/s10107-009-0337-y · Cited by 275
Recent progress in unconstrained nonlinear optimization without derivatives
Conn, A. R., Scheinberg, K., & Toint, P. L. (1997) · Mathematical Programming · doi:10.1007/bf02614326 · Cited by 255
ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions
Wild, S. M., Regis, R. G., & Shoemaker, C. A. (2008) · SIAM Journal on Scientific Computing · doi:10.1137/070691814 · Cited by 241
Conn, A. R., Scheinberg, K., & Vicente, L. N. (2009) · SIAM Journal on Optimization · doi:10.1137/060673424 · Cited by 213
Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
Gratton, S., Sartenaer, A., & Toint, P. L. (2008) · SIAM Journal on Optimization · doi:10.1137/050623012 · Cited by 174
Developments of NEWUOA for minimization without derivatives
Powell, M. J. D. (2008) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drm047 · Cited by 154
On the convergence of derivative-free methods for unconstrained optimization
Conn, A., Scheinberg, K., & Toint, P. L. (1997) · Repository of the University of Namur · Cited by 152
RTRMC: A Riemannian trust-region method for low-rank matrix completion
Boumal, N., & Absil, P.-A. (2011) · Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) · Cited by 143
On a subproblem of trust region algorithms for constrained optimization
Yuan, Y. (1990) · Mathematical Programming · doi:10.1007/bf01580852 · Cited by 142
Self-citationIncorporating minimum Frobenius norm models in direct search
Custódio, A. L., Rocha, H., & Vicente, L. N. (2009) · Computational Optimization and Applications · doi:10.1007/s10589-009-9283-0 · Cited by 142
Vardi, A. (1985) · SIAM Journal on Numerical Analysis · doi:10.1137/0722035 · Cited by 139
On trust region methods for unconstrained minimization without derivatives
Powell, M. J. D. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0430-6 · Cited by 134
Trust region algorithms for optimization with nonlinear equality and inequality constraints
Omojokun, E. O. (1990) · Cited by 133
An Algorithm using Quadratic Interpolation for Unconstrained Derivative Free Optimization
Conn, A. R., & Toint, P. L. (1996) · Springer eBooks · doi:10.1007/978-1-4899-0289-4_3 · Cited by 120
Descent methods for composite nondifferentiable optimization problems
Burke, J. V. (1985) · Mathematical Programming · doi:10.1007/bf01584377 · Cited by 119
Convergence of Trust-Region Methods Based on Probabilistic Models
Bandeira, A. S., Scheinberg, K., & Vicente, L. N. (2014) · SIAM Journal on Optimization · doi:10.1137/130915984 · Cited by 116
Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization
Chen, X., Niu, L., & Yuan, Y. (2013) · SIAM Journal on Optimization · doi:10.1137/120871390 · Cited by 100
Self-citationWedge trust region methods for derivative free optimization
Marazzi, M., & Nocedal, J. M. (2002) · Mathematical Programming · doi:10.1007/s101070100264 · Cited by 98
Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
Ai, W., & Zhang, S. (2009) · SIAM Journal on Optimization · doi:10.1137/07070601x · Cited by 87
Global Convergence of Radial Basis Function Trust-Region Algorithms for Derivative-Free Optimization
Wild, S. M., & Shoemaker, C. A. (2013) · SIAM Review · doi:10.1137/120902434 · Cited by 87
Direct Search Based on Probabilistic Descent
Gratton, S., Royer, C. W., Vicente, L. N., & Zhang, Z. (2015) · SIAM Journal on Optimization · doi:10.1137/140961602 · Cited by 81
On solving trust-region and other regularised subproblems in optimization
Gould, N. I. M., Robinson, D. P., & Thorne, H. S. (2010) · Mathematical Programming Computation · doi:10.1007/s12532-010-0011-7 · Cited by 79
An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
Gratton, S., Toint, P. L., & Tröltzsch, A. (2011) · Optimization methods & software · doi:10.1080/10556788.2010.549231 · Cited by 63
Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization
Scheinberg, K., & Toint, P. L. (2010) · SIAM Journal on Optimization · doi:10.1137/090748536 · Cited by 59
Yamashita, H., Yabe, H., & Tanabe, T. (2004) · Mathematical Programming · doi:10.1007/s10107-004-0508-9 · Cited by 56
On the geometry phase in model-based algorithms for derivative-free optimization
Fasano, G., Morales, J. L., & Nocedal, J. M. (2008) · Optimization methods & software · doi:10.1080/10556780802409296 · Cited by 53
BOOSTERS: A DERIVATIVE-FREE ALGORITHM BASED ON RADIAL BASIS FUNCTIONS
Oeuvray, R., & Bierlaire, M. (2009) · International Journal of Modelling and Simulation · doi:10.2316/journal.205.2009.1.205-4634 · Cited by 40
Billups, S. C., Larson, J. M., & Graf, P. A. (2013) · SIAM Journal on Optimization · doi:10.1137/100814688 · Cited by 37
Villacorta, K. D. V., Oliveira, P. R., & Soubeyran, A. (2013) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-013-0392-7 · Cited by 35
On the convergence of trust region algorithms for unconstrained minimization without derivatives
Powell, M. J. D. (2012) · Computational Optimization and Applications · doi:10.1007/s10589-012-9483-x · Cited by 28
Tröltzsch, A. (2014) · Optimization Letters · doi:10.1007/s11590-014-0830-y · Cited by 24
A derivative-free trust-funnel method for equality-constrained nonlinear optimization
Sampaio, P. R., & Toint, P. L. (2014) · Computational Optimization and Applications · doi:10.1007/s10589-014-9715-3 · Cited by 24
A surrogate management framework using rigorous trust-region steps
Gratton, S., & Vicente, L. N. (2012) · Optimization methods & software · doi:10.1080/10556788.2012.719508 · Cited by 14
Sobolev seminorm of quadratic functions with applications to derivative-free optimization
Zhang, Z. (2013) · Mathematical Programming · doi:10.1007/s10107-013-0679-3 · Cited by 13
Cited by
Non-convex Optimization for Machine Learning
Jain, P., & Kar, P. (2017) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000058 · Cited by 364
An artificial agent for robust image registration
Liao, R., Miao, S., De Tournemire, P., Grbic, S., Kamen, A., Mansi, T., & Comaniciu, D. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.11230 · Cited by 199
Formal Methods for Autonomous Systems
Wongpiromsarn, T., Ghasemi, M., Cubuktepe, M., Bakirtzis, G., Carr, S., Karabag, M. O., Neary, C., Gohari, P., & Topcu, U. (2023) · Foundations and Trends® in Systems and Control · doi:10.1561/2600000029 · Cited by 17
Metadata
- Authors
- Yuan, Y.-X.
- Venue
- Mathematical Programming
- Published
- 2015-03-15
- Volume
- 151
- Issue
- 1
- Pages
- 249-281
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2080108722
- Cited by
- 314
- References
- 70
- FWCI
- 22.36
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.