Decentralized proximal splitting algorithms for composite constrained convex optimization
From MaRDI portal
Publication:2170762
DOI10.1016/j.jfranklin.2022.07.053zbMath1495.90134OpenAlexW4289834660MaRDI QIDQ2170762
Zheng Wang, Qingguo Lü, Lifeng Zheng, Huaqing Li, Dawen Xia, Liping Feng, Liang Ran
Publication date: 6 September 2022
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jfranklin.2022.07.053
Related Items
An event-triggering algorithm for decentralized stochastic optimization over networks, An accelerated exact distributed first-order algorithm for optimization over directed networks, Seeking strategy design for distributed nonsmooth games and its application
Cites Work
- Unnamed Item
- Unnamed Item
- Incremental proximal methods for large scale convex optimization
- Distributed algorithm for resource allocation problems under persistent attacks
- Convergence rate analysis of distributed optimization with projected subgradient algorithm
- Multi-subspace factor analysis integrated with support vector data description for multimode process monitoring
- A consensus algorithm based on collective neurodynamic system for distributed optimization with linear and bound constraints
- Cooperative convex optimization with subgradient delays using push-sum distributed dual averaging
- Distributed fusion in wireless sensor networks based on a novel event-triggered strategy
- Collective neurodynamic optimization for economic emission dispatch problem considering valve point effect in microgrid
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs
- Primal-dual stochastic distributed algorithm for constrained convex optimization
- Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators
- Multi-cluster distributed optimization via random sleep strategy
- A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization
- Event-Triggering Sampling Based Leader-Following Consensus in Second-Order Multi-Agent Systems
- Neural networks for solving systems of linear equations. II. Minimax and least absolute value problems
- Convergence of Asynchronous Distributed Gradient Methods Over Stochastic Networks
- Distributed Sparse Linear Regression
- A Proximal Gradient Algorithm for Decentralized Composite Optimization
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Distributed Subgradient Methods for Multi-Agent Optimization
- Asynchronous Distributed Optimization Over Lossy Networks via Relaxed ADMM: Stability and Linear Convergence
- A New Randomized Block-Coordinate Primal-Dual Proximal Algorithm for Distributed Optimization
- A Decentralized Proximal-Gradient Method With Network Independent Step-Sizes and Separated Convergence Rates
- EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
- Asynchronous Distributed Optimization Via Randomized Dual Proximal Gradient
- Relaxed Logarithmic Barrier Function Based Model Predictive Control of Linear Systems
- Convergence Rate Analysis of Several Splitting Schemes
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
- An introduction to continuous optimization for imaging
- A Proximal Diffusion Strategy for Multiagent Optimization With Sparse Affine Constraints
- Convex analysis and monotone operator theory in Hilbert spaces
