{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T12:57:10Z","timestamp":1773752230465,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1023\/a:1020533003783","type":"journal-article","created":{"date-parts":[[2003,3,18]],"date-time":"2003-03-18T15:12:43Z","timestamp":1048000363000},"page":"257-272","source":"Crossref","is-referenced-by-count":71,"title":["Interior-Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit Functions"],"prefix":"10.1007","volume":"23","author":[{"given":"Hande Y.","family":"Benson","sequence":"first","affiliation":[]},{"given":"Robert J.","family":"Vanderbei","sequence":"additional","affiliation":[]},{"given":"David F.","family":"Shanno","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5098019_CR1","unstructured":"A.R. Conn, N. Gould, and Ph.L. Toint, \u201cConstrained and unconstrained testing environment,\u201d available at http:\/\/www.dci.clrc.ac.uk\/Activity.asp?CUTE"},{"key":"5098019_CR2","unstructured":"E.D. Dolan and J.J. Mor\u00e9, \u201cBenchmarking optimization software with performance profiles,\u201d Technical report, Argonne National Laboratory, January 2001."},{"key":"5098019_CR3","volume-title":"Nonlinear Programming: Sequential Unconstrainted Minimization Techniques","author":"A.V. Fiacco","year":"1968","unstructured":"A.V. Fiacco and G.P. McCormick, Nonlinear Programming: Sequential Unconstrainted Minimization Techniques. Research Analysis Corporation, McLeanVirginia, 1968 (Republished in 1990 by SIAM, Philadelphia)."},{"key":"5098019_CR4","series-title":"Technical Report","volume-title":"Nonlinear programming without a penalty function","author":"R. Fletcher","year":"1997","unstructured":"R. Fletcher and S. Leyffer, \u201cNonlinear programming without a penalty function,\u201d Technical Report NA\/171, University of Dundee, Dept. of Mathematics, Dundee, Scotland, 1997."},{"key":"5098019_CR5","unstructured":"R. Fourer, D.M. Gay, and B.W. Kernighan, AMPL: A Modeling Language for Mathematical Programming, Scientific Press, 1993."},{"key":"5098019_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61582-5","volume-title":"More Test Samples for Nonlinear Programming Codes","author":"K. Schittkowski","year":"1987","unstructured":"K. Schittkowski, More Test Samples for Nonlinear Programming Codes, Springer Verlag: New York, 1987."},{"key":"5098019_CR7","unstructured":"D.F. Shanno, H.Y. Benson, and R.J. Vanderbei, \u201cInterior-point methods for nonconvex nonlinear programming: Filter methods and merit functions,\u201d Technical Report ORFE 00-06, Department of Operations Research and Financial Engineering, Princeton University, 2000."},{"issue":"2","key":"5098019_CR8","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s101070050116","volume":"87","author":"D.F. Shanno","year":"2000","unstructured":"D.F. Shanno and R.J. Vanderbei, \u201cInterior-point methods for nonconvex nonlinear programming: Orderings and higher-order methods,\u201d Math. Prog., vol. 87, no. 2, pp. 303\u2013316, 2000.","journal-title":"Math. Prog."},{"key":"5098019_CR9","unstructured":"R.J. Vanderbei, AMPL models, available at http:\/\/www.sor.princeton.edu\/~rvdb\/ampl\/nlmodels"},{"key":"5098019_CR10","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1080\/10556789908805759","volume":"12","author":"R.J. Vanderbei","year":"1999","unstructured":"R.J. Vanderbei, \u201cLOQO: An interior point code for quadratic programming,\u201d Optimization Methods and Software, vol. 12, pp. 451\u2013484, 1999.","journal-title":"Optimization Methods and Software"},{"key":"5098019_CR11","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1023\/A:1008677427361","volume":"13","author":"R.J. Vanderbei","year":"1999","unstructured":"R.J. Vanderbei and D.F. Shanno, \u201cAn interior-point algorithm for nonconvex nonlinear programming,\u201d Computational Optimization and Applications,\u201d vol. 13, pp. 231\u2013252, 1999.","journal-title":"Computational Optimization and Applications"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020533003783.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020533003783\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020533003783.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:15:36Z","timestamp":1752376536000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020533003783"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["5098019"],"URL":"https:\/\/doi.org\/10.1023\/a:1020533003783","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}