scientific article; zbMATH DE number 6276190
From MaRDI portal
Publication:5405197
zbMath1434.90141arXiv1111.6082MaRDI QIDQ5405197
Rong Jin, Tianbao Yang, Mehrdad Mahdavi
Publication date: 1 April 2014
Full work available at URL: https://arxiv.org/abs/1111.6082
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Online algorithms; streaming algorithms (68W27)
Related Items (14)
A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints ⋮ Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds ⋮ Decentralized online convex optimization based on signs of relative states ⋮ Dynamic online convex optimization with long-term constraints via virtual queue ⋮ Regrets of proximal method of multipliers for online non-convex optimization with long term constraints ⋮ Primal-Dual Algorithms for Optimization with Stochastic Dominance ⋮ Distributed online bandit linear regressions with differential privacy ⋮ Online bandit convex optimisation with stochastic constraints via two-point feedback ⋮ No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization ⋮ Decentralized online convex optimization with compressed communications ⋮ Simple and fast algorithm for binary integer and online linear programming ⋮ Approachability with constraints ⋮ A stochastic primal-dual method for optimization with conditional value at risk constraints ⋮ Exploiting problem structure in optimization under uncertainty via online convex optimization
This page was built for publication:
