Fetching the paper…
Reading the bibliography…
The idea of partial smoothness in optimization blends certain smooth and nonsmooth properties of feasible regions and objective functions.
Projected gradient methods for linearly constrained problems
P.H. Calamai and J.J. Moré · 1987
Earlier work this paper cites.
On the convergence of projected gradient processes to singular critical points
J.C. Dunn · 1987
Earlier work this paper cites.
On the identification of active constraints
J.V. Burke and J.J. Moré · 1988
Earlier work this paper cites.
On the identification of active constraints. II. The nonconvex case
J.V. Burke · 1990
Earlier work this paper cites.
Finite convergence of algorithms for nonlinear programs and variational inequalities
F. Al-Khayyal and J. Kyparisis · 1991
Earlier work this paper cites.
Finite termination of the proximal point algorithm
M.C. Ferris · 1991
Earlier work this paper cites.
On finite convergence and constraint identification of subgradient projection methods
S.D. Flåm · 1992
Earlier work this paper cites.
Identifiable surfaces in constrained optimization
S.J. Wright · 1993
Earlier work this paper cites.
Practical aspects of the Moreau-Yosida regularization: theoretical preliminaries
C. Lemaréchal and C. Sagastizábal · 1997
Earlier work this paper cites.
Variational Analysis
R.T. Rockafellar and R.J-B. Wets · 1998
Cited alongside, same era.
The U-lagrangian of a convex function
C. Lemaréchal, F. Oustry, and C. Sagastizábal · 2000
Cited alongside, same era.
Active sets, nonsmoothness, and sensitivity
A.S. Lewis · 2002
Cited alongside, same era.
Proximal points are on the fast track
R. Mifflin and C. Sagastizábal · 2002
Cited alongside, same era.
Introduction to Smooth Manifolds
J.M. Lee · 2003
Cited alongside, same era.
Primal-dual gradient structured functions: second-order results; links to epi-derivatives and partly smooth functions
R. Mifflin and C. Sagastizábal · 2003
Cited alongside, same era.
A first-order primal-dual algorithm for convex problems with applications to imaging
A. Chambolle and T. Pock · 2011
Later among the works it cites.
Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
B. He and X. Yuan · 2012
Later among the works it cites.
A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
L. Condat · 2013
Later among the works it cites.
Partial smoothness, tilt stability, and generalized Hessians
A.S. Lewis and S. Zhang · 2013
Later among the works it cites.
A splitting algorithm for dual monotone inclusions involving cocoercive operators
B. C. Vũ · 2013
Later among the works it cites.
Optimality, identifiability, and sensitivity
D. Drusvyatskiy and A.S. Lewis · 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Mifflin and C. Sagastizábal · 2004
Cited alongside, same era.
A 𝒱𝒰 \cal{VU} -algorithm for convex minimization
R. Mifflin and C. Sagastizábal · 2005
Cited alongside, same era.
Computing proximal points of nonconvex functions
W. Hare and C. Sagastizábal · 2009
Cited alongside, same era.
Later among the works it cites.
Optimality, identifiability, and sensitivity
D. Drusvyatskiy and A.S. Lewis · 2014
Later among the works it cites.
A proximal method for composite minimization
A.S. Lewis and S.J. Wright · 2016
Later among the works it cites.
Local linear convergence analysis of primal-dual splitting methods
J. Liang, J. Fadili, and G. Peyré · 2018
Closest in time.