Nonmonotone spectral projected gradient methods on convex sets

SIAM Journal on Optimization

Volumn 10, Issue 4, 2000, Pages 1196-1211

  Birgin, Ernesto G ^a   Martínez, José Mario ^a   Raydan, Marcos ^b  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b UNIVERSIDAD CENTRAL DE VENEZUELA   (Venezuela)

Author keywords

Bound constrained problems; Large scale problems; Nonmonotone line search; Projected gradients; Spectral gradient method

Indexed keywords

EID: 0034345420     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623497330963     Document Type: Article

References (33)

1. J. BARZILAI AND J. M. BORWEIN, Two point step size gradient methods, IMA J. Numer. Anal., 8 (1988), pp. 141-148.
2. D. P. BERTSEKAS, On the Goldstein-Levitin-Polyak gradient projection method, IEEE Trans. Automat. Control, 21 (1976), pp. 174-184.
3. D. P. BERTSEKAS, Nonlinear Programming, Athena Scientific, Belmont, MA, 1995.
4. E. G. BIRGIN, R. BILOTI, M. TYGEL, AND L. T. SANTOS, Restricted optimization: A clue to a fast and accurate implementation of the common reflection surface stack method, J. Appl. Geophys., 42 (1999), pp. 143-155.
5. E. G. BIRGIN, I. CHAMBOULEYRON, AND J. M. MARTÍNEZ, Estimation of the optical constants and the thickness of thin films using unconstrained optimization, J. Comput. Phys., 151 (1999), pp. 862-880.
6. E. G. BIRGIN AND Y. G. EVTUSHENKO, Automatic differentiation and spectral projected gradient methods for optimal control problems, Optim. Methods Softw., 10 (1998), pp. 125-146.
7. P. H. CALAMAI AND J. J. MORÉ, Projected gradient methods for linearly constrained problems, Math. Programming, 39 (1987), pp. 93-116.
8. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, Global convergence of a class of trust region algorithms for optimization with simple bounds, SIAM J. Numer. Anal., 25 (1988), pp. 433-460; see also SIAM J. Numer. Anal., 26 (1989), pp. 764-767.
9. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, Global convergence of a class of trust region algorithms for optimization with simple bounds, SIAM J. Numer. Anal., 25 (1988), pp. 433-460; see also SIAM J. Numer. Anal., 26 (1989), pp. 764-767.
10. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, LANCELOT: A Fortran Package for Large-Scale Nonlinear Optimization (Release A), Springer Ser. Comput. Math. 17, Springer-Verlag, New York, Berlin, Heidelberg, 1992.
11. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds, SIAM J. Numer. Anal., 28 (1991), pp. 545-572.
12. J. C. DUNN, Global and asymptotic convergence rate estimates for a class of projected gradient processes, SIAM J. Control Optim., 19 (1981), pp. 368-400.
13. J. C. DUNN, Gradient-related constrained minimization algorithms in function spaces: Convergence properties and computational implications, in Large Scale Optimization: State of the Art, W. W. Hager, D. W. Hearn, and P. M. Pardalos, eds., Kluwer, Dordrecht, the Netherlands, 1994.
14. A. FRIEDLANDER, J. M. MARTÍNEZ, AND S. A. SANTOS, A new trust region algorithm for bound constrained minimization, Appl. Math. Optim., 30 (1994), pp. 235-266.
15. E. M. GAFNI AND D. P. BERTSEKAS, Convergence of a Gradient Projection Method, Report LIDS-P-1201, Lab. for Info, and Dec. Systems, MIT, Cambridge, MA, 1982.
16. W. GLUNT, T. L. HAYDEN, AND M. RAYDAN, Molecular conformations from distance matrices, J. Comput. Chem., 14 (1993), pp. 114-120.
17. A. A. GOLDSTEIN, Convex programming in Hilbert space, Bull. Amer. Math. Soc., 70 (1964), pp. 709-710.
18. L. GRIPPO, F. LAMPARIELLO, AND S. LUCIDI, A nonmonotone line search technique for Newton's method, SIAM J. Numer. Anal., 23 (1986), pp. 707-716.
19. M. HEINKENSCHLOSS, Mesh independence for nonlinear least squares problems with norm constraints, SIAM J. Optim., 3 (1993), pp. 81-117.
20. E. S. LEVITIN AND B. T. POLYAK, Constrained Minimization Problems, USSR Comput. Math. Math. Phys., 6 (1966), pp. 1-50.
21. S. LUCIDI, L. PALAGI, AND M. ROMA, On some properties of quadratic programs with a convex quadratic constraint, SIAM J. Optim., 8 (1998), pp. 105-122.
22. F. LUENGO, M. RAYDAN, W. GLUNT, AND T. L. HAYDEN, Preconditioned Spectral Gradient Method for Unconstrained Optimization Problems, Technical Report R.T. 96-08, Computer Science Department, Universidad Central de Venezuela, Caracos Venezuela.
23. G. P. MCCORMICK AND R. A. TAPIA, The gradient projection method under mild differentiability conditions, SIAM J. Control, 10 (1972), pp. 93-98.
24. J. M. MARTÍNEZ AND S. A. SANTOS, A trust region strategy for minimization on arbitrary domains, Math. Programming, 68 (1995), pp. 267-302.
25. J. M. MARTÍNEZ AND S. A. SANTOS, Convergence results on an algorithm for norm constrained regularization and related problems, RAIRO Rech. Opér., 31 (1997), pp. 269-294.
26. P. D. TAO AND L. T. H. AN, D.C. optimization algorithm for solving the trust-region subproblem, SIAM J. Optim., 8 (1998), pp. 476-505.
27. M. RAYDAN, On the Barzilai and Borwein choice of steplength for the gradient method, IMA J. Numer. Anal., 13 (1993), pp. 321-326.
28. M. RAYDAN, The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem, SIAM J. Optim., 7 (1997), pp. 26-33.
29. F. RENDL AND H. WOLKOWICZ, A semidefinite framework to trust region subproblems with application to large scale minimization, Math. Programming, 77 (1997), pp. 273-299.
30. M. ROJAS, S. A. SANTOS AND D. C. SORENSEN, A new matrix-free algorithm for the large-scale trust-region subproblem, SIAM J. Optim, to appear.
31. A. SCHWARTZ AND E. POLAK, Family of projected descent methods for optimization problems with simple bounds, J. Optim. Theory Appl., 92 (1997), pp. 1-31.
32. D. C. SORENSEN, Minimization of a large-scale quadratic function subject to spherical constraint, SIAM J. Optim., 7 (1997), pp. 141-161.
33. C. R. VOGEL, A constrained least squares regularization method for nonlinear ill-posed problems, SIAM J. Control Optim., 28 (1990), pp. 34-49.