Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the kurdyka-lojasiewicz inequality

Mathematics of Operations Research

Volumn 35, Issue 2, 2010, Pages 438-457

  Attouch, Hédy ^a   Bolte, Jérôme ^b   Redont, Patrick ^a   Soubeyran, Antoine ^c  

^a UNIVERSITÉ DE MONTPELLIER   (France)

^b SORBONNE UNIVERSITÉ   (France)

^c Centre National de la Recherche Scientifique   (France)

Author keywords

Alternating minimization algorithms; Alternating projections algorithms; Convergence rate; Finite; Kurdyka Lojasiewicz inequality; Nonconvex optimization; O minimal structures; Proximal algorithms; Tame optimization

Indexed keywords

ALTERNATING MINIMIZATION ALGORITHMS; ALTERNATING PROJECTIONS; ALTERNATING PROJECTIONS ALGORITHMS; CONVERGENCE RATES; NONCONVEX OPTIMIZATION; O-MINIMAL STRUCTURE; O-MINIMAL STRUCTURES; PROXIMAL ALGORITHM;

ALGORITHMS; COMPUTERIZED TOMOGRAPHY; EQUATIONS OF STATE; OPTIMIZATION;

CONVERGENCE OF NUMERICAL METHODS;

EID: 77953092582     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1100.0449     Document Type: Article

References (49)

