An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net

DOI10.1007/s40314-023-02559-5OpenAlexW4390658980WikidataQ126176002 ScholiaQ126176002MaRDI QIDQ6192345

Guash Haile Taddele, Poom Kumam, Songpon Sriwongsa, Mahmoud Muhammad Yahaya

Publication date: 12 February 2024

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-023-02559-5

zbMATH Keywords

strong convergencesplit feasibility problemself-adaptive technique

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Operations research, economics (aspects of mathematics education) (97M40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving the variational inequality problem defined on intersection of finite level sets
• Strong convergence of a relaxed CQ algorithm for the split feasibility problem
• Iterative methods for fixed point problems in Hilbert spaces
• Algorithms for the split variational inequality problem
• Further investigation into approximation of a common solution of fixed point problems and split feasibility problems
• Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
• A multiprojection algorithm using Bregman projections in a product space
• Note on the modified relaxation CQ algorithm for the split feasibility problem
• Inertial projection and contraction algorithms for variational inequalities
• An inertial forward-backward splitting method for solving inclusion problems in Hilbert spaces
• A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
• Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
• Convergence of relaxed inertial subgradient extragradient methods for quasimonotone variational inequality problems
• An inertial extrapolation method for multiple-set split feasibility problem
• The split feasibility problem with multiple output sets in Hilbert spaces
• Strong convergence of a self-adaptive method for the split feasibility problem
• A new CQ algorithm for solving split feasibility problems in Hilbert spaces
• A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
• Iterative methods for generalized split feasibility problems in Hilbert spaces
• Convergence analysis for proximal split feasibility problems and fixed point problems
• General method for solving the split common fixed point problem
• Iterative solution of split variational inclusion problem in a real Banach spaces
• A shrinking projection method for solving the split common null point problem in Banach spaces
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Solving the split feasibility problem without prior knowledge of matrix norms
• The multiple-sets split feasibility problem and its applications for inverse problems
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• The split common fixed-point problem for demicontractive mappings
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• The ball-relaxed CQ algorithms for the split feasibility problem
• The Split Common Null Point Problem
• The relaxed CQ algorithm solving the split feasibility problem
• An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
• Two Projection Methods for Solving the Split Common Fixed Point Problem with Multiple Output Sets in Hilbert Spaces
• Ball-relaxed projection algorithms for multiple-sets split feasibility problem
• Iterative methods for solving the generalized split common null point problem in Hilbert spaces
• Linear convergence of CQ algorithms and applications in gene regulatory network inference
• Some methods of speeding up the convergence of iteration methods
• Convex analysis and monotone operator theory in Hilbert spaces
• Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning

This page was built for publication: An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net