Can We Find Near-Approximately-Stationary Points of Nonsmooth Nonconvex Functions?
Ohad ShamirPublished in: CoRR (2020)
Keyphrases
- stationary points
- mathematical programming
- nonlinear programming
- variational inequalities
- fixed point
- convergence analysis
- objective function
- convex functions
- constrained optimization
- linear programming
- optimality conditions
- newton method
- karush kuhn tucker
- mathematical program
- globally convergent
- optimization problems
- image restoration and reconstruction
- polynomial equations
- high level