A semi-alternating algorithm for solving nonconvex split equality problems

DOI10.1080/01630563.2021.1933529zbMath1490.90221OpenAlexW3168386815MaRDI QIDQ5067633

Abdellatif Moudafi

Publication date: 4 April 2022

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2021.1933529

zbMATH Keywords

semi-algebraic optimizationgeneralized CQ-algorithmnonconvex split equality problemsplitting alternating minimization

Mathematics Subject Classification ID

Convex programming (90C25) Methods of quasi-Newton type (90C53)

Related Items (1)

A new fixed-time stability of neural network to solve split convex feasibility problems

Cites Work

• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• A multiprojection algorithm using Bregman projections in a product space
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Non-convex split Feasibility problems: models, algorithms and theory
• First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A semi-alternating algorithm for solving nonconvex split equality problems