References
- Barnes , E. R. 1986 . A variation on Karmarkar's algorithm for solving linear programming problems . Math. Program , 36 : 174 – 182 . (doi:10.1007/BF02592024)
- Bellavia , S. , Macconi , M. and Morini , B. 2003 . An affine scaling trust-region approach to bound-constrained nonlinear systems . Appl. Numer. Math , 44 : 257 – 280 . (doi:10.1016/S0168-9274(02)00170-8)
- Birgin , E. G. and Martinez , J. M. 2002 . Large-scale active-set box-constrained optimization method with spectral projected gradients . Comput. Optim. Appl , 23 : 101 – 125 . (doi:10.1023/A:1019928808826)
- Bonnans , J. and Bouhtou , M. 1995 . The trust region affine interior point algorithm for convex and nonconvex quadratic programming . RAIRO Rech. Opér , 29 : 195 – 217 .
- Byrd , R. H. , Lu , P. , Nocedal , J. and Zhu , C. 1995 . A limited memory algorithm for bound constrained optimization . SIAM J. Sci. Comput , 16 : 1190 – 1208 . (doi:10.1137/0916069)
- Coleman , T. F. and Li , Y. 1994 . On the convergence of interior-reflection Newton methods for nonlinear minimization subject to bounds . Math. Program , 67 : 189 – 224 . (doi:10.1007/BF01582221)
- Coleman , T. F. and Li , Y. 1996 . An interior trust region approach for nonlinear minimization subject to bounds . SIAM J. Optim , 6 : 418 – 445 . (doi:10.1137/0806023)
- Conn , A. R. , Gould , N. I.M. and Toint , Ph. L. 1988 . Global convergence of a class of trust region algorithms for optimization with simple bounds . SIAM J. Numer. Anal , 25 : 433 – 460 . 26 (1989), pp. 764–767, (doi:10.1137/0725029)
- Conn , A. R. , Gould , N. I.M. and Toint , Ph. L. 1992 . “ LANCELOT: A Fortran Package for Large-Scale Nonlinear Optimization (Release A) ” . Heidelberg, New York : Springer .
- Conn , A. R. , Gould , N. I.M. and Toint , Ph. L. 2000 . “ Trust-Region Methods ” . Philadelphia , PA : SIAM . Number 01 in MPS-SIAM Series on Optimization
- Dai , Y. H. and Fletcher , R. 2005 . Projected Barzilai–Borwein methods for large-scale box-constrained quadratic programming . Numer. Math , 100 : 21 – 47 . (doi:10.1007/s00211-004-0569-y)
- Dennis , J. E. and Vicente , L. N. 1996 . “ Trust-region interior-point algorithms for minimization problems with simple bounds, in Applied Mathematics and Paralle Computing ” . Edited by: Ritter , K. , Fisher , H. , Riedmüller , H. and Schäffler , S. 97 – 107 . Berlin : Physica-Verlag, Springer .
- Dikin , I. I. 1967 . Iterative solution of problems of linear and quadratic programming . Dokl. Akad. Nauk SSSR , 174 : 747 – 748 . (Transl. Soviet Math. Dokl. 8 (1967), pp. 674–675.)
- Dikin , I. I. and Zorkaltsev , V. I. 1980 . Iterative Solutions of Mathematical Programming Problems , Novosibirsk : Nauka .
- Dolan , E. D. and Moré , J. J. 2002 . Benchmarking optimization software with performance profiles . Math. Program , 91 : 201 – 213 . (doi:10.1007/s101070100263)
- Facchinei , F. , Júdice , J. and Soares , J. 1998 . An active set Newton's algorithm for large-scale nonlinear programs with box constraints . SIAM J. Optim , 8 : 158 – 186 . (doi:10.1137/S1052623493253991)
- Facchinei , F. , Lucidi , S. and Palagi , L. 2002 . A truncated Newton algorithm for large scale box constrained optimization . SIAM J. Optim , 12 : 1100 – 1125 . (doi:10.1137/S1052623499359890)
- Friedlander , A. , Martinez , J. M. and Santos , S. 1994 . A new trust region algorithm for bound constrained minimization . Appl. Math. Optim , 30 : 235 – 266 . (doi:10.1007/BF01183013)
- Gould , N. I.M. , Orban , D. and Toint , Ph. L. 2003 . CUTEr, a constrained and unconstrained testing environment (revisited) . ACM Trans. Math. Softw , 29 : 373 – 394 . (doi:10.1145/962437.962439)
- Gratton , S. , Mouffe , M. , Toint , Ph. L. and Weber-Mendonça , M. 2008 . A recursive l ∞-trust-region method for bound-constrained nonlinear optimization . IMA. J. Numer. Anal , 28 : 827 – 861 . (doi:10.1093/imanum/drn034)
- Hager , W. W. and Zhang , H. C. 2006 . A new active set algorithm for box constrained optimization . SIAM J. Optim , 17 : 526 – 557 . (doi:10.1137/050635225)
- Heinkenschloss , M. , Ulbrich , M. and Ulbrich , S. 1999 . Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption . Math. Program , 86 : 615 – 635 . (doi:10.1007/s101070050107)
- Kanzow , C. and Klug , A. 2006 . On affine scaling interior-point Newton methods for nonlinear minimization with bound constraints . Comput. Optim. Appl , 35 : 177 – 197 . (doi:10.1007/s10589-006-6514-5)
- Lescrenier , M. 1991 . Convergence of trust region algorithms for optimization with bounds when strict complementarity does not hold . SIAM J. Numer. Anal , 28 : 476 – 495 . (doi:10.1137/0728026)
- Lin , C. and Moré , J. J. 1999 . Newton's method for large bound-constrained optimization problem . SIAM J. Optim , 9 : 1100 – 1127 . (doi:10.1137/S1052623498345075)
- Monteiro , R. D.C. and Tsuchiya , T. 1998 . Global convergence of the affine scaling algorithm for convex quadratic programmming . SIAM J. Optim , 8 : 26 – 58 . (doi:10.1137/S1052623495283851)
- Monteiro , R. D.C. and Wang , Y. 1998 . Trust region affine scaling algorithms for linearly constrained convex and concave programs . Math. Program , 80 : 283 – 313 .
- Moré , J. J. and Toraldo , G. 1991 . On the solution of large quadratic programming problems with bound constraints . SIAM J. Optim , 1 : 93 – 113 . (doi:10.1137/0801008)
- Ni , Q. and Yuan , Y. 1997 . A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization . Math. Comput , 66 : 1509 – 1520 . (doi:10.1090/S0025-5718-97-00866-1)
- Powell , M. J.D. 2009 . “ The BOBYQA algorithm for bound constrained optimization without derivatives ” . Cambridge Technical Report, Department of Applied Mathematics and Theoretical Physics, NA2009/06
- Schwartz , A. and Polak , E. 1997 . Family of projected descent methods for optimization problems with simple bounds . J. Optim. Theory Appl , 92 : 1 – 31 . (doi:10.1023/A:1022690711754)
- Sun , J. 1996 . A convergence analysis for a convex version of Dikin's algorithm . Ann. Oper. Res , 62 : 357 – 374 . (doi:10.1007/BF02206823)
- Tseng , P. 2004 . Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization . J. Glob. Optim , 30 : 285 – 300 . (doi:10.1007/s10898-004-8276-x)
- Ulbrich , M. , Ulbrich , S. and Heinkenschloss , M. 1999 . Global convergence of trust-region interior-point algorithms for infinite-dimensional nonconvex minimization subject to point-wise bounds . SIAM J. Control Optim , 37 : 731 – 764 . (doi:10.1137/S0363012997319541)
- Vanderbei , R. J. , Meketon , M. S. and Freedman , B. A. 1986 . A modification of Karmarkar's linear programming algorithm . Algorithmica , 1 : 395 – 407 . (doi:10.1007/BF01840454)
- Yuan , Y. 2007 . “ Computational Methods for Nonlinear Optimization (in Chinese) ” . Beijing , , China : Science Press .
- Zhu , C. , Byrd , R. H. , Lu , P. and Nocedal , J. 1997 . L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization . ACM Trans. Math. Softw , 23 : 550 – 560 . (doi:10.1145/279232.279236)