{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:53:57Z","timestamp":1720698837778},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"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":[[1982,12]]},"DOI":"10.1007\/bf01585101","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:31:50Z","timestamp":1114662710000},"page":"137-161","source":"Crossref","is-referenced-by-count":58,"title":["Nonlinear programming via an exact penalty function: Global analysis"],"prefix":"10.1007","volume":"24","author":[{"given":"T. F.","family":"Coleman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. R.","family":"Conn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"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":"224","DOI":"10.1137\/0715015","volume":"15","author":"R.H. Bartels","year":"1978","unstructured":"R.H. Bartels, A.R. Conn and J.W. Sinclair, \u201cMinimization techniques for piecewise differentiable functions: Thel 1 solution to an overdetermined linear system\u201d,SIAM Journal on Numerical Analysis 15 (1978) 224\u2013241.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/BF01582123","volume":"16","author":"R.M. Chamberlain","year":"1979","unstructured":"R.M. Chamberlain, \u201cSome examples of cycling in variable metric methods for constrained optimization\u201d,Mathematical Programming 16 (1979) 378\u2013383.","journal-title":"Mathematical Programming"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BF01609033","volume":"15","author":"C. Charalambous","year":"1978","unstructured":"C. Charalambous, \u201cA lower bound for the controlling parameter of the exact penalty function\u201d,Mathematical Programming 15 (1978) 278\u2013290.","journal-title":"Mathematical Programming"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01588238","volume":"17","author":"C. Charalambous","year":"1979","unstructured":"C. Charalambous, \u201cOn the conditions for optimality for the nonlinearl 1 problem\u201d,Mathematical Programming 17 (1979) 123\u2013135.","journal-title":"Mathematical Programming"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/BF01581639","volume":"19","author":"T.F. Coleman","year":"1980","unstructured":"T.F. Coleman and A.R. Conn, \u201cSecond-order conditions for an exact penalty function\u201d,Mathematical Programming 19 (1980) 178\u2013185.","journal-title":"Mathematical Programming"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01585100","volume":"24","author":"T.F. Coleman","year":"1982","unstructured":"T.F. Coleman and A.R. Conn, \u201cNonlinear programming via an exact penalty function: Asymptotic analysis\u201d,Mathematical Programming 24 (1982) 123\u2013136. [This issue.].","journal-title":"Mathematical Programming"},{"key":"CR8","unstructured":"A.R. Colville, \u201cA comparative study of non-linear programming codes\u201d, IBM New York Scientific Center Report 320-2949 (1968)."},{"key":"CR9","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\u2013375.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR10","volume-title":"Numerical methods for constrained optimization","author":"P. Gill","year":"1974","unstructured":"P. Gill and W. Murray,Numerical methods for constrained optimization (Academic Press, London, 1974)."},{"key":"CR11","volume-title":"\u201cProjected Lagrangian methods based on the trajectories of penalty and barrier functions\u201d, Technical Report SOL 78-23","author":"W. Murray","year":"1978","unstructured":"W. Murray and M. Wright, \u201cProjected Lagrangian methods based on the trajectories of penalty and barrier functions\u201d, Technical Report SOL 78-23 Department of Operations Research, Stanford University (Stanford, CA, 1978)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF02254861","volume":"23","author":"W. Murray","year":"1979","unstructured":"W. Murray and M. Overton, \u201cSteplength algorithms for minimizing a class of non-differentiable functions\u201d,Computing 23 (1979) 309\u2013331.","journal-title":"Computing"},{"key":"CR13","volume-title":"Optimization","author":"M.J.D. Powell","year":"1969","unstructured":"M.J.D. Powell, \u201cA method for non-linear constraints in minimization problems\u201d in: R. Fletcher, ed.,Optimization (Academic Press, London, 1969)."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/363744.363779","volume":"8","author":"J.B. Rosen","year":"1965","unstructured":"J.B. Rosen and S. Suzuki, \u201cConstruction of non-linear programming test problems\u201d,Communications of the ACM 8 (1965) 113.","journal-title":"Communications of the ACM"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/mnsc.13.5.344","volume":"13","author":"W. Zangwill","year":"1967","unstructured":"W. Zangwill, \u201cNonlinear programming via penalty functions\u201d,Management Science 13 (1967) 344\u2013350.","journal-title":"Management Science"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585101.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585101\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:32:26Z","timestamp":1556883146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["BF01585101"],"URL":"https:\/\/doi.org\/10.1007\/bf01585101","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}