Fetching the paper…
Reading the bibliography…
This paper proposes low-complexity algorithms for finding approximate second-order stationary points (SOSPs) of problems with smooth non-convex objective and linear constraints.
E. M. Gafni and D. P. Bertsekas, “Two-metric projection methods for constrained optimization,” SIAM Journal on Control and Optimization
1984
Earlier work this paper cites.
K. G. Murty and S. N. Kabadi, “Some np-complete problems in quadratic and nonlinear programming,” Mathematical programming
1987
Earlier work this paper cites.
A. R. Conn, N. I. M. Gould, and P. L. Toint, “Global convergence of a class of trust region algorithms for optimization with simple bounds,” SIAM Journal on Numerical Analysis
1989
Earlier work this paper cites.
M. Lescrenier, “Convergence of trust region algorithms for optimization with bounds when strict complementarity does not hold,” SIAM Journal on Numerical Analysis
1991
Earlier work this paper cites.
J. J. Hull, “A database for handwritten text recognition research,” IEEE Transactions on Pattern Analysis and Machine Intelligence
1994
Earlier work this paper cites.
A. Nemirovski, “Information-based complexity of convex programming,” Lecture Notes
1995
Earlier work this paper cites.
F. Facchinei, A. Fischer, and C. Kanzow, “On the accurate identification of active constraints,” SIAM Journal on Optimization
1998
Earlier work this paper cites.
F. Facchinei and S. Lucidi, “Convergence to second order stationary points in inequality constrained optimization,” Mathematics of Operations Research
1998
Earlier work this paper cites.
D. D. Lee and H. S. Seung, “Learning the parts of objects by non-negative matrix factorization,” Nature
1999
Earlier work this paper cites.
Belmont, MA: Athena Scientific, 1999
D. P. Bertsekas, Nonlinear Programming, 2nd ed · 1999
Earlier work this paper cites.
C.-J. Lin and J. J. Moré, “Newton’s method for large bound-constrained optimization problems,” SIAM Journal on Optimization
1999
Earlier work this paper cites.
SIAM, 2000
A. R. Conn, N. I. M. Gould, and P. L. Toint, Trust region methods · 2000
Earlier work this paper cites.
G. Di Pillo, S. Lucidi, and L. Palagi, “Convergence to second-order stationary points of a primal-dual algorithm model for nonlinear programming,” Mathematics of Operations Research
2005
Earlier work this paper cites.
S. Burer and A. N. Letchford, “On nonconvex quadratic programming with box constraints,” SIAM Journal on Optimization
2009
Earlier work this paper cites.
R. Andreani, E. G. Birgin, J. M. Martínez, and M. L. Schuverdt, “Second-order negative-curvature methods for box-constrained and general constrained optimization,” Computational Optimization and Applications
2010
Cited alongside, same era.
Academic Press, 2014
D. P. Bertsekas, Constrained optimization and Lagrange multiplier methods · 2014
Cited alongside, same era.
R. Ge, F. Huang, C. Jin, and Y. Yuan, “Escaping from saddle points—online stochastic gradient for tensor decomposition,” in Proceedings of Annual Conference on Learning Theory (COLT)
2015
Cited alongside, same era.
J. Chorowski and J. M. Zurada, “Learning understandable neural networks with nonnegative weight constraints,” IEEE Transactions on Neural Networks and Learning Systems
2015
Cited alongside, same era.
K. Kawaguchi, “Deep learning without poor local minima,” in Proceedings of Neural Information Processing Systems (NIPS)
Y. Carmon, J. C. Duchi, O. Hinder, and A. Sidford, “Accelerated methods for nonconvex optimization,” SIAM Journal on Optimization
2018
Later among the works it cites.
Y. Xu, J. Rong, and T. Yang, “First-order stochastic algorithms for escaping from saddle points in almost linear time,” in Proceedings of Neural Information Processing Systems (NeurIPS)
2018
Later among the works it cites.
Z. Allen-Zhu and Y. Li, “Neon2: Finding local minima via first-order oracles,” in Proceedings of Neural Information Processing Systems (NeurIPS)
2018
Later among the works it cites.
M. Hong, J. D. Lee, and M. Razaviyayn, “Gradient primal-dual algorithm converges to second-order stationary solutions for nonconvex distributed optimization,” in Proceedings of International Conference on Machine Learning (ICML)
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
J. D. Lee, M. Simchowitz, M. I. Jordan, and B. Recht, “Gradient descent only converges to minimizers,” in Proceedings of Annual Conference on Learning Theory (COLT)
2016
Cited alongside, same era.
J. Sun, Q. Qu, and J. Wright, “A geometric analysis of phase retrieval,” arXiv:1602.06664 [cs.IT]
2017
Cited alongside, same era.
R. Ge, C. Jin, and Y. Zheng, “No spurious local minima in nonconvex low rank problems: A unified geometric analysis,” in Proceedings of International Conference on Machine Learning (ICML)
2017
Cited alongside, same era.
N. Agarwal, Z. Allen-Zhu, B. Bullins, E. Hazan, and T. Ma, “Finding approximate local minima faster than gradient descent,” in Proceedings of Annual ACM Symposium on the Theory of Computing (STOC)
2017
Cited alongside, same era.
C. Jin, R. Ge, P. Netrapalli, S. M. Kakade, and M. I. Jordan, “How to escape saddle points efficiently,” in Proceedings of International Conference on Machine Learning (ICML)
2017
Cited alongside, same era.
D. Goldfarb, C. Mu, J. Wright, and C. Zhou, “Using negative curvature in solving nonlinear programs,” Computational Optimization and Applications
2017
Cited alongside, same era.
N. D. Sidiropoulos, L. De Lathauwer, X. Fu, K. Huang, E. E. Papalexakis, and C. Faloutsos, “Tensor decomposition for signal processing and machine learning,” IEEE Transactions on Signal Processing
2017
Cited alongside, same era.
C. Cartis, N. I. Gould, and P. L. Toint, “Second-order optimality and beyond: Characterization and evaluation complexity in convexly constrained nonlinear optimization,” Foundations of Computational Mathematics
2018
Later among the works it cites.
2018
Later among the works it cites.
A. Mokhtari, A. Ozdaglar, and A. Jadbabaie, “Escaping saddle points in constrained optimization,” in Proceedings of Neural Information Processing Systems (NeurIPS)
2018
Later among the works it cites.
M. Soltanolkotabi, A. Javanmard, and J. D. Lee, “Theoretical insights into the optimization landscape of over-parameterized shallow neural networks,” IEEE Transactions on Information Theory
2019
Closest in time.
S. Paternain, A. Mokhtari, and A. Ribeiro, “A newton-based method for nonconvex optimization with fast evasion of saddle points,” SIAM Journal on Optimization
2019
Closest in time.
C. W. Royer, M. O’Neill, and S. J. Wright, “A newton-CG algorithm with complexity guarantees for smooth unconstrained optimization,” Mathematical Programming
2019
Closest in time.
S. Lu, M. Hong, and Z. Wang, “PA-GD: On the convergence of perturbed alternating gradient descent to second-order stationary points for structured nonconvex optimization,” in Proceedings of International Conference on Machine Learning (ICML)
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
S. Wang, T. Chang, Y. Cui, and J. Pang, “Clustering by orthogonal non-negative matrix factorization: A sequential non-convex penalty approach,” in Proceedings of IEEE International Conference on Acoustics Speech and Signal Process. (ICASSP)
2019
Closest in time.