Online Optimization in Dynamic Environments: Improved Regret Rates for Strongly Convex Problems.
Aryan MokhtariShahin ShahrampourAli JadbabaieAlejandro RibeiroPublished in: CoRR (2016)
Keyphrases
- dynamic environments
- online learning
- optimization problems
- online convex optimization
- convex relaxation
- mobile robot
- autonomous agents
- convex optimization
- convex optimization problems
- convex programming
- lower bound
- changing environment
- saddle point
- collision avoidance
- semidefinite
- online algorithms
- quadratic program
- evolutionary algorithm
- efficient algorithms for solving
- risk minimization
- nonlinear programming
- quadratic programming
- path planning
- loss function