Escaping saddle points in constrained optimization
In this paper, we study the problem of escaping from saddle points in smooth nonconvex optimization problems subject to a convex set C. We propose a generic framework that yields convergence to a second-order stationary point of the problem, if the convex set C is simple for a quadratic objective fu...
| Main Authors: | , , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Neural Information Processing Systems Foundation,
2019-07-09T15:27:53Z.
|
| Subjects: | |
| Online Access: | Get fulltext |