A semi-alternating algorithm for solving nonconvex split equality problems

DOI10.1080/01630563.2021.1933529MaRDI QIDQ5067633zbMATH OpenOpenAlexFDO

Authors 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

generalized CQ-algorithmnonconvex split equality problemsemi-algebraic optimizationsplitting alternating minimization

Mathematics Subject Classification ID

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

Recommendations

• Non-convex split Feasibility problems: models, algorithms and theory
• A modified iterative algorithm for solving split equality problems
• Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
• Iterative algorithm for the split equality problem in Hilbert spaces
• Simultaneous and semi-alternating projection algorithms for solving split equality problems

Cites work

• A multiprojection algorithm using Bregman projections in a product space
• A smoothing alternating minimization-based algorithm for clustering with sum-min of duclidean norms
• Alternating CQ-algorithms for convex feasibility and split fixed-point problems
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Extensions of the CQ algorithm for the split feasibility and split equality problems
• First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
• Gradient-based algorithms with applications to signal-recovery problems
• Non-convex split Feasibility problems: models, algorithms and theory
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems

Cited in

(6)

• Non-convex split Feasibility problems: models, algorithms and theory
• Inexact averaged projection algorithm for nonconvex multiple-set split feasibility problems
• S-subgradient projection algorithms with Armijo line search for nonconvex split feasibility problems
• A new fixed-time stability of neural network to solve split convex feasibility problems
• A projection algorithm for non-convex split feasibility problem
• An alternating iterative method and its application in statistical inference

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5067633)