{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,31]],"date-time":"2026-08-31T22:54:54Z","timestamp":1788216894790,"version":"build-2803163510"},"reference-count":126,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM Rev."],"published-print":{"date-parts":[[2002,1]]},"abstract":"<jats:p>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.<\/jats:p>\n                  <jats:p>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.<\/jats:p>","DOI":"10.1137\/s0036144502414942","type":"journal-article","created":{"date-parts":[[2003,11,17]],"date-time":"2003-11-17T21:00:45Z","timestamp":1069102845000},"page":"525-597","source":"Crossref","is-referenced-by-count":538,"title":["Interior Methods for Nonlinear Optimization"],"prefix":"10.1137","volume":"44","author":[{"given":"Anders","family":"Forsgren","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philip E.","family":"Gill","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Margaret H.","family":"Wright","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,8,4]]},"reference":[{"key":"R1","unstructured":"Eugene Allgower, Kurt Georg, Continuation and path following, Acta Numer., Cambridge Univ. Press, Cambridge, 1993, 1\u20136494k:65076"},{"key":"R2","unstructured":"Eugene Allgower, Kurt Georg, Numerical path following, Handb. Numer. Anal., V, North\u2010Holland, Amsterdam, 1997, 3\u20132071470225"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1080\/10556789408805570"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623498344720"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896296921"},{"key":"R6","volume-title":"Nonlinear programming","author":"Bazaraa Mokhtar","year":"1979"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01415063"},{"key":"R8","unstructured":"H. Y. Benson, D. F. Shanno, and R. J. Vanderbei,\n                      Interior\u2010Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit Functions\n                      , Report ORFE\u201000\u201006, Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ, 2000."},{"key":"R9","unstructured":"H. Y. Benson, D. F. Shanno, and R. J. Vanderbei,\n                      Interior\u2010Point Methods for Nonconvex Nonlinear Programming: Jamming and Comparative Numerical Testing\n                      , Report ORFE\u201000\u201002, Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ, 2000."},{"key":"R10","unstructured":"Paul Boggs, Jon Tolle, Sequential quadratic programming, Acta Numer., Cambridge Univ. Press, Cambridge, 1995, 1\u20135196f:90097"},{"key":"R11","first-page":"0","volume":"26","author":"Borgwardt K.\u2010H.","year":"1982","journal-title":"Z. Oper. Res. Ser. A\u2010B"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-9859-3"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02206826"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011391"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497325107"},{"key":"R16","unstructured":"R. Byrd, Guanghui Liu, J. Nocedal, On the local behaviour of an interior point method for nonlinear programming, Pitman Res. Notes Math. Ser., Vol. 380, Longman, Harlow, 1998, 37\u20135699g:90116"},{"key":"R17","unstructured":"R. H. Byrd, M. Marazzi, and J. Nocedal,\n                      On the Convergence of Newton Iterations to Non\u2010Stationary Points\n                      , Report OTC 2001\/01, Optimization Technology Center, Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, 2001."},{"key":"R18","unstructured":"R. H. Byrd, J. Nocedal, and R. A. Waltz,\n                      Feasible Interior Methods Using Slacks for Nonlinear Optimization\n                      , Report OTC 2000\/11, Optimization Technology Center, Northwestern University, Evanston, IL, 2000."},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.2.169"},{"key":"R20","volume-title":"Linear programming","author":"Chv\u00e1tal Va\u0161ek","year":"1983"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1007\/s101070050112"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050046"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-97-00777-1"},{"key":"R24","unstructured":"Andrew Conn, Nicholas Gould, Philippe Toint, A primal\u2010dual algorithm for minimizing a non\u2010convex function subject to bound and linear equality constraints, Appl. Optim., Vol. 36, Kluwer Acad. Publ., Dordrecht, 2000, 15\u2013492001e:90061"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.2307\/1907852"},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.1137\/S036012995279031"},{"key":"R28","volume-title":"Numerical methods for unconstrained optimization and nonlinear equations","author":"Dennis John","year":"1983"},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/11.2.181"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1137\/0732012"},{"key":"R31","doi-asserted-by":"publisher","DOI":"10.1007\/BF02275347"},{"key":"R32","unstructured":"A. V. Fiacco,\n                      Barrier methods for nonlinear programming\n                      , in Operations Research Support Methodology, A. Holzman, ed., Marcel Dekker, New York, 1979, pp. 377\u2013440."},{"key":"R33","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971316"},{"key":"R34","volume-title":"Practical methods of optimization","author":"Fletcher R.","year":"1987"},{"key":"R35","unstructured":"R. Fletcher, N. I. M. Gould, S. Leyffer, and P. L. Toint,\n                      Global Convergence of Trust\u2010Region SQP\u2010Filter Algorithms for General Nonlinear Programming\n                      , Tech. Report 99\/03, D\u00e9partement de Math\u00e9matique, Facult\u00e9s Universitaires Notre\u2010Dame de la Paix (FUNDP), Namur, Belgium, 1999."},{"key":"R36","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100244"},{"key":"R37","volume-title":"Optimization","year":"1969"},{"key":"R38","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-9274(02)00119-8"},{"key":"R39","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496305560"},{"key":"R40","doi-asserted-by":"publisher","DOI":"10.1137\/0916009"},{"key":"R41","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479894270658"},{"key":"R42","doi-asserted-by":"publisher","DOI":"10.1137\/0614040"},{"key":"R43","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585158"},{"key":"R44","unstructured":"K. R. Frisch,\n                      The Logarithmic Potential Method of Convex Programming\n                      , memorandum, University Institute of Economics, Oslo, Norway, 1955."},{"key":"R45","doi-asserted-by":"publisher","DOI":"10.1007\/BF01593777"},{"key":"R46","unstructured":"David Gay, Michael Overton, Margaret Wright, A primal\u2010dual interior method for nonconvex nonlinear programming, Appl. Optim., Vol. 14, Kluwer Acad. Publ., Dordrecht, 1998, 31\u20135699h:90096"},{"key":"R47","unstructured":"E. M. Gertz and P. E. Gill,\n                      A Primal\u2010Dual Trust Region Algorithm for Nonlinear Programming\n                      , Numerical Analysis Report NA 02\u20101, University of California, San Diego, 2002."},{"key":"R48","unstructured":"J. C. Gilbert, C. C. Gonzaga, and E. Karas,\n                      Examples of ill\u2010behaved central paths in convex optimization\n                      , Math. Program., to appear."},{"key":"R49","unstructured":"P. E. Gill, W. Murray, D. B. Poncele\u00f3n, and M. A. Saunders,\n                      Solving Reduced KKT Systems in Barrier Methods for Linear and Quadratic Programming\n                      , Report SOL 91\u20107, Department of Operations Research, Stanford University, Stanford, CA, 1991."},{"key":"R50","unstructured":"P. Gill, W. Murray, D. Poncele\u00f3n, M. Saunders, Solving reduced KKT systems in barrier methods for linear programming, Pitman Res. Notes Math. Ser., Vol. 303, Longman Sci. Tech., Harlow, 1994, 89\u20131041267757"},{"key":"R51","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592025"},{"key":"R52","volume-title":"Practical optimization","author":"Gill Philip","year":"1981"},{"key":"R53","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479893252623"},{"key":"R54","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008705028512"},{"key":"R55","doi-asserted-by":"publisher","DOI":"10.1137\/1034048"},{"key":"R56","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585660"},{"key":"R57","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/6.3.357"},{"key":"R58","doi-asserted-by":"publisher","DOI":"10.1137\/0726007"},{"key":"R59","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400370515"},{"key":"R60","doi-asserted-by":"publisher","DOI":"10.1137\/0805008"},{"key":"R61","unstructured":"K. Jittorntrum,\n                      Sequential Algorithms in Nonlinear Programming\n                      , Ph.D. thesis, Department of Computer Science, Australian National University, Canberra, 1978."},{"key":"R62","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497330148"},{"key":"R63","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"R64","unstructured":"Victor Klee, George Minty, How good is the simplex algorithm? Academic Press, New York, 1972, 159\u201317548:10492"},{"key":"R65","unstructured":"A. S. Lewis and M. L. Overton,\n                      Eigenvalue optimization\n                      , in Acta Numerica, 1996, Vol. 5, Cambridge University Press, Cambridge, UK, 1996, pp. 149\u2013190."},{"key":"R66","first-page":"322","volume":"24","author":"Lootsma F.","year":"1969","journal-title":"Philips Res. Rep."},{"key":"R67","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(67)90163-1"},{"key":"R68","unstructured":"Marcelo Marazzi, Jorge Nocedal, Feasibility control in nonlinear optimization, London Math. Soc. Lecture Note Ser., Vol. 284, Cambridge Univ. Press, Cambridge, 2001, 125\u20131541836617"},{"key":"R69","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011416"},{"key":"R70","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1980.88.101"},{"key":"R71","unstructured":"Nimrod Megiddo, Pathways to the optimal set in linear programming, Springer, New York, 1989, 131\u201315890c:90147"},{"key":"R72","doi-asserted-by":"publisher","DOI":"10.1145\/192115.192132"},{"key":"R73","doi-asserted-by":"publisher","DOI":"10.1007\/BF00932477"},{"key":"R74","doi-asserted-by":"publisher","DOI":"10.1137\/0804013"},{"key":"R75","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592948"},{"key":"R76","unstructured":"Stephen Nash, R. Polyak, Ariela Sofer, A numerical comparison of barrier and modified barrier methods for large\u2010scale bound\u2010constrained optimization, Kluwer Acad. Publ., Dordrecht, 1994, 319\u20133381307177"},{"key":"R77","unstructured":"S. G. Nash and A. Sofer,\n                      Linear and Nonlinear Programming\n                      , McGraw\u2013Hill, New York, 1996."},{"key":"R78","unstructured":"S. G. Nash and A. Sofer,\n                      Why Extrapolation Helps Barrier Methods\n                      , Tech. Report, George Mason University, Fairfax, VA, 1998."},{"key":"R79","unstructured":"Y. Nesterov and A. Nemirovskii,\n                      Interior\u2010Point Polynomial Algorithms in Convex Programming\n                      , SIAM Stud. Appl. Math. 13, SIAM, Philadelphia, PA, 1994."},{"key":"R80","doi-asserted-by":"publisher","DOI":"10.1007\/b98874"},{"key":"R81","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719468"},{"key":"R82","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(88)90049-1"},{"key":"R83","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595284403"},{"key":"R84","doi-asserted-by":"publisher","DOI":"10.1007\/BF01586050"},{"key":"R85","unstructured":"D. B. Poncele\u00f3n,\n                      Barrier Methods for Large\u2010Scale Quadratic Programming\n                      , Ph.D. thesis, Department of Computer Science, Stanford University, Stanford, CA, 1990."},{"key":"R86","unstructured":"M. Powell, A method for nonlinear constraints in minimization problems, Academic Press, London, 1969, 283\u201329842:7284"},{"key":"R87","unstructured":"M. J. D. Powell,\n                      Problems related to unconstrained optimization\n                      , in Numerical Methods for Unconstrained Optimization, W. Murray, ed., Academic Press, London, New York, 1972, pp. 29\u201355."},{"key":"R88","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120989"},{"key":"R89","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"R90","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.6.1.23"},{"key":"R91","unstructured":"M. A. Saunders,\n                      Private communication\n                      , 1998."},{"key":"R92","volume-title":"Theory of linear and integer programming","author":"Schrijver Alexander","year":"1986"},{"key":"R93","doi-asserted-by":"publisher","DOI":"10.1007\/s101070050116"},{"key":"R94","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591902"},{"key":"R95","unstructured":"D. A. Spielman and S.\u2010H. Teng,\n                      Smoothed analysis: Why the simplex method usually takes polynomial time\n                      , in Proceedings of the Thirty\u2010Third Annual ACM Symposium on Theory of Computing, Crete, Greece, 2001, pp. 296\u2013305. The full paper is available at www\u2010math.mit.edu\/\u02dcspielman\/simplex."},{"key":"R96","unstructured":"G. Sporre and A. Forsgren,\n                      Relations between Divergence of Multipliers and Convergence to Infeasible Points in Primal\u2010Dual Interior Methods for Nonconvex Nonlinear Programming\n                      , Report TRITA\u2010MAT\u20102002\u2010OS7, Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden, 2002."},{"key":"R97","unstructured":"A. L. Tits, A. W\u00e4chter, S. Bakhtiari, T. J. Urban, and C. T. Lawrence,\n                      A Primal\u2010Dual Method for Nonlinear Programming with Strong Global and Local Convergence Properties\n                      , Tech. Report 2002\u201329, Institute for Systems Research, University of Maryland, College Park, MD, 2002."},{"key":"R98","doi-asserted-by":"publisher","DOI":"10.1007\/BF01299206"},{"key":"R99","unstructured":"M. J. Todd,\n                      Semidefinite optimization\n                      , in Acta Numerica, 2001, Cambridge University Press, Cambridge, UK, 2001, pp. 515\u2013560."},{"key":"R100","unstructured":"M. Ulbrich, S. Ulbrich, and L. Vicente,\n                      A Globally Convergent Primal\u2010Dual Interior\u2010Point Filter Method for Nonlinear Programming\n                      , manuscript, 2000."},{"key":"R101","doi-asserted-by":"publisher","DOI":"10.1137\/1038003"},{"key":"R102","doi-asserted-by":"publisher","DOI":"10.1137\/0805005"},{"key":"R103","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008677427361"},{"key":"R104","doi-asserted-by":"publisher","DOI":"10.1080\/10556789408805571"},{"key":"R105","unstructured":"M. C. Villalobos, R. A. Tapia, and Y. Zhang,\n                      The Sphere of Convergence of Newton\u2019s Method on Two Equivalent Systems from Nonlinear Programming\n                      , Tech. Report CRPC\u2010TR9915, Department of Computational and Applied Mathematics, Rice University, Houston, TX, 1999."},{"key":"R106","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011386"},{"key":"R107","unstructured":"A. W\u00e4chter and L. T. Biegler,\n                      Global and Local Convergence for a Class of Interior Point Methods for Nonlinear Programming\n                      , Tech. Report B\u201001\u201009, CAPD, Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA, 2001."},{"key":"R108","unstructured":"D. P. Williamson,\n                      Lecture Notes on Approximation Algorithms\n                      , Research Report RC 21409, IBM T. J. Watson Research Center, Yorktown Heights, NY, 1998."},{"key":"R108","unstructured":"Available online from www.almaden.ibm.com\/cs\/people\/dpw."},{"key":"R109","unstructured":"M. H. Wright,\n                      Numerical Methods for Nonlinearly Constrained Optimization\n                      , Ph.D. thesis, Department of Computer Science, Stanford University, Stanford, CA, 1976."},{"key":"R110","unstructured":"Margaret Wright, Interior methods for constrained optimization, Acta Numer., Cambridge Univ. Press, Cambridge, 1992, 341\u201340793d:90037"},{"key":"R111","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582224"},{"key":"R112","doi-asserted-by":"publisher","DOI":"10.1137\/0805001"},{"key":"R113","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497322279"},{"key":"R114","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479893260498"},{"key":"R115","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453"},{"key":"R116","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479894271093"},{"key":"R117","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018665102534"},{"key":"R118","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496304712"},{"key":"R119","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623498347438"},{"key":"R120","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011421"},{"key":"R121","doi-asserted-by":"publisher","DOI":"10.1007\/s101070050026"},{"key":"R122","unstructured":"S. J. Wright and D. Orban,\n                      Properties of the Log\u2010Barrier Function on Degenerate Nonlinear Programs\n                      , Preprint ANL\/MCS\u2010P772\u20100799, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1999."},{"key":"R123","unstructured":"Hiroshi Yamashita, Hiroshi Yabe, A primal\u2010dual interior point method for nonlinear optimization: global convergence, convergence rateand numerical performance for large scale problems, Lang, Frankfurt am Main, 2000, 213\u20132502002h:90126"},{"key":"R124","doi-asserted-by":"publisher","DOI":"10.1137\/0803019"},{"key":"R125","doi-asserted-by":"publisher","DOI":"10.1137\/0803006"}],"container-title":["SIAM Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0036144502414942","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T15:15:33Z","timestamp":1787238933000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S0036144502414942"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":126,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["10.1137\/S0036144502414942"],"URL":"https:\/\/doi.org\/10.1137\/s0036144502414942","relation":{},"ISSN":["0036-1445","1095-7200"],"issn-type":[{"value":"0036-1445","type":"print"},{"value":"1095-7200","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}