An extended proximal ADMM algorithm for three-block nonconvex optimization problems
From MaRDI portal
Publication:2043189
DOI10.1016/j.cam.2021.113681zbMath1472.90103OpenAlexW3172085228MaRDI QIDQ2043189
Chun Zhang, Yong-Zhong Song, Deren Han, Xing-Ju Cai
Publication date: 29 July 2021
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2021.113681
nonconvex optimizationlinear constraintsalternating direction method of multipliersKurdyka-łojasiewicz propertyproximal terms
Related Items
A Bregman-style partially symmetric alternating direction method of multipliers for nonconvex multi-block optimization, Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure, An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- On the linear convergence of the alternating direction method of multipliers
- On the sublinear convergence rate of multi-block ADMM
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Convergence of ADMM for multi-block nonconvex separable optimization models
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Global convergence of ADMM in nonconvex nonsmooth optimization
- A note on the alternating direction method of multipliers
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Traditional and recent approaches in background modeling for foreground detection: an overview
- On the convergence analysis of the alternating direction method of multipliers with three blocks
- On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Asymptotic properties of bridge estimators in sparse high-dimensional regression models
- Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
- 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
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
- Energy Minimization Methods
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- 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
- Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
