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

DOI10.1016/J.CAM.2023.115086zbMath1519.90185OpenAlexW4320170269MaRDI QIDQ6099473

Guodong Ma, Jin-Bao Jian, JiaWei Xu, Pengjie Liu

Publication date: 20 June 2023

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.2023.115086

zbMATH Keywords

convergenceBregman distanceKurdyka-Łojasiewicz propertyimproved Peaceman-Rachford splitting methodnonconvex nonseparable optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (1)

A Bregman-style improved ADMM and its linearized version in the nonconvex setting: convergence and rate analyses

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems
• 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
• First-order algorithms for convex optimization with nonseparable objective and coupled constraints
• Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
• Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms
• Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
• A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
• Generalized Peaceman-Rachford splitting method with substitution for convex programming
• 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
• Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming
• Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
• 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
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization
• A proximal block minimization method of multipliers with a substitution procedure
• Variational Analysis
• On the Convergence of Alternating Direction Lagrangian Methods for Nonconvex Structured Optimization Problems

This page was built for publication: Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems