Convergence analysis of an improved Bregman-type Peaceman–Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems

J Jian, G Ma, P Liu, J Xu - Journal of Computational and Applied …, 2023 - Elsevier
This study refers to a class of nonconvex nonseparable optimization problems with linear
constraints and closed convex set constraints. Firstly, the equivalent transformation of the …

A Bregman-Style Improved ADMM and its Linearized Version in the Nonconvex Setting: Convergence and Rate Analyses

PJ Liu, JB Jian, H Shao, XQ Wang, JW Xu… - Journal of the Operations …, 2024 - Springer
This work explores a family of two-block nonconvex optimization problems subject to linear
constraints. We first introduce a simple but universal Bregman-style improved alternating …

Weighted L1 and L0 Regularization Using Proximal Operator Splitting Methods

ZA Berkessa, P Waldmann - 2024 - oulurepo.oulu.fi
This paper develops a joint weighted L1-and L0-norm (WL1L0) regularization method by
leveraging proximal operators and translation mapping techniques to mitigate the bias …

Majorized iPADMM for nonseparable convex minimization models with quadratic coupling terms

Y Ma, T Li, Y Song, X Cai - Asia-Pacific Journal of Operational …, 2023 - World Scientific
In this paper, we consider nonseparable convex minimization models with quadratic
coupling terms arised in many practical applications. We use a majorized indefinite proximal …

Convergence of Peaceman-Rachford splitting method with Bregman distance for three-block nonconvex nonseparable optimization

Y Zhao, H Lan, H Xu - Demonstratio Mathematica, 2024 - degruyter.com
It is of strong theoretical significance and application prospects to explore three-block
nonconvex optimization with nonseparable structure, which are often modeled for many …