Fetching the paper…
Reading the bibliography…
We propose ZeroFPR, a nonmonotone linesearch algorithm for minimizing the sum of two nonconvex functions, one of which is smooth and the other possibly nonsmooth.
Une propriété topologique des sous-ensembles analytiques réels
Stanislaw Łojasiewicz · 1963
Earlier work this paper cites.
A class of methods for solving nonlinear simultaneous equations
Charles G. Broyden · 1965
Earlier work this paper cites.
Brève communication. Régularisation d’inéquations variationnelles par approximations successives
B. Martinet · 1970
Earlier work this paper cites.
A hybrid method for nonlinear equations
M. Powell · 1970
Earlier work this paper cites.
A characterization of superlinear convergence and its application to quasi-Newton methods
John E. Dennis and Jorge J. Moré · 1974
Earlier work this paper cites.
Updating quasi-Newton matrices with limited storage
Jorge Nocedal · 1980
Earlier work this paper cites.
First- and second-order epi-differentiability in nonlinear programming
R. Tyrrell Rockafellar · 1988
Earlier work this paper cites.
A tool for the analysis of quasi-Newton methods with application to unconstrained minimization
Richard H. Byrd and Jorge Nocedal · 1989
Earlier work this paper cites.
On the limited memory BFGS method for large scale optimization
Dong C. Liu and Jorge Nocedal · 1989
Earlier work this paper cites.
Second-order optimality conditions in nonlinear programming obtained by way of epi-derivatives
R. Tyrrell Rockafellar · 1989
Earlier work this paper cites.
Local convergence of quasi-Newton methods for B-differentiable equations
Chi-Ming Ip and Jerzy Kyparisis · 1992
Earlier work this paper cites.
Amenable functions in optimization
René A. Poliquin and R. Tyrrell Rockafellar · 1992
Earlier work this paper cites.
Sur la géométrie semi- et sous- analytique
Stanislaw Łojasiewicz · 1993
Earlier work this paper cites.
Nonlinear Programming
Dimitri P. Bertsekas · 1995
Earlier work this paper cites.
Second-order nonsmooth analysis in nonlinear programming
René A Poliquin and R. Tyrrell Rockafellar · 1995
Earlier work this paper cites.
Generalized Hessian properties of regularized nonsmooth functions
RA Poliquin and RT Rockafellar · 1996
Earlier work this paper cites.
Prox-regular functions in variational analysis
René A Poliquin and R. Tyrrell Rockafellar · 1996
Cited alongside, same era.
Real Algebraic Geometry
J. Bochnak, M. Coste, and M-F. Roy · 1998
Cited alongside, same era.
Proximal point methods and nonconvex optimization
A. Kaplan and R. Tichatschke · 1998
Cited alongside, same era.
On gradients of functions definable in o-minimal structures
Krzysztof Kurdyka · 1998
Cited alongside, same era.
Active sets, nonsmoothness, and sensitivity
A. S. Lewis · 2002
Cited alongside, same era.
A nonmonotone line search technique and its application to unconstrained optimization
Hongchao Zhang and William W. Hager · 2004
Cited alongside, same era.
l 1 / 2 l_{1/2} regularization: a thresholding representation theory and a fast solver
Zongben Xu, Xiangyu Chang, Fengmin Xu, and Hai Zhang · 2012
Later among the works it cites.
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized gauss–seidel methods
Hedy Attouch, Jérôme Bolte, and Benar Fux Svaiter · 2013
Later among the works it cites.
Gradient Methods for Minimizing Composite Functions
Yuri Nesterov · 2013
Later among the works it cites.
Proximal Newton methods for convex composite optimization
Panagiotis Patrinos and Alberto Bemporad · 2013
Later among the works it cites.
Local convergence of quasi-Newton methods under metric regularity
F. J. Aragón Artacho, A. Belyakov, A. L. Dontchev, and M. López · 2014
Later among the works it cites.
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
Michal Aharon, Michael Elad, and Alfred Bruckstein · 2006
Cited alongside, same era.
Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems
Aris Daniilidis, Warren Hare, and Jérôme Malick · 2006
Cited alongside, same era.
Numerical Optimization
Jorge Nocedal and Stephen Wright · 2006
Cited alongside, same era.
The Łojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems
Jérôme Bolte, Aris Daniilidis, and Adrian Lewis · 2007
Cited alongside, same era.
On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
Hedy Attouch and Jérôme Bolte · 2009
Cited alongside, same era.
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Amir Beck and Marc Teboulle · 2009
Cited alongside, same era.
Jérôme Bolte, Shoham Sabach, and Marc Teboulle · 2014
Later among the works it cites.
iPiano: Inertial proximal algorithm for nonconvex optimization
Peter Ochs, Yunjin Chen, Thomas Brox, and Thomas Pock · 2014
Later among the works it cites.
Splitting methods with variable metric for kurdyka–łojasiewicz functions and general convergence rates
Pierre Frankel, Guillaume Garrigos, and Juan Peypouquet · 2015
Later among the works it cites.
Accelerated proximal gradient methods for nonconvex programming
Huan Li and Zhouchen Lin · 2015
Later among the works it cites.
The rate of convergence of Nesterov’s accelerated forward-backward method is actually faster than 1 / k 2 1/k^{2}
Hedy Attouch and Juan Peypouquet · 2016
Closest in time.
On the minimization over sparse symmetric sets: Projections, optimality conditions, and algorithms
Amir Beck and Nadav Hallak · 2016
Closest in time.
Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
Jérôme Bolte and Edouard Pauwels · 2016
Closest in time.
An inertial forward–backward algorithm for the minimization of the sum of two nonconvex functions
Radu Ioan Boţ, Ernö Robert Csetnek, and Szilárd Csaba László · 2016
Closest in time.
Further properties of the forward–backward envelope with applications to difference-of-convex programming
Tianxiang Liu and Ting Kei Pong · 2017
Closest in time.
Forward–backward quasi-Newton methods for nonsmooth optimization problems
Lorenzo Stella, Andreas Themelis, and Panagiotis Patrinos · 2017
Closest in time.