An active set feasible method for large-scale minimization problems with bound constraints

Computational Optimization and Applications

Volumn 53, Issue 2, 2012, Pages 395-423

  De Santis, M ^a   Di Pillo, G ^a   Lucidi, S ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Active set methods; Barzilai Borwein gradient methods; Bound constrained minimization problems; Large scale minimization problems; Nonmonotone Newton type methods; Projected Newton type methods

Indexed keywords

CONSTRAINED OPTIMIZATION; NEWTON-RAPHSON METHOD;

ACTIVE SET METHODS; BARZILAI-BORWEIN GRADIENT METHOD; BOUND CONSTRAINED MINIMIZATION PROBLEMS; LARGE-SCALE MINIMIZATION PROBLEMS; NONMONOTONE NEWTON-TYPE METHODS; PROJECTED NEWTON-TYPE METHODS;

GRADIENT METHODS;

EID: 84868338629     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-012-9506-7     Document Type: Article

References (25)

1. Andreani, R., Birgin, E.G., Martinez, J.M., Schuverdt, M.L.: Second-order negative-curvature methods for box-constrained and general constrained optimization. Comput. Optim. Appl. 45(2), 209-236 (2010)
2. Bertsekas, D.P.: Projected Newton methods for optimization problems with simple constraints. SIAM J. Control Optim. 20(2), 221-246 (1982)
3. Birgin, E.G., Gentil, J.M.: Evaluating bound-constrained minimization. Comput. Optim. Appl. (2012). doi:10.1007/s10589-012-9466-y
4. Birgin, E.G., Martinez, J.M.: A box constrained optimization algorithm with negative curvature directions and spectral projected gradients. Computing, Suppl. 15, 49-60 (2001)
5. Birgin, E.G., Martinez, J.M.: Large-scale active-set box-constrained optimization method with spectral projected gradients. Comput. Optim. Appl. 23, 101-125 (2002) (Pubitemid 35167001)
6. Conn, A., Gould, N., Toint, Ph.: Global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM J. Numer. Anal. 25, 433-460 (1988)
7. Dembo, R.S., Steihaug, T.: Truncated Newton algorithms for large scale unconstrained optimization. Math. Program. 26, 190-212 (1983) (Pubitemid 13587146)
8. Dennis, J.E., Heinkenschloss, M., Vicente, L.N.: Trust-region interior-oint algorithms for a class of nonlinear programming problems. SIAM J. Control Optim. 36, 1750-1794 (1998) (Pubitemid 128493570)
9. Dolan, E.D., Moré, J.J.: Benchmarking optimization software with performance profile. Math. Program. 91, 201-213 (2002) (Pubitemid 44744777)
10. Fasano, G., Lucidi, S.: A nonmonotone Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization. Optim. Lett. 3, 521-535 (2009)
11. Facchinei, F., Lucidi, S., Palagi, L.: A truncated Newton algorithm for large scale box constrained optimization. SIAM J. Optim. 12(4), 1100-1125 (2002)
12. Friedlander, A., Martinez, J.M., Santos, S.A.: A new trust region algorithm for bound constrained minimization. Appl. Math. Optim. 30, 235-266 (1994)
13. Grippo, L., Lampariello, F., Lucidi, S.: A class of nonmonotone stabilization methods in unconstrained optimization. Numer. Math. 59, 779-805 (1991)
14. Grippo, L., Lampariello, F., Lucidi, S.: A truncated Newton method with nonmonotone line search for unconstrained optimization. J. Optim. Theory Appl. 60(3), 401-419 (1989)
15. Gould, N., Orban, D., Toint, Ph.: GALAHAD, a library of thread-safe Fortran 90 packages for largescale nonlinear optimization. ACM Trans. Math. Softw. 29(4), 353-372 (2003)
16. Gould, N.I.M., Orban, D., Toint, Ph.: CUTEr (and SifDec): a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4), 373-394 (2003)
17. Hager,W.W., Zhang, H.: A new active set algorithm for box constrained optimization. SIAM J. Optim. 17, 526-557 (2006) (Pubitemid 46798079)
18. Heinkenschloss, M., Ulbrich,M., Ulbrich, S.: Superlinear and quadratic convergence of affine-scaling interior-oint Newton methods for problems with simple bounds without strict complementarity assumption. Math. Program. 86, 615-635 (1999)
19. Kanzow, C., Klug, A.: On affine-scaling interior-oint Newton methods for nonlinear minimization with bound constraints. Comput. Optim. Appl. 35(2), 177-197 (2006) (Pubitemid 44546763)
20. Lin, C.J., Moré, J.J.: Nexton's method for large bound-constrained optimization problems. SIAM J. Optim. 9(4), 1100-1127 (1999) (Pubitemid 129489319)
21. Moré, J.J., Toraldo, G.: Algorithms for bound constrained quadratic programming problems. Numer. Math. 55, 377-400 (1989)
22. Moré, J.J., Toraldo, G.: Numerical solution of large quadratic programming problems with bound constraints. SIAM J. Control Optim. 1, 93-113 (1991)
23. Schwartz, A., Polak, E.: Family of projected descent methods for optimization problems with simple bounds. J. Optim. Theory Appl. 92(1), 1-31 (1997) (Pubitemid 127355474)
24. Ulbrich, M., Ulbrich, S., Heinkenschloss, M.: Global convergence of trust-region interior-oint algorithms for infinite-dimensional nonconvex minimization subject to pointwise bounds. SIAM J. Control Optim. 37, 731-776 (1999)
25. Zhang, Y.: Interior-oint gradient methods with diagonal-scalings for simple-bound constrained optimization. Tech. report TR04-06, Department of Computational and Applied Mathematics, Rice University, Houston, TX (2004)