A regularized alternating direction method of multipliers for a class of nonconvex problems
DOI10.1186/s13660-019-2145-0zbMath1499.90172OpenAlexW2959477221MaRDI QIDQ2067949
Ye Zhang, Jin-Bao Jian, Mian-Tao Chao
Publication date: 19 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-019-2145-0
convergencenonconvex optimization problemsalternating direction method of multipliersKurdyka-Łojasiewicz property
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- Convergence of ADMM for multi-block nonconvex separable optimization models
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- Achieving Cluster Consensus in Continuous-Time Networks of Multi-Agents With Inter-Cluster Non-Identical Inputs
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Variational Analysis
- A Distributed, Asynchronous, and Incremental Algorithm for Nonconvex Optimization: An ADMM Approach
- Iterative algorithms for the split variational inequality and fixed point problems under nonlinear transformations
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
This page was built for publication: A regularized alternating direction method of multipliers for a class of nonconvex problems