Multi-block relaxed-dual linear inertial ADMM algorithm for nonconvex and nonsmooth problems with nonseparable structures
From MaRDI portal
Publication:6660857
DOI10.1007/s11075-024-01793-0MaRDI QIDQ6660857
Liyuan Chen, Yan Gao, Yazheng Dang
Publication date: 10 January 2025
Published in: Numerical Algorithms (Search for Journal in Brave)
Cites Work
- Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Local R-linear convergence of ADMM-based algorithm for \(\ell_1\)-norm minimization with linear and box constraints
- Application of the alternating direction method of multipliers to separable convex programming problems
- On accelerated inertial frames in gravity and electromagnetism
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- On the convergence analysis of the alternating direction method of multipliers with three blocks
- An extended proximal ADMM algorithm for three-block nonconvex optimization problems
- An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications
- An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems
- An inexact ADMM with proximal-indefinite term and larger stepsize
- Inertial alternating direction method of multipliers for non-convex non-smooth optimization
- Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property
- A multi-parameter parallel ADMM for multi-block linearly constrained separable convex optimization
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms
- Convergence of linear Bregman ADMM for nonconvex and nonsmooth problems with nonseparable structure
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- The Linearized Alternating Direction Method of Multipliers for Dantzig Selector
- Asynchronous Distributed Optimization Over Lossy Networks via Relaxed ADMM: Stability and Linear Convergence
- An inertial proximal alternating direction method of multipliers for nonconvex optimization
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- A Linearized Alternating Direction Method of Multipliers with Substitution Procedure
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
This page was built for publication: Multi-block relaxed-dual linear inertial ADMM algorithm for nonconvex and nonsmooth problems with nonseparable structures