A Limited Memory Algorithm for Bound Constrained Optimization
Abstract:An algorithm for solving large nonlinear optimization problems with simple bounds is described. It is based on the gradient projection method and uses a limited memory BFGS matrix to approximate the Hessian of the objective function. It is shown how to take advantage of the form of the limited memory approximation to implement the algorithm efficiently. The results of numerical tests on a set of large problems are reported.
暂无分享,去 创建一个
[1] John E. Dennis,et al. Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.
[2] D. Bertsekas. Projected Newton methods for optimization problems with simple constraints , 1981, CDC 1981.
[3] Jorge Nocedal,et al. Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization , 1997, TOMS.
[4] Nicholas I. M. Gould,et al. Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A) , 1992 .
[5] Shirley Dex,et al. JR 旅客販売総合システム(マルス)における運用及び管理について , 1991 .
[6] J. J. Moré,et al. Algorithms for bound constrained quadratic programming problems , 1989 .
[7] B. M. Averick,et al. User guide for the MINIPACK-2 test problem collection , 1991 .
[8] P. Toint,et al. Testing a class of methods for solving minimization problems with simple bounds on the variables , 1988 .
[9] Nicholas I. M. Gould,et al. CUTE: constrained and unconstrained testing environment , 1995, TOMS.
[10] E. Polak,et al. Constrained Minimization Problems in Finite-Dimensional Spaces , 1966 .
[11] James M. Ortega,et al. Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.
[12] Jorge Nocedal,et al. Representations of quasi-Newton matrices and their use in limited memory methods , 1994, Math. Program..
[13] Guoliang Xue,et al. The MINPACK-2 test problem collection , 1992 .
[14] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[15] J. Nocedal. Updating Quasi-Newton Matrices With Limited Storage , 1980 .
[16] A. Goldstein. Convex programming in Hilbert space , 1964 .
[17] Claude Lemaréchal,et al. Some numerical experiments with variable-storage quasi-Newton algorithms , 1989, Math. Program..
[18] Jorge Nocedal,et al. On the limited memory BFGS method for large scale optimization , 1989, Math. Program..
[19] Philip E. Gill,et al. Practical optimization , 1981 .
[20] P. Toint,et al. Global convergence of a class of trust region algorithms for optimization with simple bounds , 1988 .
[21] Alfred V. Aho,et al. The design and analysis of algorithms , 1974 .
[22] Paul H. Calamai,et al. Projected gradient methods for linearly constrained problems , 1987, Math. Program..