Abstract. We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f (x)+Q(x, y)+g(y), where f : R n → R∪{+∞} and g : R m → R∪{+∞} are proper lower semicontinuous functions, and Q : R n × R m → R is a smooth C 1 function which couples the variables x and y. The algorithm can be viewed as a proximal regularization of the usual Gauss-Seidel method to minimize L. We work in a nonconvex setting, just assuming that the function L satisfies the Kurdyka-Lojasiewicz inequality. An entire section illustrates the relevancy of such an assumption by giving examples ranging from semialgebraic geometry to "metrically regular" problems. Our main result can be stated as follows: If L has the Kurdyka-Lojasiewicz property, then each bounded sequence generated by the algorithm converges to a critical point of L. This result is completed by the study of the convergence rate of the algorithm, which depends on the geometrical properties of the function L around its critical points. When specialized to Q(x, y) = x − y 2 and to f , g indicator functions, the algorithm is an alternating projection mehod (a variant of Von Neumann's) that converges for a wide class of sets including semialgebraic and tame sets, transverse smooth manifolds or sets with "regular "intersection. In order to illustrate our results with concrete problems, we provide a convergent proximal reweighted ℓ 1 algorithm for compressive sensing and an application to rank reduction problems.
An alternating proximal algorithm was considered in REF , and the convergence was proved under Kurdyka-Lojasiewicz assumption on the objective function.
Proximal alternating minimization and projection methods for nonconvex problems . An approach based on the Kurdyka-Lojasiewicz inequality
Math. Oper. Res.
Math. Oper. Res.
Mathematics Computer Science