{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T09:44:38Z","timestamp":1751535878792},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","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":["Computing"],"published-print":{"date-parts":[[1982,12]]},"DOI":"10.1007\/bf02246757","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T20:10:48Z","timestamp":1131999048000},"page":"289-307","source":"Crossref","is-referenced-by-count":6,"title":["On the global and superlinear convergence of a discretized version of Wilson's method"],"prefix":"10.1007","volume":"29","author":[{"given":"H.","family":"Kleinmichel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Richter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Sch\u00f6nefeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02246757_CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02241780","volume":"26","author":"M. J. Best","year":"1981","unstructured":"Best, M. J., Br\u00e4uninger, J., Ritter, K., Robinson, S. M.: A globally and quadratically convergent algorithm for general nonlinear programming problems. Computing26, 141\u2013153 (1981).","journal-title":"Computing"},{"key":"BF02246757_CR2","unstructured":"Br\u00e4uninger, J.: Methoden zur L\u00f6sung von Optimierungsproblemen ohne Verwendung von Abteitungen. Dissertation, Stuttgart, 1977."},{"key":"BF02246757_CR3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01397091","volume":"38","author":"H. Kleinmichel","year":"1981","unstructured":"Kleinmichel, H.: Quasi-Newton-Verfahren vom Rang-1-Typ zur L\u00f6sung unrestringierter Minimierungsprobleme. Numer. Math.38, 219\u2013228, 229\u2013244 (1981).","journal-title":"Numer. Math."},{"key":"BF02246757_CR4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF01584087","volume":"1","author":"G. P. McCormick","year":"1971","unstructured":"McCormick, G. P.: Penalty function versus nonpenalty function methods for constrained nonlinear programming problems. Math. Programming1, 217\u2013238 (1971).","journal-title":"Math. Programming"},{"key":"BF02246757_CR5","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/zamm.19800600302","volume":"60","author":"C. Richter","year":"1981","unstructured":"Richter, C.: \u00dcber Mehrschrittverfahren der nichtlinearen Optimierung. ZAMM60, 129\u2013136 (1981).","journal-title":"ZAMM"},{"key":"BF02246757_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01585500","volume":"7","author":"S. M. Robinson","year":"1974","unstructured":"Robinson, S. M.: Perturbed Kuhn-Tucker-points and rates of convergence for a class of nonlinear programming algorithms. Math. Programming7, 1\u201316 (1974).","journal-title":"Math. Programming"},{"key":"BF02246757_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/zamm.19630430102","volume":"43","author":"J. W. Schmidt","year":"1963","unstructured":"Schmidt, J. W.: Eine \u00dcbertragung der regula falsi auf Gleichungen in Banachr\u00e4umen, Teil I und II. ZAMM43, 1\u20138, 97\u2013110 (1963).","journal-title":"ZAMM"},{"key":"BF02246757_CR8","volume-title":"Numerische L\u00f6sung nichtlinearer Gleichungen","author":"H. Schwetlick","year":"1979","unstructured":"Schwetlick, H.: Numerische L\u00f6sung nichtlinearer Gleichungen. Berlin: Dt. Verl. d. Wiss. 1979."},{"key":"BF02246757_CR9","volume-title":"A simplicial algorithm for concave programming","author":"R. B. Wilson","year":"1963","unstructured":"Wilson, R. B.: A simplicial algorithm for concave programming. Dissertation. Graduate School, Havard Univ., Mass., 1963."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02246757.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02246757\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02246757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T10:30:25Z","timestamp":1558002625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02246757"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["BF02246757"],"URL":"https:\/\/doi.org\/10.1007\/bf02246757","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}