Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization

DOI10.1007/s40305-022-00411-xOpenAlexW4225413344MaRDI QIDQ6151000

No author found.

Publication date: 9 February 2024

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-022-00411-x

zbMATH Keywords

convergence rateBregman distanceKurdyka-Łojasiewicz inequalityPeaceman-Rachford splitting methodnonconvex nonseparable optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• 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
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• 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
• 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
• An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization
• Generalized Peaceman-Rachford splitting method with substitution for convex programming
• Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization
• A proximal alternating direction method for multi-block coupled convex optimization
• Randomized primal-dual proximal block coordinate updates
• An LQP-based symmetric alternating direction method of multipliers with larger step sizes
• Alternating proximal gradient method for sparse nonnegative Tucker decomposition
• Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
• General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
• Convergence of linear Bregman ADMM for nonconvex and nonsmooth problems with nonseparable structure
• A Strictly Contractive Peaceman--Rachford Splitting Method for 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
• Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
• A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization
• A proximal block minimization method of multipliers with a substitution procedure
• Restricted isometry properties and nonconvex compressive sensing
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Variational Analysis
• A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
• Convergence of the Peaceman-Rachford Splitting Method for a Class of Nonconvex Programs
• An inertial proximal Peaceman-Rachford splitting method
• Comments on «Wavelets in statistics: A review» by A. Antoniadis
• Group variable selection via SCAD-L₂
• A Generalized Proximal Point Algorithm and Its Convergence Rate
• Signal Recovery by Proximal Forward-Backward Splitting
• Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization

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