A generalized alternating direction implicit method for consensus optimization: application to distributed sparse logistic regression
From MaRDI portal
Publication:6631571
DOI10.1007/s10898-024-01418-9MaRDI QIDQ6631571
Weiyang Ding, Wenxing Zhang, Michael Kwok-Po Ng
Publication date: 1 November 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
preconditionerdistributed computingmonotone inclusionsparse logistic regressionconsensus optimizationgeneralized alternating direction implicit method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Distributed multi-agent optimization with state-dependent communication
- Block splitting for distributed optimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Projective splitting with forward steps
- Optimally linearizing the alternating direction method of multipliers for convex programming
- A Peaceman-Rachford splitting method with monotone plus skew-symmetric splitting for nonlinear saddle point problems
- A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
- A survey on the continuous nonlinear resource allocation problem
- Structure-texture image decomposition -- modeling, algorithms, and parameter selection
- A Class of Randomized Primal-Dual Algorithms for Distributed Optimization
- Splitting Methods in Communication, Imaging, Science, and Engineering
- A sequential updating scheme of the Lagrange multiplier for separable convex programming
- A new class of distributed optimization algorithms: application to regression of distributed data
- Proximal Splitting Methods in Signal Processing
- Fast Distributed Gradient Methods
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- Multi-Agent Distributed Optimization via Inexact Consensus ADMM
- DLM: Decentralized Linearized Alternating Direction Method of Multipliers
- Asynchronous Distributed ADMM for Large-Scale Optimization—Part I: Algorithm and<?Pub _newline ?>Convergence Analysis
- A Preconditioner for Generalized Saddle Point Problems
- The Linearized Alternating Direction Method of Multipliers for Dantzig Selector
- Constrained Consensus and Optimization in Multi-Agent Networks
- Multivariate Monotone Inclusions in Saddle Form
- Preconditioned Douglas--Rachford Splitting Methods for Convex-concave Saddle-point Problems
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- Model Selection and Estimation in Regression with Grouped Variables
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
- Convexity, Classification, and Risk Bounds
- Convex analysis and monotone operator theory in Hilbert spaces
- A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
- The Elements of Statistical Learning
This page was built for publication: A generalized alternating direction implicit method for consensus optimization: application to distributed sparse logistic regression