A general approach to convergence properties of some methods for nonsmooth convex optimization

Applied Mathematics and Optimization

Volumn 38, Issue 2, 1998, Pages 141-158

  Birge, J R ^a   Qi, L ^b   Wei, Z ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Convergence rate; Global convergence; Nonsmooth convex minimization

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; OPTIMIZATION; THEOREM PROVING;

NONSMOOTH CONVEX MINIMIZATION;

COMPUTATIONAL GEOMETRY;

EID: 11744310763     PISSN: 00954616     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002459900086     Document Type: Article

References (17)

1. Auslender A (1993) Convergence of stationary sequences for variational inequalities with maximal monotone operators. Applied Mathematics and Optimization 28: 161-172
2. Auslender A, Cominetti R, Crouzeix JP (1993) Convex functions with unbounded level sets and applications to duality theory, SIAM Journal on Optimization 3: 669-687
3. Auslender A, Crouzeix JP (1989) Well behaved asymptotical convex functions, in: Analyse Non-linéare (Perpignan, 1987), Université de Montréal, Montréal, pp 101-122
4. Bonnans JF, Gilbert JC, Lemaréchal C, Sagastizábal CA (1995), A family of variable metric proximal methods, Mathematical Programming 68: 15-47
5. Chou CC, Ng KF, Pang JS (1995) Minimizing and stationary sequences for optimization problems, Manuscript, Department of Mathematical Sciences, The Johns Hopkins University, Baltimore, MD
6. Correa R, Lemaréchal C (1993) Convergence of some algorithms for convex minimization, Mathematical Programming 62: 261-275
7. Fukushima F, Pang JS (1995) Minimizing and stationary sequences of merit functions for complementarity problems and variational inequalities. Manuscript, Department of Mathematical Sciences, The Johns Hopkins University, Baltimore, MD
8. Güler O (1991) On the convergence of the proximal point algorithm for convex minimization, SIAM Journal on Control and Optimization 29: 403-419
9. Kiwiel KC (1983) An aggregate subgradient method for nonsmooth convex minimization, Mathematical Programming 27: 320-341
10. Lemaire B (1992) About the convergence of the proximal method, in: D. Pallaschke, ed, Advances in Optimization. Lecture Notes in Economics and Mathematics Systems, Springer-Verlag, Berlin, pp 39-51
11. Poljak BT (1967) A general methods for solving extremum problems, Soviet Mathematics Doklady 8: 593-597
12. Rockafellar RT (1970) Convex Analysis, Princeton University Press, Princeton, NJ
13. Rockafellar RT (1976) Monotone operators and proximal point algorithm, SIAM Journal on Control and Optimization 14: 877-898
14. Todd MJ (1989) On convergence properties of algorithms for unconstrained minimization, IMA Journal of Numerical Analysis 9: 435-441
15. Wei Z, Qi L (1996) Convergence analysis of a proximal Newton method, Numerical Functional Analysis and Optimization 17: 463-472
16. Wei Z, Qi L, Jiang J (to appear) Some convergence properties of descent methods, Journal of Optimization: Theory and Applications
17. Wu SQ (1992) Convergence properties of descent methods for unconstrained minimization, Optimization 26: 229-237