On Complexity of Finding Stationary Points of Nonsmooth Nonconvex Functions.
Jingzhao ZhangHongzhou LinSuvrit SraAli JadbabaiePublished in: CoRR (2020)
Keyphrases
- stationary points
- mathematical programming
- nonlinear programming
- fixed point
- variational inequalities
- constrained optimization
- convex functions
- objective function
- convergence analysis
- karush kuhn tucker
- linear programming
- computational complexity
- worst case
- mathematical program
- image restoration and reconstruction
- newton method
- globally convergent
- evolutionary algorithm
- linear constraints
- cost function