An active set feasible method for largescale minimization problems with bound constraints
 M. De Santis,
 G. Di Pillo,
 S. Lucidi
 … show all 3 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
We are concerned with the solution of the bound constrained minimization problem {minf(x), l≤x≤u}. For the solution of this problem we propose an active set method that combines ideas from projected and nonmonotone Newtontype methods. It is based on an iteration of the form x ^{ k+1}=[x ^{ k }+α ^{ k } d ^{ k }]^{♯}, where α ^{ k } is the steplength, d ^{ k } is the search direction and [⋅]^{♯} is the projection operator on the set [l,u]. At each iteration a new formula to estimate the active set is first employed. Then the components \(d_{N}^{k}\) of d ^{ k } corresponding to the free variables are determined by a truncated Newton method, and the components \(d_{A}^{k}\) of d ^{ k } corresponding to the active variables are computed by a BarzilaiBorwein gradient method. The steplength α ^{ k } is computed by an adaptation of the nonmonotone stabilization technique proposed in Grippo et al. (Numer. Math. 59:779–805, 1991). The method is a feasible one, since it maintains feasibility of the iterates x ^{ k }, and is well suited for largescale problems, since it uses matrixvector products only in the truncated Newton method for computing \(d_{N}^{k}\) . We prove the convergence of the method, with superlinear rate under usual additional assumptions. An extensive numerical experimentation performed on an algorithmic implementation shows that the algorithm compares favorably with other widely used codes for bound constrained problems.
 Andreani, R., Birgin, E.G., Martinez, J.M., Schuverdt, M.L. (2010) Secondorder negativecurvature methods for boxconstrained and general constrained optimization. Comput. Optim. Appl. 45: pp. 209236 CrossRef
 Bertsekas, D.P. (1982) Projected Newton methods for optimization problems with simple constraints. SIAM J. Control Optim. 20: pp. 221246 CrossRef
 Birgin, E.G., Gentil, J.M. (2012) Evaluating boundconstrained minimization. Comput. Optim. Appl..
 Birgin, E.G., Martinez, J.M. (2001) A box constrained optimization algorithm with negative curvature directions and spectral projected gradients. Computing, Suppl. 15: pp. 4960 CrossRef
 Birgin, E.G., Martinez, J.M. (2002) Largescale activeset boxconstrained optimization method with spectral projected gradients. Comput. Optim. Appl. 23: pp. 101125 CrossRef
 Conn, A., Gould, N., Toint, Ph. (1988) Global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM J. Numer. Anal. 25: pp. 433460 CrossRef
 Dembo, R.S., Steihaug, T. (1983) Truncated Newton algorithms for large scale unconstrained optimization. Math. Program. 26: pp. 190212 CrossRef
 Dennis, J.E., Heinkenschloss, M., Vicente, L.N. (1998) Trustregion interiorpoint algorithms for a class of nonlinear programming problems. SIAM J. Control Optim. 36: pp. 17501794 CrossRef
 Dolan, E.D., Moré, J.J. (2002) Benchmarking optimization software with performance profile. Math. Program. 91: pp. 201213 CrossRef
 Fasano, G., Lucidi, S. (2009) A nonmonotone NewtonKrylov method exploiting negative curvature directions, for large scale unconstrained optimization. Optim. Lett. 3: pp. 521535 CrossRef
 Facchinei, F., Lucidi, S., Palagi, L. (2002) A truncated Newton algorithm for large scale box constrained optimization. SIAM J. Optim. 12: pp. 11001125 CrossRef
 Friedlander, A., Martinez, J.M., Santos, S.A. (1994) A new trust region algorithm for bound constrained minimization. Appl. Math. Optim. 30: pp. 235266 CrossRef
 Grippo, L., Lampariello, F., Lucidi, S. (1991) A class of nonmonotone stabilization methods in unconstrained optimization. Numer. Math. 59: pp. 779805 CrossRef
 Grippo, L., Lampariello, F., Lucidi, S. (1989) A truncated Newton method with nonmonotone line search for unconstrained optimization. J. Optim. Theory Appl. 60: pp. 401419 CrossRef
 Gould, N., Orban, D., Toint, Ph. (2003) GALAHAD, a library of threadsafe Fortran 90 packages for largescale nonlinear optimization. ACM Trans. Math. Softw. 29: pp. 353372 CrossRef
 Gould, N.I.M., Orban, D., Toint, Ph. (2003) CUTEr (and SifDec): a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29: pp. 373394 CrossRef
 Hager, W.W., Zhang, H. (2006) A new active set algorithm for box constrained optimization. SIAM J. Optim. 17: pp. 526557 CrossRef
 Heinkenschloss, M., Ulbrich, M., Ulbrich, S. (1999) Superlinear and quadratic convergence of affinescaling interiorpoint Newton methods for problems with simple bounds without strict complementarity assumption. Math. Program. 86: pp. 615635 CrossRef
 Kanzow, C., Klug, A. (2006) On affinescaling interiorpoint Newton methods for nonlinear minimization with bound constraints. Comput. Optim. Appl. 35: pp. 177197 CrossRef
 Lin, C.J., Moré, J.J. (1999) Nexton’s method for large boundconstrained optimization problems. SIAM J. Optim. 9: pp. 11001127 CrossRef
 Moré, J.J., Toraldo, G. (1989) Algorithms for bound constrained quadratic programming problems. Numer. Math. 55: pp. 377400 CrossRef
 Moré, J.J., Toraldo, G. (1991) Numerical solution of large quadratic programming problems with bound constraints. SIAM J. Control Optim. 1: pp. 93113
 Schwartz, A., Polak, E. (1997) Family of projected descent methods for optimization problems with simple bounds. J. Optim. Theory Appl. 92: pp. 131 CrossRef
 Ulbrich, M., Ulbrich, S., Heinkenschloss, M. (1999) Global convergence of trustregion interiorpoint algorithms for infinitedimensional nonconvex minimization subject to pointwise bounds. SIAM J. Control Optim. 37: pp. 731776 CrossRef
 Zhang, Y.: Interiorpoint gradient methods with diagonalscalings for simplebound constrained optimization. Tech. report TR0406, Department of Computational and Applied Mathematics, Rice University, Houston, TX (2004)
 Title
 An active set feasible method for largescale minimization problems with bound constraints
 Journal

Computational Optimization and Applications
Volume 53, Issue 2 , pp 395423
 Cover Date
 20121001
 DOI
 10.1007/s1058901295067
 Print ISSN
 09266003
 Online ISSN
 15732894
 Publisher
 Springer US
 Additional Links
 Topics
 Keywords

 Bound constrained minimization problems
 Largescale minimization problems
 Active set methods
 Projected Newtontype methods
 Nonmonotone Newtontype methods
 BarzilaiBorwein gradient methods
 Industry Sectors
 Authors

 M. De Santis ^{(1)}
 G. Di Pillo ^{(1)}
 S. Lucidi ^{(1)}
 Author Affiliations

 1. Dipartimento di Informatica e Sistemistica, Sapienza Università di Roma, Via Ariosto, 25, 00185, Roma, Italy