Exploiting problem structure in optimization under uncertainty via online convex optimization
From MaRDI portal
Publication:2316616
DOI10.1007/s10107-018-1262-8zbMath1418.90194arXiv1709.02490OpenAlexW3103209356MaRDI QIDQ2316616
Fatma Kılınç-Karzan, Nam Ho-Nguyen
Publication date: 6 August 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.02490
Related Items (4)
Technical Note—Dynamic Data-Driven Estimation of Nonparametric Choice Models ⋮ No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization ⋮ Online First-Order Framework for Robust Convex Optimization ⋮ Asynchronous Schemes for Stochastic and Misspecified Potential Games and Nonconvex Optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- On general minimax theorems
- Selected topics in robust convex optimization
- Robust optimization-methodology and applications
- Regret bounded by gradual variation for online convex optimization
- Robust Convex Optimization
- On the Solution of Stochastic Optimization and Variational Problems in Imperfect Information Regimes
- An optimal algorithm for stochastic strongly-convex optimization
- Theory and Applications of Robust Optimization
- Online Learning and Online Convex Optimization
- Oracle-Based Robust Optimization via Online Learning
- Cutting-set methods for robust convex optimization with pessimizing oracles
- An optimal on-line algorithm for metrical task system
- A Saddle Point Algorithm for Networked Online Convex Optimization
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- On Stochastic Subgradient Mirror-Descent Algorithm with Weighted Averaging
- Online First-Order Framework for Robust Convex Optimization
- Prediction, Learning, and Games
- Robust Portfolio Selection Problems
This page was built for publication: Exploiting problem structure in optimization under uncertainty via online convex optimization
