A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization

Authors:
Q. Ni and Y. Yuan

Journal:
Math. Comp. **66** (1997), 1509-1520

MSC (1991):
Primary 65K05, 90C06, 90C30

DOI:
https://doi.org/10.1090/S0025-5718-97-00866-1

MathSciNet review:
1422793

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: In this paper we propose a subspace limited memory quasi-Newton method for solving large-scale optimization with simple bounds on the variables. The limited memory quasi-Newton method is used to update the variables with indices outside of the active set, while the projected gradient method is used to update the active variables. The search direction consists of three parts: a subspace quasi-Newton direction, and two subspace gradient and modified gradient directions. Our algorithm can be applied to large-scale problems as there is no need to solve any subproblems. The global convergence of the method is proved and some numerical results are also given.

**1.**R.H. Byrd, P. Lu, J. Nocedal and C. Zhu,*A limited memory algorithm for bound constrained optimization,*Report NAM-8, EECS Department, Northwestern University, 1994.**2.**R.H. Byrd, J. Nocedal and B. Schnabel,*Representation of quasi-Newton matrices and their use in limited memory methods*, Math. Prog., Vol. 63, (1994), 129-156. MR**95a:90116****3.**I. Bongartz, A.R. Conn, N. Gould, and Ph.L. Toint,*CUTE: constrained and unconstrained testing environment,*Research Report, IBM T.J. Watson Research Center, Yorktown, USA.**4.**A.R. Conn, N.I.M. Gould and Ph.L. Toint,*Global convergence of a class of trust region algorithm for optimization with simple bounds,*SIAM J. Numer. Anal.**25**(1988), 433-460. MR**89h:90192****5.**A.R. Conn, N.I.M. Gould and Ph.L. Toint,*Testing a class of methods for solving minimization problems with simple bounds on the variables,*Math. Comp.**50**(1988), 399-430. MR**89e:65061****6.**A.R. Conn, N.I.M. Gould and Ph.L. Toint,*LANCELOT: a Fortran package for large-scale nonlinear optimization (Release A),*Number 17 in Springer Series in Computational Mathematics, Springer Verlag, Heidelberg, New York, 1992. CMP**93:12****7.**R. Fletcher,*Practical Methods of Optimization,*John Wiley and Sons, Chichester, 1987. MR**89j:65050****8.**P. Lu,*Bound constrained nonlinear optimization and limited memory methods,*Ph.D. Thesis, Dept. of Electrical Engineering and Computer Science, Northwestern University, Evanston, Illinois, 1992.**9.**J.J. Moré and G. Toraldo,*On the solution of large quadratic programming problems with bound constraints,*SIAM J. Optimization**1**(1991), 93-113. MR**91k:90137****10.**Q. Ni,*General large-scale nonlinear programming using sequential quadratic programming methods,*Bayreuther Mathematische Schriften,**45**(1993), 133-236. MR**94h:90052****11.**J. Nocedal,*Updating quasi-Newton matrices with limited storage,*Math.Comp.**35**(1980), 773-782. MR**81g:65077****12.**M.J.D. Powell,*A fast algorithm for nonlinearly constrained optimization calculations,*Lecture Notes in Mathematics 630. (1978), 144-157. MR**58:3448****13.**C. Zhu, R.H. Byrd, P. Lu, and J. Nocedal,*L-BFGS-B Fortran subroutines for large-scale bound constrained optimization,*Report NAM-11, EECS Department, Northwestern University, 1994.

Retrieve articles in *Mathematics of Computation of the American Mathematical Society*
with MSC (1991):
65K05,
90C06,
90C30

Retrieve articles in all journals with MSC (1991): 65K05, 90C06, 90C30

Additional Information

**Q. Ni**

Affiliation:
LSEC, Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences, P.O.Box 2719, Beijing 100080, China

Email:
niq@lsec.cc.ac.cn

**Y. Yuan**

Affiliation:
LSEC, Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences, P.O.Box 2719, Beijing 100080, China

Email:
yyx@lsec.cc.ac.cn

DOI:
https://doi.org/10.1090/S0025-5718-97-00866-1

Keywords:
Subspace quasi-Newton method,
limited memory,
projected search,
large-scale problem,
bound constrained optimization

Received by editor(s):
December 2, 1994

Received by editor(s) in revised form:
May 8, 1995, and January 26, 1996

Additional Notes:
The authors were partially supported by the Stat key project “Scientific and Engineering Computing” and Chinese NNSF grant 19525101.

Article copyright:
© Copyright 1997
American Mathematical Society