A projection algorithm for non-convex split feasibility problem

MaRDI QIDQ6550982zbMATH OpenFDO

Authors Yang Yang, Biao Qu, Ming Qiu

Publication date 5 June 2024

Published in Pacific Journal of Optimization (Search for Journal in Brave)

zbMATH Keywords

convergenceKurdyka-Lojasiewicz propertyprojection gradient algorithmnon-convex split feasibility problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• Inexact averaged projection algorithm for nonconvex multiple-set split feasibility problems
• Non-convex split Feasibility problems: models, algorithms and theory
• S-subgradient projection algorithms with Armijo line search for nonconvex split feasibility problems
• A semi-alternating algorithm for solving nonconvex split equality problems
• An inertial proximal splitting method with applications

Cited in

(1)

• S-subgradient projection algorithms with Armijo line search for nonconvex split feasibility problems

This page was built for publication: A projection algorithm for non-convex split feasibility problem

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