{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:27:19Z","timestamp":1787333239997,"version":"3.56.0"},"reference-count":38,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[1995,2]]},"abstract":"<jats:p>The authors present a primal interior-point algorithm for solving convex programs with nonlinear constraints. The algorithm uses a predictor-corrector strategy to follow a smooth path that leads from a given starting point to an optimal solution. A convergence analysis is given showing that under mild assumptions the algorithm simultaneously iterates towards feasibility and optimality. The matrices involved can be kept sparse if the nonlinear functions are separable or depend on only a few variables.<\/jats:p>\n                  <jats:p>A preliminary implementation has been developed. Some promising numerical results indicate that the algorithm may be efficient in practice, and that it can deal in a single phase with infeasible starting points without relying on some \u201cbig M\u201d parameter.<\/jats:p>","DOI":"10.1137\/0805008","type":"journal-article","created":{"date-parts":[[2005,2,23]],"date-time":"2005-02-23T05:50:53Z","timestamp":1109137853000},"page":"149-171","source":"Crossref","is-referenced-by-count":10,"title":["A Practical Interior-Point Method for Convex Programming"],"prefix":"10.1137","volume":"5","author":[{"given":"Florian","family":"Jarre","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael A.","family":"Saunders","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","first-page":"42","volume-title":"Computing methods in applied sciences and engineering (Paris, 1990)","author":"Conn A. R.","year":"1990"},{"key":"R2","volume-title":"Nonlinear programming: Sequential unconstrained minimization techniques","author":"Fiacco A.","year":"1968"},{"key":"R3","unstructured":"K. R. Frisch, The logarithmic potential method of convex programming, Technical Report, University Institute of Economics, Oslo, Norway, 1955"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582900"},{"key":"R5","unstructured":"P. E. Gill, 1991, Private communication"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"P. E. Gill, W. Murray, D. B. Poncele\u00f3n, M. A. Saunders, Solving reduced KKT systems in barrier methods for linear and quadratic programming, Report, SOL 91-7, Department of Operations Research, Stanford University, Stanford, CA, 1991","DOI":"10.21236\/ADA239191"},{"key":"R7","unstructured":"P. E. Ghil, W. Murray, M. A. Saunders, M. H. Wright, Shifted barrier methods for linear programming, Report, SOL 88-9, Department of Operations Research, Stanford University, Stanford, CA, 1988"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940075"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840457"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588796"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0083587"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01371086"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1137\/0331064"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0042223"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54509-3"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582283"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581253"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1137\/0802022"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1137\/0802028"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/114\/1097878"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9617-8_8"},{"key":"R23","unstructured":"J. Mennicken, Implementation of a first order central path following algorithm for solving large linear programs, Report, 202, Schwerpunktprogramm der DFG Anwendungsbezogene Optimierung und Steuerung, Institut f\u00fcr Ang. Math. and Statistik, Universit\u00e4t W\u00fcrzburg, Am Hubland, 1990"},{"key":"R24","volume-title":"PRO-MATLAB User's Guide","author":"Moler C.","year":"1987"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1287\/moor.15.3.408"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1007\/BF00932477"},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120949"},{"key":"R28","doi-asserted-by":"crossref","unstructured":"B. A. Murtagh, M. A. Saunders, MINOS 5.1 user's guide, Report, SOL 83-20R, Department of Operations Research, Stanford University, Stanford, CA, 1983, 1987","DOI":"10.21236\/ADA138522"},{"key":"R29","unstructured":"J. E. Nesterov, A. S. Nemirovsky, A general approach to polynomial-time algorithms design for convex programming, Report, Central Economical and Mathematical Institute, USSR Acad. Sci., Moscow, USSR, 1988"},{"key":"R30","unstructured":"J. E. Nesterov, A. S. Nemirovsky, Self-concordant functions and polynomial-time methods in convex programming, Central Economical and Mathematical Institute, USSR Acad. Sci., Moscow, USSR, 1989"},{"key":"R31","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580724"},{"key":"R32","doi-asserted-by":"publisher","DOI":"10.1007\/BF02739235"},{"key":"R33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61582-5"},{"key":"R34","unstructured":"D. F. Shanno, 1991, Private communication"},{"key":"R35","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0043914"},{"key":"R36","doi-asserted-by":"publisher","DOI":"10.1007\/BF01445161"},{"key":"R37","unstructured":"T. Tsuchiya, M. Muramatsu, Global convergence of a long-step affine scaling algorithm for degenerate linear progrmming problems, Report, 423, The Institute of Statistical Mathematics, Minami-Azabu, Tokyo 106, Japan, 1992"},{"key":"R38","doi-asserted-by":"crossref","unstructured":"M. H. Wright, Ph.D. Thesis, Numerical Methods for Nonlinearly Constrained Optimization, Computer Science Dept., Stanford University, Stanford, CA, 1976","DOI":"10.2172\/7333261"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0805008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:44:15Z","timestamp":1787330655000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0805008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,2]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,2]]}},"alternative-id":["10.1137\/0805008"],"URL":"https:\/\/doi.org\/10.1137\/0805008","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,2]]}}}