The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.
Interior-point methods for optimization
Abstract
This article describes the current state of the art of interior-point methods (IPMs) for convex, conic, and general nonlinear optimization. We discuss the theory, outline the algorithms, and comment on the applicability of this class of methods, which have revolutionized the field over the last twenty years.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Linear Matrix Inequalities in System and Control Theory
Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970777 · Cited by 21,687
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Wächter, A., & Biegler, L. T. (2006) · Mathematical Programming · doi:10.1007/s10107-004-0559-y · Cited by 9,483
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
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
Global Optimization with Polynomials and the Problem of Moments
Lasserre, J. B. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623400366802 · Cited by 2,474
Applications of second-order cone programming
Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(98)10032-0 · Cited by 2,401
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
Nonlinear Programming: Sequential Unconstrained Minimization Techniques
Fiacco, A. V., & McCormick, G. P. (1968) · Defense Technical Information Center (DTIC) · Cited by 2,262
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
Powell, M. J. D. (1969) · The Computer Journal · doi:10.1093/comjnl/12.3.207-a · Cited by 1,757
Variational methods for the solution of problems of equilibrium and vibrations
Courant, R. (1943) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1943-07818-4 · Cited by 1,711
Faraut, J., & Korányi, A. (1994) · doi:10.1093/oso/9780198534778.001.0001 · Cited by 1,656
Semidefinite programming relaxations for semialgebraic problems
Parrilo, P. A. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0387-5 · Cited by 1,527
(2006) · Optimal Control and Forecasting of Complex Dynamical Systems · doi:10.1142/9789812774248_0002 · Cited by 1,362
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
Interior Point Algorithms: Theory and Analysis
Ye, Y. (1997) · Wiley eBooks · doi:10.1002/9781118032701 · Cited by 939
Linear Programming: Foundations and Extensions
Vanderbei, R. J. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600987 · Cited by 916
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
Alizadeh, F. (1995) · SIAM Journal on Optimization · doi:10.1137/0805002 · Cited by 892
Handbook of Semidefinite Programming
(2000) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-4381-7 · Cited by 781
An Interior-Point Method for Semidefinite Programming
Helmberg, C., Rendl, F., Vanderbei, R. J., & Wolkowicz, H. (1996) · SIAM Journal on Optimization · doi:10.1137/0806020 · Cited by 706
Interior Methods for Nonlinear Optimization
Forsgren, A., Gill, P. E., & Wright, M. H. (2002) · SIAM Review · doi:10.1137/s0036144502414942 · Cited by 699
A Mathematical View of Interior-Point Methods in Convex Optimization
Renegar, J. (2001) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718812 · Cited by 631
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
Nesterov, Y. E., & Todd, M. J. (1997) · Mathematics of Operations Research · doi:10.1287/moor.22.1.1 · Cited by 612
Self-citationPathways 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
A polynomial-time algorithm, based on Newton's method, for linear programming
Renegar, J. (1988) · Mathematical Programming · doi:10.1007/bf01580724 · Cited by 588
Handbook of semidefinite programming : theory, algorithms, and applications
Wolkowicz, H., Saigal, R., & Vandenberghe, L. (2000) · Cited by 568
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
Theory and algorithms for linear optimization : an interior point approach
Roos, C., Tamás Terlaky, B., & Vial, J.-P. (1997) · Wiley eBooks · Cited by 506
Interior path following primal-dual algorithms. part I: Linear programming
Monteiro, R. D. C., & Adler, I. (1989) · Mathematical Programming · doi:10.1007/bf01587075 · Cited by 486
Alizadeh, F., Haeberly, J.-P. A., & Overton, M. L. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496304700 · Cited by 480
Gill, P. E., Murray, W., Saunders, M. A., et al. (1986) · Mathematical Programming · doi:10.1007/bf02592025 · Cited by 446
Solving Real-World Linear Programs: A Decade and More of Progress
Bixby, R. E. (2002) · Operations Research · doi:10.1287/opre.50.1.3.17780 · Cited by 386
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
Ye, Y., Todd, M. J., & Mizuno, S. (1994) · Mathematics of Operations Research · doi:10.1287/moor.19.1.53 · Cited by 354
Self-citationA polynomial-time algorithm for a class of linear complementarity problems
Kojima, M., Mizuno, S., & Yoshise, A. (1989) · Mathematical Programming · doi:10.1007/bf01587074 · Cited by 345
(2018) · An Introduction to Numerical Methods · doi:10.1201/9781315107042-14 · Cited by 335
Large-Scale Nonlinear Optimization
(2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30065-1 · Cited by 333
Minimizing polynomial functions
Parrilo, P. A., & Sturmfels, B. (2003) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/060/08 · Cited by 316
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
On the Nesterov--Todd Direction in Semidefinite Programming
Todd, M. J., Toh, K.-C., & Tütüncü, R. H. (1998) · SIAM Journal on Optimization · doi:10.1137/s105262349630060x · Cited by 261
Self-citationSolving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming
Bomze, I. M., & De Klerk, E. (2002) · Journal of Global Optimization · doi:10.1023/a:1020209017701 · Cited by 219
Linear systems in Jordan algebras and primal-dual interior-point algorithms
Faybusovich, L. (1997) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(97)00153-2 · Cited by 212
Semidefinite programming in combinatorial optimization
Goemans, M. X. (1997) · Mathematical Programming · doi:10.1007/bf02614315 · Cited by 208
On Copositive Programming and Standard Quadratic Optimization Problems
Bomze, I. M., Dür, M., de Klerk, E., Roos, C., Quist, A. J., & Terlaky, T. (2000) · Journal of Global Optimization · doi:10.1023/a:1026583532263 · Cited by 196
Applications of Optimization with Xpress-MP
Guéret, C., Prins, C., & Sevaux, M. (2002) · Cited by 183
Progress in mathematical programming — interior-point and related methods
Tolla, P. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90098-v · Cited by 183
On Standard Quadratic Optimization Problems
Bomze, I. M. (1998) · Journal of Global Optimization · doi:10.1023/a:1008369322970 · Cited by 159
Numerical methods for large-scale nonlinear optimization
Gould, N. I. M., Orban, D., & Toint, P. L. (2005) · Acta Numerica · doi:10.1017/s0962492904000248 · Cited by 159
Hyperbolic Programs, and Their Derivative Relaxations
Renegar, J. (2006) · Foundations of Computational Mathematics · doi:10.1007/s10208-004-0136-z · Cited by 146
Progress in Mathematical Programming: Interior-Point and Related Methods
Megiddo, N. (2011) · Cited by 140
A simplified homogeneous and self-dual linear programming algorithm and its implementation
Xu, X., Hung, P.-F., & Yinyu Ye, Y. (1996) · Annals of Operations Research · doi:10.1007/bf02206815 · Cited by 118
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
System Modeling and Optimization
(1982) · Lecture notes in control and information sciences · doi:10.1007/bfb0006119 · Cited by 92
On a homogeneous algorithm for the monotone complementarity problem
Andersen, E. D., & Ye, Y. (1999) · Mathematical Programming · doi:10.1007/s101070050027 · Cited by 90
Chai, J.-S., & Toh, K.-C. (2007) · Computational Optimization and Applications · doi:10.1007/s10589-006-9006-8 · Cited by 34
Cited by
Nanophotonic particle simulation and inverse design using artificial neural networks
Peurifoy, J., Shen, Y., Jing, L., Yang, Y., Cano-Renteria, F., DeLacy, B. G., Joannopoulos, J. D., Tegmark, M., & Soljačić, M. (2018) · Science Advances · doi:10.1126/sciadv.aar4206 · Cited by 964
Robust and Secure Wireless Communications via Intelligent Reflecting Surfaces
Yu, X., Xu, D., Sun, Y., Ng, D. W. K., & Schober, R. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3007043 · Cited by 833
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
Reconfigurable Intelligent Surface for Green Edge Inference
Hua, S., Zhou, Y., Yang, K., Shi, Y., & Wang, K. (2021) · IEEE Transactions on Green Communications and Networking · doi:10.1109/tgcn.2021.3058657 · Cited by 74
Metadata
- Authors
- Nemirovski, A. S., & Todd, M. J.
- Venue
- Acta Numerica
- Publisher
- Cambridge University Press (CUP)
- Published
- 2008-04-25
- Volume
- 17
- Pages
- 191-234
- ISSN
- 0962-4929 (ISSN-L)
- 1474-0508
- OpenAlex
- W2124488712
- Cited by
- 265
- References
- 58
- FWCI
- 7.00
- 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.