1. Absil, P.-A., R. Mahony, B. Andrews. 2005. Convergence of the iterates of descent methods for analytic cost functions. SIAM J. Optim. 16(2) 31-547.
2. Absil, P.-A., R. Mahony, R. Sepulchre. 2008. Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton, NJ.
3. Attouch, H., J. Bolte. 2009. On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Programming Ser. B 116(1-2) 5-16.
4. Attouch, H., A. Soubeyran. 2006. Inertia and reactivity in decision making as cognitive variational inequalities. J. Convex Anal. 13(2) 207-224.
5. Attouch, H., P. Redont, A. Soubeyran. 2007. A new class of alternating proximal minimization algorithms with costs to move. SIAM J. Optim. 18(3) 1061-1081.
6. Attouch, H., J. Bolte, P. Redont, A. Soubeyran. 2008. Alternating proximal algorithms for weakly coupled convex minimization problems. Applications to dynamical games and PDE's. J. Convex Anal. 15(3) 485-506.
7. Aubin, J.-P., I. Ekeland. 1984. Applied Nonlinear Analysis. John Wiley & Sons, New York.
8. Auslender, A. 1976. Optimisation, Methodes Numeriques. Masson, Paris.
9. Bauschke, H. H., J. M. Borwein. 1996. On projection algorithms for solving convex feasibility problems. SIAM Rev. 38(3) 367-426.
10. Bauschke, H. H., P. L. Combettes, D. Noll. 2006. Joint minimization with alternating Bregman proximity operators. Pacific J. Optim. 2(3) 401-424.
11. Benedetti, R., J.-J. Risler. 1990. Real Algebraic and Semialgebraic Sets. Hermann, Éditeur des Sciences et des Arts, Paris.
12. Bertsekas, D. 1999. Nonlinear Optimisation, 2nd ed. Athena, Belmont, MA.
13. Bochnak, J., M. Coste, M.-F. Roy. 1998. Real Algebraic Geometry. Ergebrisse der Mathematik und ihser Grenzgebiete, Vol.36. Springer, Berlin.
14. Bolte, J., A. Daniilidis, A. Lewis. 2006. The Lojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17(4) 1205-1223.
15. Bolte, J., A. Daniilidis, A. Lewis. 2006. A nonsmooth Morse-Sard theorem for subanalytic functions. J. Math. Anal. Appl. 321(2) 729-740.
16. Bolte, J., A. Daniilidis, A. Lewis, M. Shiota. 2007. Clarke subgradients of stratifiable functions. SIAM J. Optim. 18(2) 556-572.
17. Bolte, J., A. Daniilidis, O. Ley, L. Mazet. 2010. Characterizations of Lojasiewicz inequalities and applications: Subgradient flows, talweg, convexity. Trans. Amer. Math. Soc. 362 3319-3363.
18. Bruckstein, A., D. Donoho, M. Elad. 2009. From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev. 51(1) 34-81.
19. Byrne, C., Y. Censor. 2001. Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback-Leibler distance minimization. Ann. Oper. Res. 105(1-4) 77-98.
20. Candès, E., M. Wakin, S. Boyd. 2008. Enhancing sparsity by reweighting ℓ1 minimization. J. Fourier Anal. Appl. 14(5) 877-905.
21. Combettes, P. L. 1993. Signal recovery by best feasible approximation. IEEE Trans. Image Processing 2(2) 269-271.
22. Combettes, P. L., T. Pennanen. 2004. Proximal methods for cohypomonotone operators. SIAM J. Control Optim. 43(2) 731-742.
23. Combettes, P. L., V. Wajs. 2005. Signal recovery by proximal forward-backward splitting. Multiscale Model. Simulation 4(4) 1168-1200.
24. Csiszár, I., G. Tusnády. 1984. Information geometry and alternating minimization procedures. Statist. Decisions (Suppl. 1) 205-237.
25. Denkowska, Z., J. Stasica. 2008. Ensembles Sous-Analytiques à la Polonaise, Travaux en Cours, Vol.69. Hermann, Paris.
26. Donoho, D. L. 2006. Compressed sensing. IEEE Trans. Inform. Theory 4 1289-1306.
27. Edelman, A., A. Arias, S. T. Smith. 1999. The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20(2) 303-353.
28. Hare, W, C. Sagastizábal. 2009. Computing proximal points of nonconvex functions. Math. Program. Ser. B 116(1-2) 221-258.
29. Gabrielov, A. 1996. Complements of subanalytic sets and existential formulas for analytic functions. Inventiones Math. 125(1) 1-12.
30. Grubisić, I., R. Pietersz. 2007. Efficient rank reduction of correlation matrices. Linear Algebra Its Appl. 422(2-3) 629-653.
31. Ioffe, A. D. 2000. Metric regularity and subdifferential calculus. (Russian) Uspekhi Mat. Nauk 55(3) (333) 103-162.
32. Translation in 2000. Russian Math. Surveys 55 501-558.
33. Iusem, A. N., T. Pennanen, B. F. Svaiter. 2003. Inexact variants of the proximal point algorithm without monotonicity. SIAM J. Optim. 13(4) 1080-1097.
34. Kurdyka, K. 1998. On gradients of functions definable in o-minimal structures. Ann. Inst. Fourier 48(3) 769-783.
35. Lewis, A. S., J. Malick. 2008. Alternating projection on manifolds. Math. Oper. Res. 33(1) 216-234.
36. Lewis, A. S., D. R. Luke, J. Malick. 2009. Local linear convergence for alternating and averaged nonconvex projections. Foundations Computational Math. 9(4) 485-513.
37. Lions, P. L. 1990. On the Schwarz alternating method. III. A variant for nonoverlapping subdomains. T. F. Chan, R. Glowinski, J. Périaux, O. Widlund, eds. Third Internat. Sympos. Domain Decomposition Methods for Partial Differential Equations, SIAM, Philadelphia, 202-231.
38. Lojasiewicz, S. 1963. Une propriété topologique des sous-ensembles analytiques réels. Les Équations aux Dérivées Partielles. Éditions du centre National de la Recherche Scientifique, Paris, 87-89.
39. Lojasiewicz, S. 1993. Sur la géométrie semi- et sous-analytique. Ann. Inst. Fourier 43 1575-1595.
40. Luke, D. R. Finding best approximation pairs relative to a convex and prox-regular set in a Hilbert space. SIAM J. Optim. 19(2) 714-739.
41. Mordukhovich, B. 2006. Variational analysis and generalized differentiation. I. basic theory. Grundlehren der Mathematischen Wissenschaften, Vol.330. Springer-Verlag, Berlin.
42. Nesterov, Yu. 2004. Introductory lectures on convex optimization. A basic course. Applied Optimization, Vol.87. Kluwer Academic Publishers, Boston.
43. Rockafellar, R. T., R. Wets. 1998. Variational analysis. Grundlehren der Mathematischen Wissenschaften, Vol.317. Springer, Berlin.
44. Shiota, M. 1997. Geometry of subanalytic and semialgebraic sets. Progress in Mathematics, Vol.150. Birkhäuser, Boston.
45. Tseng, P. 2001. Convergence of a block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 109(3) 475-494.
46. van den Dries, L. 1998. Tame topology and o-minimal structures. London Mathematical Society, Vol.248, Lecture Note Series. Cambridge University Press, Cambridge, UK.
47. von Neumann, J. 1950. Functional operators. Annals ofMathematics Studies, Vol.22. Princeton University Press, Princeton, NJ.
48. Widrow, B., E. Wallach. 1996. Adaptive Inverse Control. Prentice-Hall, Englewood Cliffs, NJ.
49. Wilkie, A. J. 1996. Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function. J. Amer. Math. Soc. 9(4) 1051-1094.