Online convex optimization using coordinate descent algorithms

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Logarithmic regret algorithms for online convex optimization
Predictive online convex optimization
Coordinate descent algorithms
Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
Online Distributed Convex Optimization on Dynamic Networks
Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme
Online Learning and Online Convex Optimization
Distributed Online Optimization in Dynamic Environments Using Mirror Descent
An Online Convex Optimization Approach to Proactive Network Resource Allocation
Online Stochastic Optimization With Time-Varying Distributions
Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints
Online Optimization With Predictions and Switching Costs: Fast Algorithms and the Fundamental Limit
Distributed Online Optimization With Long-Term Constraints
Decentralized Online Convex Optimization With Feedback Delays
Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
Online Convex Optimization With Time-Varying Constraints and Bandit Feedback
Online Learning of Feasible Strategies in Unknown Environments
On the Convergence of Block Coordinate Descent Type Methods
A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization
Distributed online optimization in time-varying unbalanced networks without explicit subgradients

This page was built for publication: Online convex optimization using coordinate descent algorithms