An inertial relaxed CQ algorithm with an application to the LASSO and elastic net

DOI10.1080/02331934.2020.1763989OpenAlexW3028540042MaRDI QIDQ4999748

Hai Yu, Feng Hui Wang

Publication date: 2 July 2021

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

weak convergencevariable step-sizesplit feasibility problemrelaxed CQ algorithm

Mathematics Subject Classification ID

Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Inverse problems in optimal control (49N45)

Related Items

Two inertial-type algorithms for solving the split feasibility problem ⋮ Convergence analysis for solving equilibrium problems and split feasibility problems in Hilbert spaces ⋮ An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net ⋮ Unnamed Item ⋮ New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
• Inertial Douglas-Rachford splitting for monotone inclusion problems
• On the convergence of CQ algorithm with variable steps for the split equality problem
• Properties and iterative methods for the lasso and its variants
• A multiprojection algorithm using Bregman projections in a product space
• A relaxed alternating CQ-algorithm for convex feasibility problems
• A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
• Inertial accelerated algorithms for solving a split feasibility problem
• Polyak's gradient method for split feasibility problem constrained by level sets
• A new halfspace-relaxation projection method for the split feasibility problem
• A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Solving the split feasibility problem without prior knowledge of matrix norms
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• 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 relaxed CQ algorithm solving the split feasibility problem
• Regularization and Variable Selection Via the Elastic Net
• Convex analysis and monotone operator theory in Hilbert spaces
• An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping