Fetching the paper…
Reading the bibliography…
We consider optimization algorithms that successively minimize simple Taylor-like models of the objective function.
An algorithm for least-squares estimation of nonlinear parameters
D.W. Marquardt · 1963
Earlier work this paper cites.
Régularisation d’inéquations variationnelles par approximations successives
B. Martinet · 1970
Earlier work this paper cites.
Détermination approchée d’un point fixe d’une application pseudo-contractante. Cas de l’application prox
B Martinet · 1972
Earlier work this paper cites.
On the variational principle
I. Ekeland · 1974
Earlier work this paper cites.
Monotone operators and the proximal point algorithm
R.T. Rockafellar · 1976
Earlier work this paper cites.
Optimization of Lipschitz continuous functions
A.A. Goldstein · 1977
Earlier work this paper cites.
A model algorithm for composite nondifferentiable optimization problems
R. Fletcher · 1980
Earlier work this paper cites.
Proximal subgradients, marginal values, and augmented Lagrangians in nonconvex optimization
R.T. Rockafellar · 1981
Earlier work this paper cites.
A method for solving the convex programming problem with convergence rate O ( 1 / k 2 ) O(1/k^{2})
Yu. Nesterov · 1983
Earlier work this paper cites.
General algorithms for discrete nonlinear approximation calculations
M.J.D. Powell · 1983
Earlier work this paper cites.
On the global convergence of trust region algorithms for unconstrained minimization
M.J.D. Powell · 1984
Earlier work this paper cites.
Descent methods for composite nondifferentiable optimization problems
J.V. Burke · 1985
Earlier work this paper cites.
On the superlinear convergence of a trust region algorithm for nonsmooth optimization
Y. Yuan · 1985
Earlier work this paper cites.
Convergence of an inexact algorithm for composite nonsmooth optimization
S.J. Wright · 1990
Earlier work this paper cites.
Error bounds and convergence analysis of feasible descent methods: a general approach
Z.-Q. Luo and P. Tseng · 1993
Earlier work this paper cites.
Prox-regular functions in variational analysis
R.A. Poliquin and R.T. Rockafellar · 1996
Earlier work this paper cites.
Nonsmooth Analysis and Control Theory
F.H. Clarke, Yu. Ledyaev, R.I. Stern, and P.R. Wolenski · 1998
Cited alongside, same era.
On gradients of functions definable in o-minimal structures
K. Kurdyka · 1998
Cited alongside, same era.
Metric regularity and subdifferential calculus
A.D. Ioffe · 2000
Cited alongside, same era.
Nonsmooth equations in optimization
D. Klatte and B. Kummer · 2002
Cited alongside, same era.
A robust gradient sampling algorithm for nonsmooth, nonconvex optimization
J.V. Burke, A.S. Lewis, and M.L. Overton · 2005
Cited alongside, same era.
Excessive gap technique in nonsmooth convex minimization
Yu. Nesterov · 2005
Cited alongside, same era.
Gradient methods for minimizing composite functions
Yu. Nesterov · 2013
Later among the works it cites.
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
J. Bolte, S. Sabach, and M. Teboulle · 2014
Later among the works it cites.
Second-order growth, tilt stability, and metric regularity of the subdifferential
D. Drusvyatskiy, B.S. Mordukhovich, and T.T.A. Nghia · 2014
Later among the works it cites.
Solving Derivative-Free Nonlinear Least Squares Problems with POUNDERS
S.M. Wild · 2014
Later among the works it cites.
From error bounds to the complexity of first order descent methods for convex functions
J. Bolte, T.P. Nguyen, J. Peypouquet, and B. Suter · 2015
Later among the works it cites.
Quadratic growth and critical point stability of semi-algebraic functions
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Y. Nesterov and B.T. Polyak · 2006
Cited alongside, same era.
Numerical optimization
J. Nocedal and S.J. Wright · 2006
Cited alongside, same era.
Clarke subgradients of stratifiable functions
J. Bolte, A. Daniilidis, A.S. Lewis, and M. Shiota · 2007
Cited alongside, same era.
Characterization of metric regularity of subdifferentials
F.J. Aragón Artacho and M.H. Geoffroy · 2008
Cited alongside, same era.
Accelerating the cubic regularization of Newton’s method on convex problems
Yu. Nesterov · 2008
Cited alongside, same era.
A proximity control algorithm to minimize nonsmooth and nonconvex functions
D. Noll, O. Prot, and A. Rondepierre · 2008
Cited alongside, same era.
D. Drusvyatskiy and A.D. Ioffe · 2015
Later among the works it cites.
Curves of descent
D. Drusvyatskiy, A.D. Ioffe, and A.S. Lewis · 2015
Later among the works it cites.
Transversality and alternating projections for nonconvex sets
D. Drusvyatskiy, A.D. Ioffe, and A.S. Lewis · 2015
Later among the works it cites.
Linear convergence of gradient and proximal-gradient methods under the Polyak-łojasiewicz condition
H. Karimi, J. Nutini, and M. Schmidt · 2015
Later among the works it cites.
A proximal method for composite minimization
A.S. Lewis and S.J. Wright · 2015
Later among the works it cites.
An inexact successive quadratic approximation method for l-1 regularized optimization
R.H. Byrd, J. Nocedal, and F. Oztoprak · 2016
Closest in time.
An accelerated algorithm for minimizing convex compositions
D. Drusvyatskiy and C. Kempton · 2016
Closest in time.
Error bounds, quadratic growth, and linear convergence of proximal methods
D. Drusvyatskiy and A.S. Lewis · 2016
Closest in time.
Accelerated gradient methods for nonconvex nonlinear and stochastic programming
S. Ghadimi and G. Lan · 2016
Closest in time.
Practical inexact proximal quasi-newton method with global complexity analysis
K. Scheinberg and X. Tang · 2016
Closest in time.