On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization.
Nicolas EmmeneggerRasmus KyngAhad N. ZehmakanPublished in: CoRR (2021)
Keyphrases
- higher order
- optimization algorithm
- auxiliary variables
- optimization problems
- convex programming
- optimization method
- pairwise
- risk minimization
- high order
- global optimization
- convex optimization
- convex relaxation
- oracle database
- worst case
- computational complexity
- optimization process
- convex hull
- semidefinite
- denoising
- alternating direction method of multipliers
- optimization methods
- constrained optimization
- space complexity
- natural images
- min sum
- polynomial hierarchy