Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
DOI10.1287/moor.1100.0449zbMath1214.65036arXiv0801.1780MaRDI QIDQ3169101
Jérôme Bolte, Patrick Redont, Hedy Attouch, Antoine Soubeyran
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0801.1780
regularization; critical point; nonconvex optimization; convergence rate; Gauss-Seidel method; gradient systems; Kurdyka-Łojasiewicz inequality; o-minimal structures; sparse reconstruction; proximal algorithms; tame optimization; alternating minimization algorithms; finite convergence time; alternating projections algorithms
90C26: Nonconvex programming, global optimization
65K10: Numerical optimization and variational techniques
49J52: Nonsmooth analysis
49M27: Decomposition methods
Related Items