{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:34:50Z","timestamp":1787333690085,"version":"build-2736575974"},"reference-count":29,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[1998,5]]},"abstract":"<jats:p>In this paper we present a new conjugate gradient algorithm for nonlinear programming problems with simple bounds on the variables. The method is an extension of our conjugate gradient algorithm described in [R. Pytlak, IMA J. Numer. Anal., 14 (1994), pp. 443--460]. The simple constraints on the variables are treated by a projection. Under mild assumptions the method is globally convergent. The algorithm has the property whereby many constraints can leave or enter an active set of constraints at one iteration. If the strict complementarity condition is satisfied, the active set at a solution is identified in a finite number of iterations. The algorithm has been tested on problems with more than 10,000 variables.<\/jats:p>","DOI":"10.1137\/s1052623494276518","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"532-560","source":"Crossref","is-referenced-by-count":19,"title":["An Efficient Algorithm for Large-Scale Nonlinear Programming Problems with Simple Bounds on the Variables"],"prefix":"10.1137","volume":"8","author":[{"given":"R.","family":"Pytlak","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1976.1101194"},{"key":"R2","unstructured":"D.Bertsekas, Uslovnaya optimizatsiya i metody mnozhitelei Lagranzha, \u201cRadio i Svyaz\u2019\u201d, 1987, 400\u20130, Translated from the English by N. V. Tret\u2019yakov; Translation edited and with a preface by E. G. Gol\u2019shtei\u02d8n88j:90181"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/0320018"},{"key":"R4","unstructured":"I. Bongartz, A. R. Conn, N. I. M. Gould, and Ph. L. Toint,\n                      CUTE: Constrained and Unconstrained Testing Environment\n                      , Research Report RC 18860, IBM T. J. Watson Research Center, Yorktown, USA, 1994."},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591943"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1137\/0725068"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/0804032"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1137\/0916069"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1975-0367131-6"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/0725029"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1988-0929544-3"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"A. R. Conn, N. I. M. Gould, and Ph. L. Toint,\n                      LANCELOT: a FORTRAN package for Large\u2013Scale Nonlinear Optimization (Release A)\n                      , Number 17 in Springer Series in Computational Mathematics, Springer\u2013Verlag, New York, 1992.","DOI":"10.1007\/978-3-662-12211-2"},{"key":"R13","first-page":"135","volume":"29","author":"Dunn J. C.","year":"1988","journal-title":"Control Dynamic Systems","ISSN":"https:\/\/id.crossref.org\/issn\/0090-5267","issn-type":"print"},{"key":"R14","volume-title":"Practical methods of optimization","author":"Fletcher R.","year":"1987"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.2.149"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589113"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1137\/0802003"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1964-11178-2"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"C. Lemar\u00e9chal,\n                      An extension of Davidon methods to nondifferentiable Problem\n                      , in Mathematical Programming Study 3, M. L. Balinski and P. Wolfe, eds., North\u2013Holland, Amsterdam, 1975, pp. 95\u2013109.","DOI":"10.1007\/BFb0120700"},{"key":"R20","first-page":"787","volume":"6","author":"Levitin E. S.","year":"1965","journal-title":"Z. Vycisl. Mat. i Mat. Fiz.","ISSN":"https:\/\/id.crossref.org\/issn\/0044-4669","issn-type":"print"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589116"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2.2.191"},{"key":"R23","first-page":"35","volume":"16","author":"Polak E.","year":"1969","journal-title":"Revue Francaise Informat. Recherche Operationalle"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"Rados\u0142awPytlak, Numerical experiment with new conjugate direction methods for nondifferentiable optimization, IEEE, New York, 1989, 2457\u2013246291c:49052","DOI":"10.1109\/CDC.1989.70619"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/14.3.443"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1287\/moor.3.3.244"},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.1137\/0715085"},{"key":"R28","doi-asserted-by":"crossref","unstructured":"P. Wolfe,\n                      A method of conjugate subgradients for minimizing nondifferentiable functions\n                      , in Mathematical Programming Study 3, M. L. Balinski and P. Wolfe, eds., North\u2013Holland, Amsterdam, 1975, pp. 145\u2013173.","DOI":"10.1007\/BFb0120703"},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1145\/279232.279236"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S1052623494276518","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:18:14Z","timestamp":1787332694000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S1052623494276518"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["10.1137\/S1052623494276518"],"URL":"https:\/\/doi.org\/10.1137\/s1052623494276518","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}