1.
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods
by Attouch, Hedy
Mathematical programming, 2011-08-20, Vol.137 (1-2), p.91-129
2.
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
by Bolte, Jérôme
Mathematical programming, 2013-07-26, Vol.146 (1-2), p.459-494
3.
On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
by Attouch, Hedy
Mathematical programming, 2007-05-04, Vol.116 (1-2), p.5-16
4.
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
by Attouch, Hédy
Mathematics of operations research, 2010-05-01, Vol.35 (2), p.438-457
5.
The multiproximal linearization method for convex composite problems
by Bolte, Jérôme
Mathematical programming, 2019-03-22, Vol.182 (1-2), p.1-36
6.
From error bounds to the complexity of first-order descent methods for convex functions
by Bolte, Jérôme
Mathematical programming, 2016-11-30, Vol.165 (2), p.471-507
7.
Generic Optimality Conditions for Semialgebraic Convex Programs
by Bolte, Jérôme
Mathematics of operations research, 2011-02, Vol.36 (1), p.55-70
8.
Tame functions are semismooth
by Bolte, Jérôme
Mathematical programming, 2007-07-21, Vol.117 (1-2), p.5-19
9.
Asymptotic expansions for interior penalty solutions of control constrained linear-quadratic problems
by Álvarez, Felipe
Mathematical programming, 2011-07-29, Vol.135 (1-2), p.473-507
10.
