Introduction to Online Convex Optimization
From MaRDI portal
Abstract: This manuscript portrays optimization as a process. In many practical applications the environment is so complex that it is infeasible to lay out a comprehensive theoretical model and use classical algorithmic theory and mathematical optimization. It is necessary as well as beneficial to take a robust approach, by applying an optimization method that learns as one goes along, learning from experience as more aspects of the problem are observed. This view of optimization as a process has become prominent in varied fields and has led to some spectacular success in modeling and systems that are now part of our daily lives.
Recommendations
- Online learning and online convex optimization
- Online Convex Optimization With Binary Constraints
- Fast algorithms for online stochastic convex programming
- Predictive online convex optimization
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- Online constrained optimization with recourse
- Efficient online linear optimization with approximation algorithms
- Online Convex Optimization With Time-Varying Constraints and Bandit Feedback
- A continuous-time approach to online optimization
Cited in
(23)- Online Convex Optimization With Binary Constraints
- No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization
- A note on continuous-time online learning
- On the dual gradient descent method for the resource allocation problem in multiagent systems
- Distributionally robust optimization
- scientific article; zbMATH DE number 1827088 (Why is no real title available?)
- Online convex optimization for survival analysis: an adaptive and stochastic approach
- Online learning in a one-dimensional periodic quadratic variational problem with an adversarial external force
- scientific article; zbMATH DE number 7064063 (Why is no real title available?)
- Fast convergence of optimistic gradient ascent in network zero-sum extensive form games
- Online learning and online convex optimization
- Predictive online convex optimization
- Robust frequent directions with application in online learning
- scientific article; zbMATH DE number 7625184 (Why is no real title available?)
- Tracking nonstationary streaming data via exponentially weighted moving average stochastic gradient descent
- Stochastic online optimization for cyber-physical and robotic systems
- On convergence rate of distributed stochastic gradient algorithm for convex optimization with inequality constraints
- Constrained distributed online convex optimization with bandit feedback for unbalanced digraphs
- Optimal multi-distribution learning
- An online convex optimization-based framework for convex bilevel optimization
- Synthetic control as online linear regression
- Exploiting problem structure in optimization under uncertainty via online convex optimization
- Random feature-based online multi-kernel learning in environments with unknown dynamics
This page was built for publication: Introduction to Online Convex Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5871903)
