Min-max optimization over slowly time-varying graphs
From MaRDI portal
Recommendations
- Near-Optimal Decentralized Algorithms for Saddle Point Problems over Time-Varying Networks
- Decentralized optimization over slowly time-varying graphs: algorithms and lower bounds
- Penalty-based method for decentralized optimization over time-varying graphs
- Towards accelerated rates for distributed optimization over time-varying networks
- Decentralized optimization with affine constraints over time-varying networks
Cites work
- Consensus-based distributed support vector machines
- Convex Optimization in Signal Processing and Communications
- Decentralized optimization over slowly time-varying graphs: algorithms and lower bounds
- Distributed consensus in multi-vehicle cooperative control. Theory and applications.
- Distributed Spectrum Sensing for Cognitive Radio Networks by Exploiting Sparsity
- Fast Convergence Rates for Distributed Non-Bayesian Learning
- Near-Optimal Decentralized Algorithms for Saddle Point Problems over Time-Varying Networks
- Towards accelerated rates for distributed optimization over time-varying networks
Cited in
(3)
This page was built for publication: Min-max optimization over slowly time-varying graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6124386)