A new self-adaptive CQ algorithm with an application to the LASSO problem
From MaRDI portal
Recommendations
- An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
- scientific article; zbMATH DE number 871318
- Properties and iterative methods for the \(Q\)-lasso
- The Adaptive Lasso and Its Oracle Properties
- Adaptive Randomized Coordinate Descent for Sparse Systems: Lasso and Greedy Algorithms
- A practical scheme and fast algorithm to tune the Lasso with optimality guarantees
- Adaptive Lasso in high-dimensional settings
- scientific article; zbMATH DE number 6850057
- Adaptive LASSO model selection in a multiphase quantile regression
- A forward and backward stagewise algorithm for nonconvex loss functions with adaptive Lasso
Cites work
- scientific article; zbMATH DE number 3853749 (Why is no real title available?)
- scientific article; zbMATH DE number 204196 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A multiprojection algorithm using Bregman projections in a product space
- A new method for split common fixed-point problem without priori knowledge of operator norms
- A note on the CQ algorithm for the split feasibility problem
- A note on the multiple-set split convex feasibility problem in Hilbert space
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Algorithm for solving the set-valued variational inequality problem in Euclidean space
- An explicit algorithm for monotone variational inequalities
- An extragradient method for solving split feasibility and fixed point problems
- Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
- Convergence of direct methods for paramonotone variational inequalities
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- Forcing strong convergence of proximal point iterations in a Hilbert space
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Polyak's gradient method for split feasibility problem constrained by level sets
- Solving the split feasibility problem without prior knowledge of matrix norms
- Split feasibility and fixed point problems
- Strong convergence of the CQ method for fixed point iteration processes
- The multiple-sets split feasibility problem and its applications for inverse problems
- The relaxed CQ algorithm solving the split feasibility problem
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
Cited in
(16)- An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces
- Modified forward-backward splitting method for variational inclusions
- New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces
- Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets
- Strong convergence of Bregman projection algorithms for solving split feasibility problems
- Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
- Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators
- Self-adaptive-type CQ algorithms for split equality problems
- Properties and iterative methods for the \(Q\)-lasso
- A strongly convergent Mann-type inertial algorithm for solving split variational inclusion problems
- Strong convergence of alternated inertial \(CQ\) relaxed method with application in signal recovery
- The iterative method for solving the proximal split feasibility problem with an application to LASSO problem
- A new self-adaptive inertial CQ-algorithm for solving convex feasibility and monotone inclusion problems
- Convergence analysis for solving equilibrium problems and split feasibility problems in Hilbert spaces
- A novel projection method for split feasibility problems with applications to compressive sensing
- An algorithm for the split feasible problem and image restoration
This page was built for publication: A new self-adaptive CQ algorithm with an application to the LASSO problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1615350)
