Online Convex Optimization with Hard Constraints: Towards the Best of Two Worlds and Beyond.
Hengquan GuoXin LiuHonghao WeiLei YingPublished in: NeurIPS (2022)
Keyphrases
- hard constraints
- online convex optimization
- cost function
- soft constraints
- online learning
- long run
- constraint satisfaction problems
- constraint satisfaction
- efficient computation
- graph cuts
- convex optimization
- newton method
- search space
- multi criteria
- penalty function
- efficient algorithms for solving
- support vector
- neural network
- constraint propagation
- multi objective optimization
- constraint programming
- multi objective evolutionary algorithms
- np complete
- regret bounds
- multi objective
- special case