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

DOI10.1515/dema-2024-0036MaRDI QIDQ6622670

Heng-you Lan, Hai-yang Xu, Ying Zhao

Publication date: 22 October 2024

Published in: Demonstratio Mathematica (Search for Journal in Brave)

zbMATH Keywords

convergence analysisoptimality conditionKurdyka-Łojasiewicz propertyPeaceman-Rachford splitting method with Bregman distancethree-block nonconvex nonseparable optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Rate of convergence, degree of approximation (41A25) Optimality conditions for minimax problems (49K35)

Cites Work

• Unnamed Item
• Unnamed Item
• Alternating direction method of multipliers for penalized zero-variance discriminant analysis
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• A class of ADMM-based algorithms for three-block separable convex programming
• Analytical and approximate solutions of a novel nervous stomach mathematical model
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems
• Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms
• An extended proximal ADMM algorithm for three-block nonconvex optimization problems
• A proximal alternating direction method for multi-block coupled convex optimization
• Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
• 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
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• Linearly Constrained Non-Lipschitz Optimization for Image Restoration
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization
• A proximal block minimization method of multipliers with a substitution procedure
• Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
• Coordinate optimization for generalized fused Lasso
• The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
• Group variable selection via SCAD-L₂
• Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
• Design of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers
• Signal Recovery by Proximal Forward-Backward Splitting
• Designing of Morlet wavelet as a neural network for a novel prevention category in the HIV system
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
• Heuristic computing with sequential quadratic programming for solving a nonlinear hepatitis B virus model
• Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization

This page was built for publication: Convergence of Peaceman-Rachford splitting method with Bregman distance for three-block nonconvex nonseparable optimization