Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization
From MaRDI portal
Recommendations
- Individual Regret Bounds for the Distributed Online Alternating Direction Method of Multipliers
- Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Online Distributed Optimization With Nonconvex Objective Functions: Sublinearity of First-Order Optimality Condition-Based Regret
- Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints
- Distributed Online Optimization With Long-Term Constraints
- Online Distributed Convex Optimization on Dynamic Networks
- Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
- Distributed Constrained Online Learning
- Regret bounded by gradual variation for online convex optimization
- Distributed Online Optimization for Multi-Agent Networks With Coupled Inequality Constraints
Cited in
(9)- Regrets of proximal method of multipliers for online non-convex optimization with long term constraints
- Online convex optimization using coordinate descent algorithms
- Distributed constrained online convex optimization with adaptive quantization
- Distributed online constrained convex optimization with event-triggered communication
- Distributed zeroth-order online optimization with communication delays
- Online distributed algorithms for mixed equilibrium problems in dynamic environments
- Distributed stochastic constrained optimization with constant step-sizes via saddle-point dynamics
- Distributed online path-length-independent algorithm for noncooperative games over unbalanced digraphs
- Distributed online optimization with switching costs
This page was built for publication: Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6056047)