On Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems.
Ting-Jui ChangShahin ShahrampourPublished in: AAAI (2021)
Keyphrases
- optimization problems
- convex programming
- convex relaxation
- convex optimization problems
- dynamic environments
- global optimization
- online convex optimization
- quasiconvex
- semidefinite
- optimization algorithm
- np complete
- data analysis
- reinforcement learning
- mathematical programming
- online algorithms
- quadratic program
- online learning
- linear programming
- lower bound