Proximal alternating linearized minimization for nonconvex and nonsmooth problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Mathematical Programming Year : 2014

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

Abstract

We introduce a proximal alternating linearized minimization (PALM) algorithm for solving a broad class of nonconvex and nonsmooth minimization problems. Building on the powerful Kurdyka-Łojasiewicz property, we derive a self-contained convergence analysis framework and establish that each bounded sequence generated by PALM globally converges to a critical point. Our approach allows to analyze various classes of nonconvex-nonsmooth problems and related nonconvex proximal forward-backward algorithms with semi-algebraic problem's data, the later property being shared by many functions arising in a wide variety of fundamental applications. A by-product of our framework also shows that our results are new even in the convex setting. As an illustration of the results, we derive a new and simple globally convergent algorithm for solving the sparse nonnegative matrix factorization problem.
No file

Dates and versions

hal-00916090 , version 1 (09-12-2013)

Identifiers

Cite

Jerome Bolte, Shoham Sabach, Marc Teboulle. Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Mathematical Programming, 2014, 146 (1-2), pp.459-494. ⟨10.1007/s10107-013-0701-9⟩. ⟨hal-00916090⟩
853 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More