An accelerated primal dual algorithm with backtracking for decentralized constrained optimization
From MaRDI portal
Cites work
- A Decentralized Primal-Dual Method for Constrained Minimization of a Strongly Convex Function
- A Decentralized Proximal-Gradient Method With Network Independent Step-Sizes and Separated Convergence Rates
- A distributed ADMM-like method for resource sharing over time-varying networks
- A fast row-stochastic decentralized method for distributed optimization over directed graphs
- A primal-dual algorithm with line search for general convex-concave saddle point problems
- A Proximal Gradient Algorithm for Decentralized Composite Optimization
- Adaptation, learning, and optimization over networks
- Adaptive subgradient methods for online learning and stochastic optimization
- Constrained Consensus and Optimization in Multi-Agent Networks
- DAdam: a consensus-based distributed adaptive gradient method for online optimization
- Distributed Linearized Alternating Direction Method of Multipliers for Composite Convex Consensus Optimization
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Distributed Subgradient Methods for Multi-Agent Optimization
- EXTRA: an exact first-order algorithm for decentralized consensus optimization
- Fast Distributed Gradient Methods
- Generalized optimistic methods for convex-concave saddle point problems
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- Multiuser optimization: distributed algorithms and error analysis
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Stabilized Barzilai-Borwein method
- Two-Point Step Size Gradient Methods
This page was built for publication: An accelerated primal dual algorithm with backtracking for decentralized constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232489)