A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework

Optimization Methods and Software

Volumn 19, Issue 5 SPEC. ISS., 2004, Pages 557-575

  Solodov, M V ^a  

^a IMPA   (Brazil)

Author keywords

Bundle method; Decomposition; Enlargement of operator; Hybrid inexact proximal point method; Maximal monotone operator; Variational inclusion

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL OPERATORS; PROBLEM SOLVING; SET THEORY; VARIATIONAL TECHNIQUES;

BUNDLE METHOD; ENLARGEMENT OF OPERATORS; HYBRID INEXACT PROXIMAL POINT METHOD; MAXIMAL MONOTONE OPERATOR; VARIATIONAL INCLUSION;

MATHEMATICAL PROGRAMMING;

EID: 6344263660     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/1055678042000218957     Document Type: Article

References (38)

1. A. Auslender (1985). Two general methods for computing saddle points with applications for decomposing convex programming problems. Applied Mathematics and Optimization, 13, 79-95.
2. A. Auslender and M. Teboulle (2001). Entropic proximal decomposition methods for convex programs and variational inequalities. Mathematical Programming, 91, 33-47.
3. H.H. Bauschke (2001). Projection algorithms: results and open problems, newblock In: D. Butnariu, Y. Censor and S. Reich (Eds.), Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, Vol. 8 of Studies in Computational Mathematics, pp. 11-22. Elsevier Science B.V., Amsterdam.
4. J.F. Bonnans, J.Ch. Gilbert, C. Lemaréchal and C. Sagastizábal (2003). Numerical Optimization: Theoretical and Practical Aspects. Springer-Verlag, Berlin, Germany.
5. R.S. Burachik, A.N. Iusem and B.F. Svaiter (1997). Enlargement of monotone operators with applications to variational inequalities. Set-Valued Analysis, 5, 159-180.
6. R.S. Burachik, C.A. Sagastizábal and S. Scheimberg (2002). An inexact method of partial inverses. Application to splitting methods. IMPA preprint A144, Rio de Janeiro, Brazil.
7. R.S. Burachik, C.A. Sagastizábal and B. F. Svaiter (1999). Bundle methods for maximal monotone operators. In: R. Tichatschke and M. Théra (Eds.), Ill-posed variational problems and ragularization techniques, Lecture Notes in Economics and Mathematical Systems, No. 477, pp. 49-64. Springer-Verlag, Berlin.
8. R.S. Burachik, C.A. Sagastizábal and B.F. Svaiter (1999). ε-Enlargements of maximal monotone operators: Theory and applications. In: M. Fukushima and L. Qi (Eds.), Reformulation - Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, pp. 25-44. Kluwer Academic Publishers, Dordrecht.
9. G. Chen and M. Teboulle (1994). A proximal-based decomposition method for convex minimization problems. Mathematical Programming, 64, 81-101.
10. H.-G. Chen and R.T. Rockafellar (1997). Convergence rates in forward-backward splitting. SIAM Journal on Optimization, 7, 421-444.
11. P.L. Combettes (2001). Quasi-Fejérian analysis of some optimization algorithms. In: D. Butnariu, Y. Censor and S. Reich (Eds.), Inherantly Parallel Algorithms in Feasibility and Optimization and their Applications, Vol. 8 of Studies in Computational Mathematics, pp. 115-152. Elsevier Science B.V., Amsterdam.
12. J. Eckstein and D.P. Bertsekas (1992). On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Mathematical Programming, 55, 293-318.
13. D. Gabay (1983). Applications of the method of multipliers to variational inequalities. In: M. Fortin and R. Glowinski (Eds.), Augmented Lagrangian Methods: Applications to the Solution of Boundary-Value Problems, pp. 299-331. North-Holland, Amsterdam.
14. E.N. Khobotov (1987). A modification of the extragradient method for the solution of variational inequalities and some optimization problems. USSR Computational Mathematics and Mathematical Physics, 27, 1462-1473.
15. K.C, Kiwiel, C.H. Rosa and A. Ruszczyński (1999). Proximal decomposition via alternating linearization. SIAM Journal on Optimization, 9, 668-689.
16. G.M. Korpelevich (1976). The extragradient method for finding saddle points and other problems. Matecon, 12, 747-756.
17. B. Lemaire (1989). The proximal algorithm. In: J.-P. Penot (Ed.), New Methods of Optimization and Their Industrial Use. International Series of Numerical Mathematics 87, pp. 73-87. Birkhauser, Basel.
18. P.L. Lions and B. Mercier (1979). Splitting algorithms for the sum of two nonlinear operators. SIAM Journal on Numerical Analysis, 16, 964-979.
19. B. Martinet (1970). Regularisation d' inequations variationelles par approximations successives. Revue Française d'Informatique et de Recherche Opérationelle, 4, 154-159.
20. A. Ouorou (2004). Epsilon-proximal decomposition method. Mathematical Programming, 99, 89-108.
21. G.B. Passty (1979). Ergodic convergence to a zero of the sum of monotone operators in Hubert space. Journal of Mathematical Analysis and Applications, 72, 383-390.
22. T. Pennanen (2002). A splitting method for composite mappings. Numerical Functional Analysis and Optimization, 23, 875-890.
23. R.T. Rockafellar (1970). On the maximality of sums of nonlinear monotone operators. Transactions of the American Mathematical Society, 149, 75-88.
24. R.T. Rockafellar (1976). Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Mathematics of Operations Research, 1, 97-116.
25. R.T. Rockafellar (1976). Monotone operators and the proximal point algorithm. SIAM Journal on Control and Optimization, 14, 877-898.
26. C.A. Sagastizábal and MV. Solodov (2001). On the relation between bundle methods for maximal monotone inclusions and hybrid proximal point algorithms. In: D. Butnariu, Y. Censor and S. Reich (Eds.), Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, Vol. 8 of Studies in Computational Mathematics, pp. 441-455. Elsevier Science B.V., Amsterdam.
27. M.V. Solodov and B.F. Svaiter (1999). A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator. Set-Valued Analysis, 7, 323-345.
28. M.V. Solodov and B.F. Svaiter (1999). A hybrid projection-proximal point algorithm. Journal of Convex Analysis, 6, 59-70.
29. M.V. Solodov and B.F. Svaiter (2000). Error bounds for proximal point subproblems and associated inexact proximal point algorithms. Mathematical Programming, 88, 371-389.
30. M.V. Solodov and B.F. Svaiter (2000). A truly globally convergent Newton-type method for the monotone nonlinear complementarity problem. SIAM Journal on Optimization, 10, 605-625.
31. M.V. Solodov and B.F. Svaiter (2001). A unified framework for some inexact proximal point algorithms. Numerical Functional Analysis and Optimization, 22, 1013-1035.
32. M.V. Solodov and B.F. Svaiter (2002). A new proximal-based globalization strategy for the Josephy-Newton method for variational inequalities. Optimization Methods and Software, 17, 965-983.
33. M.V. Solodov and P. Tseng (1996). Modified projection-type methods for monotone variational inequalities. SIAM Journal on Control and Optimization, 34, 1814-1830.
34. J.E. Spingarn (1985). Applications of the method of partial inverses to convex programming. Mathematical Programming, 32, 199-223.
35. P. Tseng (1991). Applications of a splitting algorithm to decomposition in convex programmning and variational inequalities. SIAM Journal on Control and Optimization, 29, 119-138.
36. P. Tseng (1995). On linear convergence of iterative methods for the variational inequality problem. Journal of Computational and Applied Mathematics, 60, 237-252.
37. P. Tseng (1997). Alternating projection-proximal methods for convex programming and variational inequalities. SIAM Journal on Optimization, 7, 951-965.
38. P. Tseng (2000). A modified forward-backward splitting method for maximal monotone mappings. SIAM Journal on Control and Optimization, 38, 431-446.