Inertial forward-reflected-backward splitting method with linesearch for nonconvex split feasibility problem

DOI10.1142/S0217595925500216MaRDI QIDQ7239563zbMATH OpenFDO

Authors Yang Yang, Biao Qu, Jiayi Song

Publication date 8 May 2026

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0217595925500216

zbMATH Keywords

convergenceKurdyka-Lojasiewicz propertyforward-reflected-backward splitting methodnonconvex split feasibility probleminertial strategylinesearch procedure

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical methods for variational inequalities and related problems (65K15)

Cites work

• A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection
• A forward-backward splitting method for monotone inclusions without cocoercivity
• A note on the CQ algorithm for the split feasibility problem
• A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization
• An MM Algorithm for Split Feasibility Problems
• An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
• An inexact ADMM for separable nonconvex and nonsmooth optimization
• Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
• Inertial proximal alternating minimization for nonconvex and nonsmooth problems
• Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems
• Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property
• Non-convex split Feasibility problems: models, algorithms and theory
• On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
• \(l_1\)-\(l_2\) regularization of split feasibility problems

This page was built for publication: Inertial forward-reflected-backward splitting method with linesearch for nonconvex split feasibility problem

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