{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T00:41:40Z","timestamp":1768351300368,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1979,12,1]],"date-time":"1979-12-01T00:00:00Z","timestamp":312854400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1979,12]]},"DOI":"10.1007\/bf01582118","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:28:41Z","timestamp":1114676921000},"page":"303-324","source":"Crossref","is-referenced-by-count":32,"title":["A first order, exact penalty function algorithm for equality constrained optimization problems"],"prefix":"10.1007","volume":"16","author":[{"given":"D. Q.","family":"Mayne","sequence":"first","affiliation":[]},{"given":"N.","family":"Maratos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/BF01584657","volume":"4","author":"J. Asaadi","year":"1973","unstructured":"J. Asaadi, \u201cA computational comparison of some nonlinear programs\u201d,Mathematical Programming 4 (1973) 144\u2013154.","journal-title":"Mathematical Programming"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01681332","volume":"9","author":"D.P. Bertsekas","year":"1975","unstructured":"D.P. Bertsekas, \u201cNecessary and sufficient conditions for a penalty method to be exact\u201d,Mathematical Programming 9 (1975) 87\u201399.","journal-title":"Mathematical Programming"},{"key":"CR3","volume-title":"A comparative study on nonlinear programming codes","author":"A.R. Colville","year":"1968","unstructured":"A.R. Colville, \u201cA comparative study on nonlinear programming codes\u201d, IBM New York Scientific Center, Report 320-2949 (Yorktown Heights, NY, 1968)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0710063","volume":"10","author":"A.R. Conn","year":"1973","unstructured":"A.R. Conn, \u201cConstrained optimization using a nondifferentiable penalty function\u201d,SIAM Journal on Numerical Analysis 10 (1973) 760\u2013784.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0714022","volume":"14","author":"A.R. Conn","year":"1977","unstructured":"A.R. Conn and T. Pietrzykowski, \u201cA penalty function method converging directly to a constrained optimum\u201d,SIAM Journal on Numerical Analysis 14 (1977) 348\u2013378.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR6","volume-title":"Integer and nonlinear programming","author":"R. Fletcher","year":"1970","unstructured":"R. Fletcher, \u201cA class of methods for nonlinear programming with termination and convergence properties\u201d, in: J. Abadie, ed.,Integer and nonlinear programming (North-Holland, Amsterdam, 1970)."},{"key":"CR7","volume-title":"Nonlinear programming","author":"R. Fletcher","year":"1951","unstructured":"R. Fletcher and S.A. Lill, \u201cA class of methods for nonlinear programming, II Computational experience\u201d, in: J.B. Rosen, O.L. Mangasarian and K. Ritter, eds.,Nonlinear programming (Academic Press, New York, 1951)."},{"key":"CR8","volume-title":"Nonlinear programming, sequential unconstrained minimization techniques","author":"A.V. Fiacco","year":"1968","unstructured":"A.V. Fiacco and G.P. McCormick,Nonlinear programming, sequential unconstrained minimization techniques (Wiley, New York, 1968)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00932858","volume":"22","author":"S.P. Han","year":"1977","unstructured":"S.P. Han, \u201cA globally convergent method for nonlinear programming\u201d,Journal of Optimization Theory and Applications 22 (1977) 297\u2013309.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1137\/0311029","volume":"11","author":"S. Howe","year":"1973","unstructured":"S. Howe, \u201cNew conditions for exactness of a simple penalty function\u201d,SIAM Journal on Control 11 (1973) 378\u2013381.","journal-title":"SIAM Journal on Control"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"D.G. Luenberger, \u201cControl problems with kinks\u201d,IEEE Transactions on Automatic Control AC-15 (1970).","DOI":"10.1109\/TAC.1970.1099557"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF01580371","volume":"11","author":"D.Q. Mayne","year":"1976","unstructured":"D.Q. Mayne and E. Polak, \u201cFeasible directions algorithms for optimization problems with equality and inequality constraints\u201d,Mathematical Programming 11 (1976) 67\u201380.","journal-title":"Mathematical Programming"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/0706028","volume":"6","author":"T. Pietrzykowski","year":"1969","unstructured":"T. Pietrzykowski, \u201cAn exact potential method for constrained maxima\u201d,SIAM Journal on Numerical Analysis 6 (1969) 229\u2013303.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0005-1098(76)90053-4","volume":"12","author":"E. Polak","year":"1976","unstructured":"E. Polak, \u201cOn the global stabilization of locally convergent algorithms\u201d,Automatica 12 (1976) 337\u2013342.","journal-title":"Automatica"},{"key":"CR15","first-page":"283","volume-title":"Optimization","author":"M.J.D. Powell","year":"1969","unstructured":"M.J.D. Powell, \u201cA method for nonlinear constraints in minimization problems\u201d, in: R. Fletcher, ed.,Optimization (Academic Press, New York, 1969) pp. 283\u2013298."},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"M.J.D. Powell, \u201cA fast algorithm for nonlinearly constrained optimization calculations\u201d, 1977Dundee Conference on Numerical Analysis.","DOI":"10.1007\/BFb0067703"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1093\/comjnl\/3.3.175","volume":"3","author":"H.H. Rosenbrock","year":"1960","unstructured":"H.H. Rosenbrock, \u201cAn automatic method for finding the greatest or least value of a function\u201d,Computer Journal 3 (1960) 175.","journal-title":"Computer Journal"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/mnsc.13.5.344","volume":"13","author":"W.I. Zangwill","year":"1967","unstructured":"W.I. Zangwill, \u201cNonlinear programming via penalty functions\u201d,Management Science 13 (1967) 344\u2013358.","journal-title":"Management Science"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582118.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582118\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582118","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:46:05Z","timestamp":1586231165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,12]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,12]]}},"alternative-id":["BF01582118"],"URL":"https:\/\/doi.org\/10.1007\/bf01582118","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,12]]}}}