Complexity of Finding Stationary Points of Nonconvex Nonsmooth Functions.
Jingzhao ZhangHongzhou LinStefanie JegelkaSuvrit SraAli JadbabaiePublished in: ICML (2020)
Keyphrases
- stationary points
- mathematical programming
- nonlinear programming
- fixed point
- variational inequalities
- convex functions
- convergence analysis
- karush kuhn tucker
- objective function
- constrained optimization
- linear programming
- worst case
- newton method
- global optimization
- global convergence
- optimality conditions
- optimization problems
- globally convergent
- polynomial equations