The Computational Complexity of Finding Stationary Points in Non-Convex Optimization.
Alexandros HollenderManolis ZampetakisPublished in: CoRR (2023)
Keyphrases
- convex optimization
- computational complexity
- stationary points
- low rank
- total variation
- convex optimization problems
- primal dual
- special case
- constrained optimization
- convex sets
- fixed point
- convergence analysis
- objective function
- np hard
- feature vectors
- pairwise
- mathematical programming
- optimal solution
- nonlinear programming
- image processing