A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis

DOI10.1007/S10898-023-01334-4MaRDI QIDQ6497038

Shoham Sabach, Eyal Cohen, Titus O. Pinţa, Marc Teboulle, D. Russell Luke

Publication date: 6 May 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20) Nonsmooth analysis (49J52) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical methods of relaxation type (49M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Monotone (nonlinear) operators in Hilbert space
• On gradients of functions definable in o-minimal structures
• A simplified view of first order methods for optimization
• Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
• \( \alpha \)-firmly nonexpansive operators on metric spaces
• Necessary conditions for linear convergence of iterated expansive, set-valued mappings
• Set regularities and feasibility problems
• First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
• Convergence Analysis of the Relaxed Douglas--Rachford Algorithm
• Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
• Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging
• Implicit Functions and Solution Mappings
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Interior Gradient and Proximal Methods for Convex and Conic Optimization
• Proximité et dualité dans un espace hilbertien
• A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications

This page was built for publication: A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis