Interior gradient and proximal methods for convex and conic optimization

SIAM Journal on Optimization

Volumn 16, Issue 3, 2006, Pages 697-725

  Auslender, Alfred ^a   Teboulle, Marc ^b  

^a UNIVERSITÉ LYON 1   (France)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Conic optimization; Convergence and efficiency; Convex optimization; Interior gradient subgradient algorithms; Proximal distances

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; OPTIMIZATION;

CONIC OPTIMIZATION; CONVERGENCE AND EFFICIENCY; CONVEX OPTIMIZATION; INTERIOR GRADIENT/SUBGRADIENT ALGORITHMS; PROXIMAL DISTANCES;

GRADIENT METHODS;

EID: 33747151859     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623403427823     Document Type: Article

References (45)

1. F. ALVAREZ, J. BOLTE, AND O. BRAHIC, Hessian Riemannian gradient flows in convex programming, SIAM J. Control Optim., 43 (2004), pp. 477-501.
2. H. ATTOUCH AND M. TEBOULLE, A regularized Lotka Volterra dynamical system as a continuons proximal-like method in optimization, J. Optim. Theory Appl., 121 (2004), pp. 541-570.
3. A. AUSLENDER AND M. HADDOU, An interior proximal method for convex linearly constrained problems and its extension to variational inequalities, Math. Program., 71 (1995), pp. 77-100.
4. A. AUSLENDER, M. TEBOULLE, AND S. BEN-TIBA, A logarithmic-quadratic proximal method for variational inequalities, Comput. Optim. Appl., 12 (1999), pp. 31-40.
5. A. AUSLENDER, M. TEBOULLE, AND S. BEN-TIBA, Interior proximal and multiplier methods based on second order homogeneous kernels, Math. Oper. Res., 24 (1999), pp. 645-668.
6. A. AUSLENDER AND M. TEBOULLE, Asymptotic Cones and Functions in Optimization and Variational Inequalities, Springer Monogr. Math., Springer-Verlag, New York, 2003.
7. A. AUSLENDER AND M. TEBOULLE, Interior gradient and epsilon-subgradient methods for constrained convex minimization, Math. Oper. Res., 29 (2004), pp. 1-26.
8. A. BECK AND M. TEBOULLE, Mirror descent and nonlinear projected subgradient methods for convex optimization, Oper. Res. Lett., 31 (2003), pp. 167-175.
9. A. BEN-TAL, T. MARGALIT, AND A. NEMIROVSKI, The ordered subsets mirror descent optimization method with applications to tomography, SIAM J. Optim., 12 (2001), pp. 79-108.
10. A. BEN-TAL AND M. ZIBULEVSKY, Penalty/barrier methods for convex programming problems, SIAM J. Optim., 7 (1997), pp. 347-366.
11. D. P. BERTSEKAS, On the Goldstein-Levitin-Polyak gradient projection method, IEEE Trans. Automat. Control, 21 (1976), pp. 174-183.
12. D. P. BERTSEKAS, Nonlinear Programming, 2nd ed., Athena Scientific, Belmont, MA, 1999.
13. J. BOLTE AND M. TEBOULLE, Barrier operators and associated gradient-like dynamical systems for constrained minimization problems, SIAM J. Control Optim., 42 (2003), pp. 1266-1292.
14. H. BREZIS, Analyse Fonctionnelle: Theorie et applications, Masson, Paris, 1987.
15. Y. CENSOR AND S. ZENIOS, The proximal minimization algorithm with D-functions, J. Optim. Theory Appl., 73 (1992), pp. 451-464.
16. G. CHEN AND M. TEBOULLE, Convergence analysis of a proximal-like minimization algorithm using Bregman functions, SIAM J. Optim., 3 (1993), pp. 538-543.
17. R. CORREA AND C. LEMARECHAL, Convergence of some algorithm for convex programming, Math. Program., 62 (1993), pp. 261-275.
18. M. DOLJANSKY AND M. TEBOULLE, An interior proximal algorithm and the exponential multiplier method for semidefinite programming, SIAM J. Optim., 9 (1998), pp. 1-13.
19. J. ECKSTEIN, Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming, Math. Oper. Res., 18 (1993), pp. 202-226.
20. J. ECKSTEIN, Approximate iterations in Bregman-function-based proximal algorithms, Math. Program., 83 (1998), pp. 113-123.
21. P. P. B. EGGERMONT, Multiplicatively iterative algorithms for convex programming, Linear Algebra Appl., 130 (1990), pp. 25-42.
22. J. FARAUT AND A. KORÁNYI, Analysis on Symmetric Cones, Oxford Math. Monogr., The Claredon Press, Oxford University Press, New York, 1994.
23. M. FUKUSHIMA, Z.-Q. LUO, AND P. TSENG, Smoothing functions for second-order-cone complementarity problems, SIAM J. Optim., 12 (2001), pp. 436-460.
24. O. GÜLER, On the convergence of the proximal point algorithm for convex minimization, SIAM J. Control Optim., 29 (1991), pp. 403-419.
25. A.N. IUSEM, Interior point multiplicative methods for optimization under positivity constraints, Acta Appl. Math., 38 (1995), pp. 163-184.
26. A. N. IUSEM, B. F. SVAITER, AND M. TEBOULLE, Multiplicative interior gradient methods for minimization over the nonnegative orthant, SIAM J. Control Optim., 34 (1996), pp. 389-406.
27. A. N. IUSEM, B. SVAITER, AND M. TEBOULLE, Entropy-like proximal methods in convex programming, Math. Oper. Res., 19 (1994), pp. 790-814.
28. A. N. IUSEM AND M. TEBOULLE, Convergence rate analysis of nonguadratic proximal and augmented Lagrangian methods for convex and linear programming, Math. Oper. Res., 20 (1995), pp. 657-677.
29. K. C. KIWIEL, Proximal minimization methods with generalized Bregman functions, SIAM J. Control Optim., 35 (1997), pp. 1142-1168.
30. B. LEMAIRE, The proximal algorithm, in New Methods in Optimization and Their Industrial Uses, Internat. Schriftenreihe Numer. Math. 87, J. P. Penot, ed., Birkhäuser, Basel, 1989, pp. 73-87.
31. B. MARTINET, Regularisation d'inéquations variationnelles par approximations successives, Rev. Française Informat. Recherche Opérationnelle, 4 (1970), pp. 154-158.
32. A. NEMIROVSKI AND D. YUDIN, Problem Complexity and Method Efficiency in Optimization, John Wiley, New York, 1983.
33. Y. NESTEROV AND A. NEMIROVSKII, Interior Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, 1994.
34. Y. NESTEROV, On an approach to the construction of optimal methods of minimization of smooth convex functions, Èkonom. i Mat. Metody, 24 (1988), pp. 509-517.
35. B. T. POLYAK, Introduction to Optimization, Optimization Software, New York, 1987.
36. R. A. POLYAK, Nonlinear rescaling vs. smoothing technique in constrained optimization, Math. Program., 92 (2002), pp. 197-235.
37. R. A. POLYAK AND M. TEBOULLE, Nonlinear rescaling and proximal-like methods in convex optimization, Math. Program., 76 (1997), pp. 265-284.
38. S. M. ROBINSON, Linear convergence of epsilon subgradients methods for a class of convex functions, Math. Program., 86 (1999), pp. 41-50.
39. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
40. R. T. ROCKAFELLAR, Monotone operators and the proximal point algorithm, SIAM J. Control Optim., 14 (1976), pp. 877-898.
41. N. Z. SHOR, Minimization Methods for Nondifferentiable Functions, Springer-Verlag, Berlin, 1985.
42. P. J. DA SILVA E SILVA, J. ECKSTEIN, AND C. HUMES, JR., Rescaling and stepsize selection in proximal methods using separable generalized distances, SIAM J. Optim., 12 (2001), pp. 238-261.
43. M. TEBOULLE, Entropic proximal mappings with applications to nonlinear programming, Math. Oper. Res., 17 (1992), pp. 670-681.
44. M. TEBOULLE, Convergence of proximal-like algorithms, SIAM J. Optim., 7 (1997), pp. 1069-1083.
45. P. TSENG AND D. P. BERTSEKAS, On the convergence of the exponential multiplier method for convex programming, Math. Program., 60 (1993), pp. 1-19.