Fetching the paper…
Reading the bibliography…
In this paper, we study the problem of escaping from saddle points in smooth nonconvex optimization problems subject to a convex set $\mathcal{C}$.
Fast incremental method for smooth nonconvex optimization
Sashank J. Reddi, Suvrit Sra, Barnabás Póczos, and Alexander J. Smola · 1977
Earlier work this paper cites.
Some np-complete problems in quadratic and nonlinear programming
Katta G Murty and Santosh N Kabadi · 1987
Earlier work this paper cites.
Convergence properties of trust region methods for linear and convex constraints
James V Burke, Jorge J Moré, and Gerardo Toraldo · 1990
Earlier work this paper cites.
On affine scaling algorithms for nonconvex quadratic programming
Yinyu Ye · 1992
Earlier work this paper cites.
Global convergence of a class of trust region algorithms for optimization using inexact projections on convex constraints
Andrew R Conn, Nick Gould, Annick Sartenaer, and Ph Toint · 1993
Earlier work this paper cites.
Convergence to second order stationary points in inequality constrained optimization
Francisco Facchinei and Stefano Lucidi · 1998
Earlier work this paper cites.
Approximation algorithms for quadratic programming
Minyue Fu, Zhi-Quan Luo, and Yinyu Ye · 1998
Earlier work this paper cites.
Nonlinear programming
Dimitri P Bertsekas · 1999
Earlier work this paper cites.
Further results on approximating nonconvex quadratic optimization by semidefinite programming relaxation
Paul Tseng · 2003
Earlier work this paper cites.
Convergence to second-order stationary points of a primal-dual algorithm model for nonlinear programming
Gianni Di Pillo, Stefano Lucidi, and Laura Palagi · 2005
Earlier work this paper cites.
Cubic regularization of newton method and its global performance
Yurii Nesterov and Boris T. Polyak · 2006
Earlier work this paper cites.
On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
Coralia Cartis, Nicholas Gould, and Philippe Toint · 2013
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course , volume 87
Yurii Nesterov · 2013
Cited alongside, same era.
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
Vaithilingam Jeyakumar and GY Li · 2014
Cited alongside, same era.
Complexity analysis of interior point algorithms for non-lipschitz and nonconvex minimization
Wei Bian, Xiaojun Chen, and Yinyu Ye · 2015
Cited alongside, same era.
On the evaluation complexity of constrained nonlinear least-squares and general constrained nonlinear optimization using second-order methods
Coralia Cartis, Nicholas Gould, and Philippe Toint · 2015
Cited alongside, same era.
Escaping from saddle points - online stochastic gradient for tensor decomposition
Rong Ge, Furong Huang, Chi Jin, and Yang Yuan · 2015
Cited alongside, same era.
Finding approximate local minima faster than gradient descent
Naman Agarwal, Zeyuan Allen Zhu, Brian Bullins, Elad Hazan, and Tengyu Ma · 2017
Later among the works it cites.
Natasha 2: Faster non-convex optimization than SGD
Zeyuan Allen-Zhu · 2017
Later among the works it cites.
Second-order optimality and beyond: Characterization and evaluation complexity in convexly constrained nonlinear optimization
Coralia Cartis, Nick Gould, and Philippe Toint · 2017
Later among the works it cites.
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
Gabriel Haeser, Hongcheng Liu, and Yinyu Ye · 2017
Later among the works it cites.
Non-convex finite-sum optimization via SCSG methods
Lihua Lei, Cheng Ju, Jianbo Chen, and Michael I. Jordan · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Variance reduction for faster non-convex optimization
Zeyuan Allen Zhu and Elad Hazan · 2016
Cited alongside, same era.
Accelerated methods for non-convex optimization
Yair Carmon, John C. Duchi, Oliver Hinder, and Aaron Sidford · 2016
Cited alongside, same era.
Matrix completion has no spurious local minimum
Rong Ge, Jason Lee, and Tengyu Ma · 2016
Cited alongside, same era.
Accelerated gradient methods for nonconvex nonlinear and stochastic programming
Saeed Ghadimi and Guanghui Lan · 2016
Cited alongside, same era.
Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
Saeed Ghadimi, Guanghui Lan, and Hongchao Zhang · 2016
Cited alongside, same era.
Convergence rate of Frank-Wolfe for non-convex objectives
Simon Lacoste-Julien · 2016
Cited alongside, same era.
A geometric analysis of phase retrieval
Ju Sun, Qing Qu, and John Wright · 2016
Cited alongside, same era.
Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
José Mario Martínez and Marcos Raydan · 2017
Later among the works it cites.
A second order method for nonconvex optimization
Santiago Paternain, Aryan Mokhtari, and Alejandro Ribeiro · 2017
Later among the works it cites.
Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization
Clément W Royer and Stephen J Wright · 2017
Later among the works it cites.
Complete dictionary recovery over the sphere I: overview and the geometric picture
Ju Sun, Qing Qu, and John Wright · 2017
Later among the works it cites.
First-order stochastic algorithms for escaping from saddle points in almost linear time
Yi Xu and Tianbao Yang · 2017
Later among the works it cites.
A generic approach for escaping saddle points
Sashank J. Reddi, Manzil Zaheer, Suvrit Sra, Barnabás Póczos, Francis Bach, Ruslan Salakhutdinov, and Alexander J. Smola · 2018
Closest in time.