Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization.
Haochuan LiYi TianJingzhao ZhangAli JadbabaiePublished in: CoRR (2021)
Keyphrases
- min max
- objective function
- lower bound
- max min
- multiobjective optimization
- optimization problems
- worst case
- global optimization
- upper bound
- multi objective
- constrained optimization
- optimization algorithm
- nonlinear programming
- np hard
- convex functions
- convex optimization
- subgradient method
- combinatorial optimization
- computational complexity
- lower and upper bounds
- optimization process
- lagrangian relaxation
- branch and bound
- lagrange multipliers
- optimization method
- online algorithms
- online learning
- quadratic program
- min sum