{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T09:44:40Z","timestamp":1751535880250},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1981,6,1]],"date-time":"1981-06-01T00:00:00Z","timestamp":360201600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1981,6]]},"DOI":"10.1007\/bf02241780","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T19:15:24Z","timestamp":1131995724000},"page":"141-153","source":"Crossref","is-referenced-by-count":19,"title":["A globally and quadratically convergent algorithm for general nonlinear programming problems"],"prefix":"10.1007","volume":"26","author":[{"given":"M. J.","family":"Best","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Br\u00e4uninger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Ritter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. M.","family":"Robinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02241780_CR1","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/BF01584657","volume":"4","author":"J. Asaadi","year":"1973","unstructured":"Asaadi, J.: A computational comparison of some non-linear programs. Mathematical Programming4, 144\u2013154 (1973).","journal-title":"Mathematical Programming"},{"key":"BF02241780_CR2","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1090\/S0025-5718-1976-0431675-3","volume":"30","author":"M. J. Best","year":"1976","unstructured":"Best, M. J., Ritter, K.: A class of accelerated conjugate direction methods for linearly constrained minimization problems. Mathematics of Computation30, 478\u2013504 (1976).","journal-title":"Mathematics of Computation"},{"key":"BF02241780_CR3","series-title":"Lecture Notes in Control and Information Sciences","volume-title":"Optimization Techniques","author":"J. Br\u00e4uninger","year":"1977","unstructured":"Br\u00e4uninger, J.: A modification of Robinson's algorithm for general nonlinear programming problems requiring only approximate solutions of subproblems with linear equality constraints. In: Optimization Techniques (Lecture Notes in Control and Information Sciences, Vols. 6, 7) (Stoer, J. ed.). Berlin-Heidelberg-New York: Springer 1977."},{"key":"BF02241780_CR4","unstructured":"Colville, A. R.: A comparative study on nonlinear programming codes. IBM, New York Scientific Center, Report No. 320-2949, 1968."},{"key":"BF02241780_CR5","volume-title":"Applied nonlinear programming","author":"D. M. Himmelblau","year":"1972","unstructured":"Himmelblau, D. M.: Applied nonlinear programming. New York: McGraw-Hill 1972."},{"key":"BF02241780_CR6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF01584087","volume":"1","author":"G. P. Cormick Mc","year":"1971","unstructured":"Mc Cormick, G. P.: Penalty function versus nonpenalty function methods for constrained nonlinear programming problems. Mathematical Programming1, 217\u2013238 (1971).","journal-title":"Mathematical Programming"},{"key":"BF02241780_CR7","series-title":"Technical Report SOL 76-15","doi-asserted-by":"crossref","DOI":"10.21236\/ADA030690","volume-title":"Nonlinear programming for large, sparse systems","author":"B. A. Murtagh","year":"1976","unstructured":"Murtagh, B. A., Saunders, M. A.: Nonlinear programming for large, sparse systems. Technical Report SOL 76-15, Systems Optimization Lab., Stanford, August, 1976."},{"key":"BF02241780_CR8","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/BF01584646","volume":"4","author":"K. Ritter","year":"1973","unstructured":"Ritter, K.: A superlinearly convergent method for minimization problems with linear inequality constraints. Mathematical Programming4, 44\u201371 (1973).","journal-title":"Mathematical Programming"},{"key":"BF02241780_CR9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01584986","volume":"3","author":"S. M. Robinson","year":"1972","unstructured":"Robinson, S. M.: A quadratically-convergent algorithm for general nonlinear programming problems. Mathematical Programming3, 145\u2013156 (1972).","journal-title":"Mathematical Programming"},{"key":"BF02241780_CR10","unstructured":"Rosen, J. B.: Two-phase algorithm for nonlinear constraint problems. Technical Report 77-8, Computer Science Department, University of Minnesota, 1977."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02241780.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02241780\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02241780","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T23:15:46Z","timestamp":1557875746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02241780"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["BF02241780"],"URL":"https:\/\/doi.org\/10.1007\/bf02241780","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}