Unconstrained Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems.
Ting-Jui ChangShahin ShahrampourPublished in: CoRR (2020)
Keyphrases
- game theory
- optimization problems
- combinatorial optimization
- convex optimization problems
- dynamic environments
- real time
- online convex optimization
- data analysis
- variational inequalities
- mathematical programming
- optimization algorithm
- nonlinear programming
- convex relaxation
- np complete
- online learning
- upper bound
- reinforcement learning
- genetic algorithm