Inexact spectral projected gradient methods on convex sets

IMA Journal of Numerical Analysis

Volumn 23, Issue 4, 2003, Pages 539-559

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

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b UNIVERSITY OF CAMPINAS   (Brazil)

^c FACULTAD DE CIENCIAS   (Venezuela)

Author keywords

Convex constrained optimization; Dykstra's algorithm; Nonmonotone line search; Projected gradient; Spectral gradient

Indexed keywords

GRADIENT METHODS; SET THEORY;

ALTERNATING PROJECTION METHOD; CONSTRAINED LEAST SQUARES; DYKSTRA'S ALGORITHM; GLOBAL CONVER-GENCE; NONMONOTONE LINE SEARCH; PROJECTED GRADIENT; SPECTRAL GRADIENTS; SPECTRAL PROJECTED GRADIENT METHOD;

CONSTRAINED OPTIMIZATION;

EID: 0142199775     PISSN: 02724979     EISSN: None     Source Type: Journal    
DOI: 10.1093/imanum/23.4.539     Document Type: Article

References (31)

1. BARKER, G. P. & CARLSON, D. (1975) Cones of diagonally dominant matrices. Pac. J. Math., 57, 15-32.
2. BARZILAI, J. & BORWEIN, J. M. (1988) Two point step size gradient methods. IMA J. Numer. Anal., 8, 141-148.
3. BERTSEKAS, D. P. (1976) On the Goldstein-Levitin-Polyak gradient projection method. IEEE Trans. Auto. Contr., 21, 174-184.
4. BERTSEKAS, D. P. (1999) Nonlinear Programming. Belmont, MA: Athena Scientific.
5. BIRGIN, E. G. & MARTÍNEZ, J. M. (2002) Large-scale active-set box-constrained optimization method with spectral projected gradients. Comput. Optim. Appl., 23, 101-125.
6. BIRGIN, E. G., MARTÍNEZ, J. M. & RAYDAN, M. (2000) Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim., 10, 1196-1211.
7. BIRGIN, E. G., MARTÍNEZ, J. M. & RAYDAN, M. (2001) Algorithm 813: SPG- Software for convex-constrained optimization. ACM Trans. Math. Software, 27, 340-349.
8. BOYLE, J. P. & DYKSTRA, R. L. (1986) A method for finding projections onto the intersection of convex sets in Hilbert spaces. Lecture Notes in Statistics, 37, 28-47.
9. DAI, Y. H. & LIAO, L. Z. (2002) R-linear convergence of the Barzilai and Borwein gradient method. IMA J. Numer. Anal, 22, 1-10.
10. DAI, Y. H. (2000) On nonmonotone line search. J. Optim. Theo. Appl., to appear.
11. DANTZIG, G. B. (1985) Deriving an utility function for the economy SOL 85-6R, Department of Operations Research. CA: Stanford University.
12. DEUTSCH, F. (2001) Best Approximation in Inner Product Spaces. New York: Springer.
13. DYKSTRA, R. L. (1983) An algorithm for restricted least-squares regression. J. Amer. Stat. Asso., 78, 837-842.
14. ESCALANTE, R. & RAYDAN, M. (1996) Dykstra's Algorithm for a Constrained Least-Squares Matrix Problem. Num. Lin. Alg. Appl., 3, 459-471.
15. ESCALANTE, R. & RAYDAN, M. (1998) On Dykstra's algorithm for constrained least-squares rectangular matrix problems. Comput. Math. Appl., 35, 73-79.
16. FIEDLER, M. & PTAK, V. (1967) Diagonally dominant matrices. Czech. Math. J., 17, 420-433.
17. FLETCHER, R. (1981) A nonlinear programming problem in statistics (educational testing). SIAM J. Sci. Stat. Comput., 2, 257-267.
18. FLETCHER, R. (1985) Semi-definite matrix constraints in optimization. SIAM J. Cont. Optim., 23, 493-513.
19. FLETCHER, R. (1990) Low storage methods for unconstrained optimization. Lect. Appl. Math. (AMS), 26, 165-179.
20. FLETCHER, R. (2001) On the Barzilai-Borwein method. Department of Mathematics, University of Dundee NA/207.
21. GOLDSTEIN, A. A. (1964) Convex Programming in Hubert Space. Bull. Amer. Math. Soci., 70, 709-710.
22. GRIPPO, L., LAMPARIELLO, F. & LUCIDI, S. (1986) A nonmonotone line search technique for Newton's method. SIAM J. Num. Anal., 23, 707-716.
23. HAN, S. P. (1988) A successive projection method. Math. Programm., 40, 1-14.
24. HU, H. & OLKIN, I. (1991) A numerical procedure for finding the positive definite matrix closest to a patterned matrix. Stat. Probability Lett., 12, 511-515.
25. LEVITIN, E. S. & POLYAK, B. T. (1966) Constrained Minimization Problems. USSR Computl Math. Mathl Physics, 6, 1-50.
26. MENDOZA, M., RAYDAN, M. & TARAZAGA, P. (1998) Computing the nearest diagonally dominant matrix. Num. Lin. Alg. Appl., 5, 461-474.
27. RAYDAN, M. (1993) On the Barzilai and Borwein choice of steplength for the gradient method. IMA J. Num. Anal., 13, 321-326.
28. RAYDAN, M. (1997) The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem. SIAM J. Optim., 7, 26-33.
29. RAYDAN, M. & TARAZAGA, P. (2002) Primal and polar approach for computing the symmetric diagonally dominant projection. Num. Lin. Alg. Appl., 9, 333-345.
30. VON NEUMANN, J. (1950) Functional operators vol. II. The geometry of orthogonal spaces Annals of Mathematical Studies, 22. Princeton, NJ: Princeton University Press, This is a reprint of mimeographed lecture notes first distributed in 1933.
31. SCHRAGE, L. (1979) A more portable Fortran random number generator. ACM Trans. Math. Software, 5, 132-138.