{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:57:46Z","timestamp":1760245066977},"publisher-location":"Boston","reference-count":57,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"0387327746"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-33006-2_7","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T00:50:14Z","timestamp":1149641414000},"page":"67-82","source":"Crossref","is-referenced-by-count":4,"title":["Recent Advances in Bound Constrained Optimization"],"prefix":"10.1007","author":[{"given":"W. W.","family":"Hager","sequence":"first","affiliation":[]},{"given":"H.","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L. Armijo","year":"1966","unstructured":"L. Armijo. Minimization of functions having Lipschitz continuous first partial derivatives. Pacific J. Math., 16:1\u20133, 1966.","journal-title":"Pacific J. Math."},{"key":"7_CR2","doi-asserted-by":"crossref","DOI":"10.2172\/79972","volume-title":"The MINPACK-2 test problem collection","author":"B. M. Averick","year":"1992","unstructured":"B. M. Averick, R. G. Carter, J. J. Mor\u00e9, and G. L. Xue. The MINPACK-2 test problem collection. Technical report, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1992."},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J. Barzilai","year":"1988","unstructured":"J. Barzilai and J. M. Borwein. Two point step size gradient methods. IMA J. Numer. Anal., 8:141\u2013148, 1988.","journal-title":"IMA J. Numer. Anal."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/TAC.1976.1101194","volume":"21","author":"D. P. Bertsekas","year":"1976","unstructured":"D. P. Bertsekas. On the Goldstein-Levitin-Polyak gradient projection method. IEEE Trans. Automatic Control, 21:174\u2013184, 1976.","journal-title":"IEEE Trans. Automatic Control"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0320018","volume":"20","author":"D. P. Bertsekas","year":"1982","unstructured":"D. P. Bertsekas. Projected Newton methods for optimization problems with simple constraints. SIAM J. Control Optim., 20:221\u2013246, 1982.","journal-title":"SIAM J. Control Optim."},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1019928808826","volume":"23","author":"E. G. Birgin","year":"2002","unstructured":"E. G. Birgin and J. M. Mart\u00ednez. Large-scale active-set box-constrained optimization method with spectral projected gradients. Comput. Optim. Appl., 23:101\u2013125, 2002.","journal-title":"Comput. Optim. Appl."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"E. G. Birgin","year":"2000","unstructured":"E. G. Birgin, J. M. Mart\u00ednez, and M. Raydan. Nonmonotone spectral projected gradient methods for convex sets. SIAM J. Optim., 10:1196\u20131211, 2000.","journal-title":"SIAM J. Optim."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1145\/502800.502803","volume":"27","author":"E. G. Birgin","year":"2001","unstructured":"E. G. Birgin, J. M. Mart\u00ednez, and M. Raydan. Algorithm 813: SPG-software for convex-constrained optimization. ACM Trans. Math. Software, 27:340\u2013349, 2001.","journal-title":"ACM Trans. Math. Software"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"I. Bongartz","year":"1995","unstructured":"I. Bongartz, A. R. Conn, N. I. M. Gould, and P. L. Toint. CUTE: constrained and unconstrained testing environments. ACM Trans. Math. Software, 21:123\u2013160, 1995.","journal-title":"ACM Trans. Math. Software"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S1064827595289108","volume":"21","author":"M.A. Branch","year":"1999","unstructured":"M.A. Branch, T.F. Coleman, and Y. Li. A subspace, interior, and conjugate gradient method for large-scale bound-constrained minimization problems. SIAM J. Sci. Comput., 21:1\u201323, 1999.","journal-title":"SIAM J. Sci. Comput."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1137\/0725068","volume":"25","author":"J. V. Burke","year":"1988","unstructured":"J. V. Burke and J. J. Mor\u00e9. On the identification of active constraints. SIAM J. Numer. Anal, 25:1197\u20131211, 1988.","journal-title":"SIAM J. Numer. Anal"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1137\/0804032","volume":"25","author":"J. V. Burke","year":"1994","unstructured":"J. V. Burke and J. J. Mor\u00e9. Exposing constraints. SIAM J. Optim., 25:573\u2013595, 1994.","journal-title":"SIAM J. Optim."},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01580867","volume":"47","author":"J. V. Burke","year":"1990","unstructured":"J. V. Burke, J. J. Mor\u00e9, and G. Toraldo. Convergence properties of trust region methods for linear and convex constraints. Math. Prog., 47:305\u2013336, 1990.","journal-title":"Math. Prog."},{"key":"7_CR14","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF02592073","volume":"39","author":"P. Calamai","year":"1987","unstructured":"P. Calamai and J. Mor\u00e9. Projected gradient for linearly constrained problems. Math. Prog., 39:93\u2013116, 1987.","journal-title":"Math. Prog."},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01582221","volume":"67","author":"T. F. Coleman","year":"1994","unstructured":"T. F. Coleman and Y. Li. On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds. Math. Prog., 67:189\u2013224, 1994.","journal-title":"Math. Prog."},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/0806023","volume":"6","author":"T. F. Coleman","year":"1996","unstructured":"T. F. Coleman and Y. Li. An interior trust region approach for nonlinear minimization subject to bounds. SIAM J. Optim., 6:418\u2013445, 1996.","journal-title":"SIAM J. Optim."},{"key":"7_CR17","volume-title":"A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints","author":"T. F. Coleman","year":"1997","unstructured":"T. F. Coleman and Y. Li. A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints. Technical report, Cornell University, Ithaca, NY, 1997."},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/0725029","volume":"25","author":"A. R. Conn","year":"1988","unstructured":"A. R. Conn, N. I. M. Gould, and Ph. L. Toint. Global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM J. Numer. Anal., 25:433\u2013460, 1988.","journal-title":"SIAM J. Numer. Anal."},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0728030","volume":"28","author":"A. R. Conn","year":"1991","unstructured":"A. R. Conn, N. I. M. Gould, and Ph. L. Toint. A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds. SIAM J. Numer. Anal., 28:545\u2013572, 1991.","journal-title":"SIAM J. Numer. Anal."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Y. H. Dai, W. W. Hager, K. Schittkowski, and H. Zhang. The cyclic Barzilai-Borwein method for unconstrained optimization. IMA J. Numer. Anal, submitted, 2005.","DOI":"10.1093\/imanum\/drl006"},{"key":"7_CR21","volume-title":"On the minimization of quadratic functions subject to box constraints","author":"R. S. Dembo","year":"1983","unstructured":"R. S. Dembo and U. Tulowitzki. On the minimization of quadratic functions subject to box constraints. Technical report, School of Organization and Management, Yale University, New Haven, CT, 1983."},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"1750","DOI":"10.1137\/S036012995279031","volume":"36","author":"J. E. Dennis","year":"1998","unstructured":"J. E. Dennis, M. Heinkenschloss, and L. N. Vicente. Trust-region interior-point algorithms for a class of nonlinear programming problems. SIAM J. Control Optim., 36:1750\u20131794, 1998.","journal-title":"SIAM J. Control Optim."},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E. D. Dolan","year":"2002","unstructured":"E. D. Dolan and J. J. Mor\u00e9. Benchmarking optimization software with performance profiles. Math. Program., 91:201\u2013213, 2002.","journal-title":"Math. Program."},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1137\/S1052623494266250","volume":"7","author":"Z. Dost\u00e1l","year":"1997","unstructured":"Z. Dost\u00e1l. Box constrained quadratic programming with proportioning and projections. SIAM J. Optim., 7:871\u2013887, 1997.","journal-title":"SIAM J. Optim."},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/B:NUMA.0000005347.98806.b2","volume":"34","author":"Z. Dost\u00e1l","year":"2003","unstructured":"Z. Dost\u00e1l. A proportioning based algorithm for bound constrained quadratic programming with the rate of convergence. Numer. Algorithms, 34:293\u2013302, 2003.","journal-title":"Numer. Algorithms"},{"key":"7_CR26","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1090\/conm\/218\/03003","volume":"218","author":"Z. Dost\u00e1l","year":"1998","unstructured":"Z. Dost\u00e1l, A. Friedlander, and S. A. Santos. Solution of coercive and semicoercive contact problems by FETI domain decomposition. Contemp. Math., 218:82\u201393, 1998.","journal-title":"Contemp. Math."},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1137\/S1052623499362573","volume":"13","author":"Z. Dost\u00e1l","year":"2003","unstructured":"Z. Dost\u00e1l, A. Friedlander, and S. A. Santos. Augmented Lagrangians with adaptive precision control for quadratic programming with simple bounds and equality constraints. SIAM J. Optim., 13:1120\u20131140, 2003.","journal-title":"SIAM J. Optim."},{"key":"7_CR28","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/BF02275347","volume":"89","author":"A. S. El-Bakry","year":"1996","unstructured":"A. S. El-Bakry, R. A. Tapia, T. Tsuchiya, and Y. Zhang. On the formulation and theory of the primal-dual Newton interior-point method for nonlinear programming. J. Optim. Theory Appl., 89:507\u2013541, 1996.","journal-title":"J. Optim. Theory Appl."},{"key":"7_CR29","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/S1052623493253991","volume":"8","author":"F. Facchinei","year":"1998","unstructured":"F. Facchinei, J. J\u00fadice, and J. Soares. An active set Newton\u2019s algorithm for large-scale nonlinear programs with box constraints. SIAM J. Optim., 8:158\u2013186, 1998.","journal-title":"SIAM J. Optim."},{"key":"7_CR30","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1080\/02331939208843855","volume":"26","author":"F. Facchinei","year":"1992","unstructured":"F. Facchinei and S. Lucidi. A class of penalty functions for optimization problems with bound constraints. Optimization, 26:239\u2013259, 1992.","journal-title":"Optimization"},{"key":"7_CR31","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1137\/S1052623499359890","volume":"4","author":"F. Facchinei","year":"2002","unstructured":"F. Facchinei, S. Lucidi, and L. Palagi. A truncated Newton algorithm for large-scale box constrained optimization. SIAM J. Optim., 4:1100\u20131125, 2002.","journal-title":"SIAM J. Optim."},{"key":"7_CR32","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF01183013","volume":"30","author":"A. Friedlander","year":"1994","unstructured":"A. Friedlander, J. M. Mart\u00ednez, and S. A. Santos. A new trust region algorithm for bound constrained minimization. Appl. Math. Optim., 30:235\u2013266, 1994.","journal-title":"Appl. Math. Optim."},{"key":"7_CR33","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1090\/S0002-9904-1964-11178-2","volume":"70","author":"A. A. Goldstein","year":"1964","unstructured":"A. A. Goldstein. Convex programming in Hilbert space. Bull. Amer. Math. Soc, 70:709\u2013710, 1964.","journal-title":"Bull. Amer. Math. Soc"},{"key":"7_CR34","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L. Grippo","year":"1986","unstructured":"L. Grippo, F. Lampariello, and S. Lucidi. A nonmonotone line search technique for Newton\u2019s method. SIAM J. Numer. Anal, 23:707\u2013716, 1986.","journal-title":"SIAM J. Numer. Anal"},{"key":"7_CR35","unstructured":"W. W. Hager and H. Zhang. CG_DESCENT user\u2019s guide. Technical report, Dept. Math., Univ. Florida, 2004."},{"key":"7_CR36","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"W. W. Hager","year":"2005","unstructured":"W. W. Hager and H. Zhang. A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim., 16:170\u2013192, 2005.","journal-title":"SIAM J. Optim."},{"key":"7_CR37","doi-asserted-by":"crossref","unstructured":"W. W. Hager and H. Zhang. A new active set algorithm for box constrained optimization. SIAM J. Optim., submitted, 2005.","DOI":"10.1137\/050635225"},{"key":"7_CR38","unstructured":"W. W. Hager and H. Zhang. CG_DESCENT, a conjugate gradient method with guaranteed descent. ACM Trans. Math. Software, to appear 2006."},{"key":"7_CR39","unstructured":"W. W. Hager and H. Zhang. A survey of nonlinear conjugate gradient methods. Pacific J. Optim., to appear 2006."},{"key":"7_CR40","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s101070050107","volume":"86","author":"M. Heinkenschloss","year":"1999","unstructured":"M. Heinkenschloss, M. Ulbrich, and S. Ulbrich. Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption. Math. Prog., 86:615\u2013635, 1999.","journal-title":"Math. Prog."},{"key":"7_CR41","doi-asserted-by":"crossref","unstructured":"C. Kanzow and A. Klug. On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints. Comput. Optim. Appl., 2006, to appear.","DOI":"10.1007\/s10589-006-6514-5"},{"key":"7_CR42","series-title":"Classics in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719451","volume-title":"An introduction to variational inequalities and their applications","author":"D. Kinderlehrer","year":"2000","unstructured":"D. Kinderlehrer and G. Stampacchia. An introduction to variational inequalities and their applications, volume 31 of Classics in Applied Mathematics. SIAM, Philadelphia, PA, 2000."},{"key":"7_CR43","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/0728026","volume":"28","author":"M. Lescrenier","year":"1991","unstructured":"M. Lescrenier. Convergence of trust region algorithms for optimization with bounds when strict complementarity does not hold. SIAM J. Numer. Anal., 28:476\u2013495, 1991.","journal-title":"SIAM J. Numer. Anal."},{"key":"7_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"E. S. Levitin","year":"1966","unstructured":"E. S. Levitin and B. T. Polyak. Constrained minimization problems. USSR Comput. Math. Math. Physics, 6:1\u201350, 1966.","journal-title":"USSR Comput. Math. Math. Physics"},{"key":"7_CR45","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1137\/S1064827597327334","volume":"21","author":"C. J. Lin","year":"1999","unstructured":"C. J. Lin and J. J. Mor\u00e9. Incomplete cholesky factorizations with limited memory. SIAM J. Sci. Comput., 21:24\u201345, 1999.","journal-title":"SIAM J. Sci. Comput."},{"key":"7_CR46","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1137\/S1052623498345075","volume":"9","author":"C. J. Lin","year":"1999","unstructured":"C. J. Lin and J. J. Mor\u00e9. Newton\u2019s method for large bound-constrained optimization problems. SIAM J. Optim., 9:1100\u20131127, 1999.","journal-title":"SIAM J. Optim."},{"key":"7_CR47","first-page":"31","volume":"19","author":"J. M. Mart\u00ednez","year":"2000","unstructured":"J. M. Mart\u00ednez. BOX-QUACAN and the implementation of augmented Lagrangian algorithms for minimization with inequality constraints. J. Comput. Appl. Math., 19:31\u201356, 2000.","journal-title":"J. Comput. Appl. Math."},{"key":"7_CR48","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1137\/0310009","volume":"10","author":"G. P. McCormick","year":"1972","unstructured":"G. P. McCormick and R. A. Tapia. The gradient projection method under mild differentiability conditions. SIAM J. Control, 10:93\u201398, 1972.","journal-title":"SIAM J. Control"},{"key":"7_CR49","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1137\/0801008","volume":"1","author":"J. J. Mor\u00e9","year":"1991","unstructured":"J. J. Mor\u00e9 and G. Toraldo. On the solution of large quadratic programming problems with bound constraints. SIAM J. Optim., 1:93\u2013113, 1991.","journal-title":"SIAM J. Optim."},{"key":"7_CR50","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"B. T. Polyak","year":"1969","unstructured":"B. T. Polyak. The conjugate gradient method in extremal problems. USSR Comp. Math. Math. Phys., 9:94\u2013112, 1969.","journal-title":"USSR Comp. Math. Math. Phys."},{"key":"7_CR51","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1287\/moor.5.1.43","volume":"5","author":"S. M. Robinson","year":"1980","unstructured":"S. M. Robinson. Strongly regular generalized equations. Math. Oper. Res., 5:43\u201362, 1980.","journal-title":"Math. Oper. Res."},{"key":"7_CR52","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1137\/S0363012997319541","volume":"37","author":"M. Ulbrich","year":"1999","unstructured":"M. Ulbrich, S. Ulbrich, and M. Heinkenschloss. Global convergence of affine-scaling interior-point Newton methods for infinite-dimensional nonlinear problems with pointwise bounds. SIAM J. Control Optim., 37:731\u2013764, 1999.","journal-title":"SIAM J. Control Optim."},{"key":"7_CR53","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/BF00939565","volume":"65","author":"S. J. Wright","year":"1990","unstructured":"S. J. Wright. Implementing proximal point methods for linear programming. J. Optim. Theory Appl., 65:531\u2013554, 1990.","journal-title":"J. Optim. Theory Appl."},{"key":"7_CR54","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/S0025-5610(96)00022-6","volume":"75","author":"H. Yamashita","year":"1996","unstructured":"H. Yamashita and H. Yabe. Superlinear and quadratic convergence of some primal-dual interior-point methods for constrained optimization. Math. Prog., 75:377\u2013397, 1996.","journal-title":"Math. Prog."},{"key":"7_CR55","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01586934","volume":"51","author":"E. K. Yang","year":"1991","unstructured":"E. K. Yang and J. W. Tolle. A class of methods for solving large convex quadratic programs subject to box constraints. Math. Prog., 51:223\u2013228, 1991.","journal-title":"Math. Prog."},{"key":"7_CR56","series-title":"Technical Report","volume-title":"Interior-point gradient methods with diagonal-scalings for simple-bound constrained optimization","author":"Y. Zhang","year":"2004","unstructured":"Y. Zhang. Interior-point gradient methods with diagonal-scalings for simple-bound constrained optimization. Technical Report TR04-06, Department of Computational and Applied Mathematics, Rice University, Houston, Texas, 2004."},{"key":"7_CR57","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1145\/279232.279236","volume":"23","author":"C. Zhu","year":"1997","unstructured":"C. Zhu, R. H. Byrd, and J. Nocedal. Algorithm 778: L-BFGS-B, Fortran subroutines for large-scale bound-constrained optimization. ACM Trans. Math. Software, 23:550\u2013560, 1997.","journal-title":"ACM Trans. Math. Software"}],"container-title":["IFIP International Federation for Information Processing","System Modeling and Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-33006-2_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:17:36Z","timestamp":1619500656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-33006-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387327746"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/0-387-33006-2_7","relation":{},"subject":[]}}