Inexact proximal point algorithms and descent methods in optimization

Optimization and Engineering

Volumn 6, Issue 2, 2005, Pages 257-271

  Humes Jr , Carlos ^a   Silva, Paulo J S ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Convex programming; Monotone operators; Proximal methods

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; DIFFERENTIATION (CALCULUS); FUNCTIONS; MATHEMATICAL OPERATORS; MATHEMATICAL PROGRAMMING; THEOREM PROVING; VARIATIONAL TECHNIQUES;

CONVEX PROGRAMMING; INEXACT PROXIMAL POINT ALGORITHMS; MONOTONE OPERATORS; PROXIMAL METHODS; UNCONSTRAINED OPTIMIZATION;

OPTIMIZATION;

EID: 17344362566     PISSN: 13894420     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11081-005-6798-9     Document Type: Article

References (21)

1. A. Auslender, "Numerical methods for nondifferentiable convex optimization" Mathematical Programming Studies vol. 30, pp. 102-126, 1987.
2. D. Bertsekas, Nonlinear Programming, Athena Scientific, 1995.
3. D. Bertsekas, Constrained Optimization and Lagrange Multipliers, Athena Scientific, 1996.
4. D. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice Hall, 1989.
5. J. R. Birge, L. Qi, and Z. Wei, "A general approach to convergence properties of some methods for nonsmooth convex optimization" Applied Mathematics and Optimization vol. 38, pp. 141-158, 1998.
6. J. E. Dennis Jr. and R. B. Schnabel, "Numerical methods for unconstrained optimization and nonlinear equations" SIAM, 1996.
7. J. Eckstein and D. Bertsekas, "On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators" Mathematical Programming vol. 55, pp. 293-318, 1992.
8. C. Humes and P. J. S. Silva, "Strict convex regularizations, proximal point and augmented Lagrangians" RAIRO Operations Research vol. 34, no. 3, pp. 283-303, 2000.
9. C. Humes, P. J. S. Silva, and B. F. Svaiter, "An inexact projection-proximal augmented Lagrangian algorithm" in Proceedings of the 36th Annual Allerton Conference on Communication, Control, and Computing, 1998, pp. 450-459.
10. J.-B. Hiriart-Urruty and C. Lemarechal, Fundamental of Convex Analysis, Springer-Verlag, 2002.
11. A. N. Iusem, Proximal Point Methods in Optimization. Instituto de Matemática Pura e Aplicada - CNPq, 1995.
12. A. N. Iusem, B, "Augmented Lagrangian methods and proximal point methods for convex optimization" Investigación Operativa vol. 8, pp. 11-49, 1999.
13. B. Martinet, "Regularisation d'inéquations variationelles par approximations successives" Revue Française Informatique Recherche Opérationnelle vol. 4, pp. 154-158, 1970.
14. B. Martinet, "Détermination approchée d'un point fixe d'une application pseudo-contractante" Comptes Rendus Hebdomadaires des Séances de l'Académie des Sciences. Séries A et B vol. 274, pp. A163-A165, 1972.
15. L. Polak, Optimization: Algorithms and Consistent Approximations, Springer Verlag, 1997.
16. R. T. Rockafellar, Convex Analysis, Princeton University Press, 1970.
17. R. T. Rockafellar, "Monotone operators and the proximal point algorithm" SIAM Journal on Control and Optimization vol. 14, pp. 887-898, 1976a.
18. R.T. Rockafellar, "Augmented Lagrangians and applications of the proximal point algorithm in convex programming" Mathematics of Operations Research vol. 1, pp. 97-116, 1976b.
19. R. T. Rockafellar R. J.-B. Wets 1998 Variational Analysis Springer-Verlag Berlin
20. M. Solodov and B. F. Svaiter, "A Hybrid projection-proximal point algorithm" Journal of Convex Analysis vol. 6, pp. 59-70, 1999.
21. M. Solodov and B. F. Svaiter, "A globally convergent inexact Newton's method for systems of monotone equations" in M. Fukushima and L. Qi, eds., Reformulation - Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, Applied Optimization , Kluwer Academic Publishers, vol. 22, pp. 355-369, 1999.