Primal-dual \(\varepsilon\)-subgradient method for distributed optimization
From MaRDI portal
Publication:6076822
DOI10.1007/s11424-023-1321-yarXiv2101.02880OpenAlexW3126515474MaRDI QIDQ6076822
Publication date: 22 September 2023
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.02880
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual algorithm for distributed constrained optimization
- First-order methods of smooth convex optimization with inexact oracle
- Distributed gradient algorithm for constrained optimization with application to load sharing in power systems
- Subgradient methods for saddle-point problems
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Convergence of some algorithms for convex minimization
- Convergence rate analysis of distributed optimization with projected subgradient algorithm
- Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication
- Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
- Linear Convergence Rate of a Class of Distributed Augmented Lagrangian Algorithms
- Fast Distributed Gradient Methods
- Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
- Distributed Continuous-Time Algorithm for Constrained Convex Optimizations via Nonsmooth Analysis Approach
- Distributed Subgradient Projection Algorithm Over Directed Graphs
- Constrained Consensus Algorithms With Fixed Step Size for Distributed Convex Optimization Over Multiagent Networks
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed Finite-Time Average-Consensus With Limited Computational and Storage Capability
- Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Primal-dual \(\varepsilon\)-subgradient method for distributed optimization