An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
From MaRDI portal
(Redirected from Publication:4999748)
Recommendations
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- New inertial relaxed method for solving split feasibilities
- Inertial relaxed CQ algorithm with an application to signal processing
- Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators
- Some novel inertial ball-relaxed CQ algorithms for solving the split feasibility problem with multiple output sets
Cites work
- A multiprojection algorithm using Bregman projections in a product space
- A new halfspace-relaxation projection method for the split feasibility problem
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- A relaxed alternating CQ-algorithm for convex feasibility problems
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- A splitting-relaxed projection method for solving the split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- Convex analysis and monotone operator theory in Hilbert spaces
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Inertial accelerated algorithms for solving a split feasibility problem
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- 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 convergence of CQ algorithm with variable steps for the split equality problem
- Polyak's gradient method for split feasibility problem constrained by level sets
- Properties and iterative methods for the lasso and its variants
- Regularization and Variable Selection Via the Elastic Net
- Solving the split feasibility problem without prior knowledge of matrix norms
- The ball-relaxed CQ algorithms for the split feasibility problem
- The relaxed CQ algorithm solving the split feasibility problem
- The selective projection method for convex feasibility and split feasibility problems
Cited in
(14)- A new self-adaptive CQ algorithm with an application to the LASSO problem
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- Properties and iterative methods for the \(Q\)-lasso
- New inertial relaxed CQ algorithms for solving split feasibility problems in Hilbert spaces
- Inertial relaxed CQ algorithm with an application to signal processing
- scientific article; zbMATH DE number 6747340 (Why is no real title available?)
- 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
- Some novel inertial ball-relaxed CQ algorithms for solving the split feasibility problem with multiple output sets
- Modified general splitting method for the split feasibility problem
- An inertial hyperplane projection method for split feasibility problems and applications
- Preconditioning splitting methods for the split feasibility problem
- Max-residual selection operators for families of cutters with applications to split feasibility problems
This page was built for publication: An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4999748)
