On the projected subgradient method for nonsmooth convex optimization in a Hilbert space

Mathematical Programming, Series B

Volumn 81, Issue 1, 1998, Pages 23-35

  Alber, Ya I ^a,b   Iusem, A N ^a   Solodov, M V ^a  

^a INSTITUTO DE PESQUISAS JARDIM BOTÂNICO DO RIO DE JANEIRO   (Brazil)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Convergence rate; Convex optimization; Nonsmooth optimization; Projected gradient method; Steepest descent method; Weak convergence

Indexed keywords

EID: 0004841122     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01584842     Document Type: Article

References (21)

1. R. Correa, C. Lemaréchal, Convergence of some algorithms for convex minimization, Mathematical Programming 62 (1993) 261-275.
2. B.T. Polyak, Introduction to Optimization, Optimization Software, New York, 1987.
3. J.R. Giles, Convex analysis with applications in differentiation of convex functions, in: Research Notes in Mathematics, vol. 58, Pitman, Boston, MA, 1982.
4. R.T. Rockafellar, Local boundedness of nonlinear monotone operators, Michigan Mathematical Journal 16 (1969) 397-407.
5. A. Brønsted, R.T. Rockafellar, On the subdifferentiability of convex functions, Proceedings of the American Mathematical Society 16 (1965) 605-611.
6. B.T. Polyak, A general method of solving extremum problems, Soviet Mathematics Doklady 8 (1967) 593-597.
7. Yu.M. Ermoliev, Methods for solving nonlinear extremal problems, Cybernetics 2 (1966) 1-17.
8. Ya.I. Alber, On minimization of smooth functional by gradient methods, USSR Computational Mathematics and Mathematical Physics 11 (1971) 752-758.
9. Ya.I. Alber, Recurrence relations and variational inequalities, Soviet Mathematics Doklady 27 (1983) 511-517.
10. M.V. Solodov, S.K. Zavriev, Error stability properties of generalized gradient-type algorithms Journal of Optimization Theory and Applications 98 (1998), to appear.
11. E. Golstein, N. Tretyakov, Modified Lagrangian Functions, Nauka, Moscow, 1989.
12. Yu. Nesterov, Effective Methods in Nonlinear Programming, Nauka, Moscow, 1989.
13. M. Minoux, Mathematical Programming, Theory and Algorithms, Wiley, New York, 1986.
14. V.A. Bereznyev, V.G. Karmanov, A.A. Tretyakov, The stabilizing properties of the gradient method, USSR Computational Mathematics and Mathematical Physics 26 (1986) 84-85.
15. R. Burachik, L.M. Graña Drummond, A.N. Iusem, B.F. Svaiter, Full convergence of the steepest descent method with inexact line searches, Optimization 32 (1995) 137-146.
16. K. Kiwiel, K. Murty. Convergence of the steepest descent method for minimizing quasi convex functions, Journal of Optimization Theory and Applications 89 (1996) 221-226.
17. B.F. Svaiter, Steepest descent method in Hilbert spaces with Armijo search (to be published).
18. Yu.M. Ermoliev, On the method of generalized stochastic gradients and quasi-Fejér sequences, Cybernetics 5 (1969) 208-220.
19. A.N. Iusem, B.F. Svaiter, M. Teboulle, Entropy-like proximal methods in convex programming, Mathematics of Operations Research 19 (1994) 790-814.
20. K. Knopp, Theory and Application of Infinite Series, Dover, New York, 1990.
21. Ya.I. Alber, A.N. Iusem, M.V. Solodov, Minimization of nonsmooth convex functionals in Banach spaces, Journal of Convex Analysis; to appear.