The DOI matches its Crossref record; 64 of the 64 references it cites were found in a registry or an index.
Interior Methods for Nonlinear Optimization
Abstract
Interior methods are an omnipresent, conspicuous feature of the constrained optimization landscape today, but it was not always so. Primarily in the form of barrier methods, interior-point techniques were popular during the 1960s for solving nonlinearly constrained problems. However, their use for linear programming was not even contemplated because of the total dominance of the simplex method. Vague but continuing anxiety about barrier methods eventually led to their abandonment in favor of newly emerging, apparently more efficient alternatives such as augmented Lagrangian and sequential quadratic programming methods. By the early 1980s, barrier methods were almost without exception regarded as a closed chapter in the history of optimization. This picture changed dramatically with Karmarkar's widely publicized announcement in 1984 of a fast polynomial-time interior method for linear programming; in 1985, a formal connection was established between his method and classical barrier methods. Since then, interior methods have advanced so far, so fast, that their influence has transformed both the theory and practice of constrained optimization. This article provides a condensed, selective look at classical material and recent research about interior methods for nonlinearly constrained optimization.
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
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
Iterative Solution of Nonlinear Equations in Several Variables
Ortega, J. M., & Rheinboldt, W. C. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719468 · Cited by 6,860
Practical methods of optimization
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90129-2 · Cited by 5,818
Nonlinear programming: theory and algorithms
(1993) · Computers & Operations Research · doi:10.1016/0305-0548(93)90042-h · Cited by 5,779
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
Levary, R. R. (1982) · European Journal of Operational Research · doi:10.1016/0377-2217(82)90093-5 · Cited by 4,158
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
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
Theory of Linear and Integer Programming
Smith, D. K. (1987) · Journal of the Operational Research Society · doi:10.1057/jors.1987.94 · Cited by 2,708
Primal-Dual Interior-Point Methods
Wright, S. J. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971453 · Cited by 2,391
Sequential quadratic programming
Boggs, P. T., & Tolle, J. W. (1995) · Acta Numerica · doi:10.1017/s0962492900002518 · Cited by 1,858 · cited 1×
“, [6, 10, 34, 52, 77, 80]) and that we do not exploit the full generality of SQP methods.”
BackgroundAn Interior Point Algorithm for Large-Scale Nonlinear Programming
Byrd, R. H., Hribar, M. E., & Nocedal, J. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623497325107 · Cited by 1,739
A trust region method based on interior point techniques for nonlinear programming
Byrd, R. H., Gilbert, J. C., & Nocedal, J. (2000) · Mathematical Programming · doi:10.1007/pl00011391 · Cited by 1,638
Some NP-complete problems in quadratic and nonlinear programming
Murty, K. G., & Kabadi, S. N. (1987) · Mathematical Programming · doi:10.1007/bf02592948 · Cited by 1,003
Practical methods of optimization; (2nd ed.)
Fletcher, R. (1987) · Wiley-Interscience eBooks · Cited by 964
Nonlinear programming without a penalty function
Fletcher, R., & Leyffer, S. (2002) · Mathematical Programming · doi:10.1007/s101070100244 · Cited by 874
Convex Analysis and Nonlinear Optimization
Borwein, J. M., & Lewis, A. S. (2006) · CMS books in mathematics · doi:10.1007/978-0-387-31256-9 · Cited by 780
HOW GOOD IS THE SIMPLEX ALGORITHM
Klee, V. L., & Minty, G. J. (1970) · Cited by 769
Linear and nonlinear programming
(2005) · Economists’ Mathematical Manual · doi:10.1007/3-540-28518-0_15 · Cited by 766
Mangasarian, O. L., & Fromovitz, S. (1967) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(67)90163-1 · Cited by 622
Numerical Methods for Unconstrained Optimization and Nonlinear Equations.
Kass, R. E., Dennis, J. E., & Schnabel, R. B. (1985) · Journal of the American Statistical Association · doi:10.2307/2288097 · Cited by 602
Pathways to the Optimal Set in Linear Programming
Megiddo, N. (1989) · Progress in Mathematical Programming · doi:10.1007/978-1-4613-9617-8_8 · Cited by 588
Line search algorithms with guaranteed sufficient decrease
Moré, J. J., & Thuente, D. J. (1994) · ACM Transactions on Mathematical Software · doi:10.1145/192115.192132 · Cited by 528
An Interior-Point Algorithm for Nonconvex Nonlinear Programming
Vanderbei, R. J., & Shanno, D. F. (1999) · Computational Optimization and Applications · doi:10.1023/a:1008677427361 · Cited by 526
Nonlinear Programming: Sequential Unconstrained Minimization Techniques
Fiacco, A. V., & McCormick, G. P. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971316 · Cited by 470
Gill, P. E., Murray, W., Saunders, M. A., et al. (1986) · Mathematical Programming · doi:10.1007/bf02592025 · Cited by 446
Self-citationGeneralized equations and their solutions, part II: Applications to nonlinear programming
Robinson, S. M. (1982) · Mathematical programming studies · doi:10.1007/bfb0120989 · Cited by 407
Convex Analysis and Nonlinear Optimization
Borwein, J. M., & Lewis, A. S. (2000) · Springer eBooks · doi:10.1007/978-1-4757-9859-3 · Cited by 394
On the formulation and theory of the Newton interior-point method for nonlinear programming
El-Bakry, A. S., Tapia, R. A., Tsuchiya, T., & Zhang, Y. (1996) · Journal of Optimization Theory and Applications · doi:10.1007/bf02275347 · Cited by 363
Conn, A. R., Gould, N. I. M., & Toint, P. L. (1997) · Mathematics of Computation · doi:10.1090/s0025-5718-97-00777-1 · Cited by 353
Path-Following Methods for Linear Programming
Gonzaga, C. C. (1992) · SIAM Review · doi:10.1137/1034048 · Cited by 341
The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
Carroll, C. W. (1961) · Operations Research · doi:10.1287/opre.9.2.169 · Cited by 313
Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
Fletcher, R., Gould, N. I. M., Leyffer, S., Toint, P. L., & Wächter, A. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623499357258 · Cited by 279
On the average number of steps of the simplex method of linear programming
Smale, S. (1983) · Mathematical Programming · doi:10.1007/bf02591902 · Cited by 279
Continuation and path following
Allgower, E. L., & Georg, K. (1993) · Acta Numerica · doi:10.1017/s0962492900002336 · Cited by 269
Modified barrier functions (theory and methods)
Polyak, R. A. (1992) · Mathematical Programming · doi:10.1007/bf01586050 · Cited by 254
Franklin, J. (1980) · Undergraduate Texts in Mathematics · doi:10.1007/978-3-662-25317-5_2 · Cited by 220
Allgower, E. L., & Georg, K. (1997) · Handbook of Numerical Analysis · doi:10.1016/s1570-8659(97)80002-6 · Cited by 216
A globally convergent primal-dual interior-point filter method for nonlinear programming
Ulbrich, M., Ulbrich, S., & Vicente, L. N. (2004) · Mathematical Programming · doi:10.1007/s10107-003-0477-4 · Cited by 210
Symmetric Quasidefinite Matrices
Vanderbei, R. J. (1995) · SIAM Journal on Optimization · doi:10.1137/0805005 · Cited by 202
Checking local optimality in constrained quadratic programming is NP-hard
Pardalos, P. M., & Schnitger, G. (1988) · Operations Research Letters · doi:10.1016/0167-6377(88)90049-1 · Cited by 183
Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
Forsgren, A., & Gill, P. E. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496305560 · Cited by 174
Self-citationDefinite and Semidefinite Quadratic Forms
Debreu, G. (1952) · Econometrica · doi:10.2307/1907852 · Cited by 158
Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
Dennis, J. E., Heinkenschloss, M., & Vicente, L. N. (1998) · SIAM Journal on Control and Optimization · doi:10.1137/s036012995279031 · Cited by 121
A Primal-dual Interior Method for Nonconvex Nonlinear Programming
Gay, D. M., Overton, M. L., & Wright, M. H. (1998) · Applied optimization · doi:10.1007/978-1-4613-3335-7_2 · Cited by 117
Self-citationInterior-Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit Functions
Benson, H. Y., Vanderbei, R. J., & Shanno, D. F. (2002) · Computational Optimization and Applications · doi:10.1023/a:1020533003783 · Cited by 113
Failure of global convergence for a class of interior point methods for nonlinear programming
Wächter, A., & Biegler, L. T. (2000) · Mathematical Programming · doi:10.1007/pl00011386 · Cited by 100
Gould, N. I. M. (1985) · Mathematical Programming · doi:10.1007/bf01585660 · Cited by 96
Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming
Wright, M. H. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623497322279 · Cited by 91
Self-citationA primal-dual trust-region algorithm for non-convex nonlinear programming
Conn, A. R., Gould, N. I. M., Orban, D., & Toint, P. L. (2000) · Mathematical Programming · doi:10.1007/s101070050112 · Cited by 82
Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming
Gould, N. I. M., Orban, D., Sartenaer, A., & Toint, P. L. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623400370515 · Cited by 70
Forsgren, A. L., Gill, P. E., & Shinnerl, J. R. (1996) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479894270658 · Cited by 64
Self-citationOn the Local Behavior of an Interior Point Method for Nonlinear Programming
Nocedal, J. (1997) · Cited by 62
Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming
Wright, S. J. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623496304712 · Cited by 52
Some properties of the Hessian of the logarithmic barrier function
Wright, M. H. (1994) · Mathematical Programming · doi:10.1007/bf01582224 · Cited by 43
Self-citationEffects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming
Wright, S. J. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623498347438 · Cited by 38
A Practical Interior-Point Method for Convex Programming
Jarre, F., & Saunders, M. A. (1995) · SIAM Journal on Optimization · doi:10.1137/0805008 · Cited by 18
A Primal-Dual Method for Large-Scale Image Reconstruction in Emission Tomography
Johnson, C. A., & Sofer, A. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623497330148 · Cited by 10
Cited by
Wächter, A., & Biegler, L. T. (2006) · Mathematical Programming · doi:10.1007/s10107-004-0559-y · Cited by 9,483
A sparse signal reconstruction perspective for source localization with sensor arrays
Malioutov, D., Cetin, M., & Willsky, A. S. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.850882 · Cited by 2,638
Control Barrier Function Based Quadratic Programs for Safety Critical Systems
Ames, A. D., Xu, X., Grizzle, J. W., & Tabuada, P. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2638961 · Cited by 2,512
Interior Point Methods for Nonlinear Optimization
Pólik, I., & Terlaky, T. (2010) · Lecture Notes in Mathematics · doi:10.1007/978-3-642-11339-0_4 · Cited by 394
Interior point methods 25 years later
Gondzio, J. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2011.09.017 · Cited by 377
Metadata
- Authors
- Forsgren, A., Gill, P. E., & Wright, M. H.
- Venue
- SIAM Review
- Published
- 2002-01
- Volume
- 44
- Issue
- 4
- Pages
- 525-597
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2069671092
- Cited by
- 699
- References
- 64
- FWCI
- 13.01
- 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.