An inertial relaxed CQ algorithm with an application to the LASSO and elastic net (Q4999748): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A multiprojection algorithm using Bregman projections in a product space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified treatment of some iterative algorithms in signal processing and image reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the split feasibility problem without prior knowledge of matrix norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties and iterative methods for the lasso and its variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative oblique projection onto convex sets and the split feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new halfspace-relaxation projection method for the split feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2871112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of CQ algorithm with variable steps for the split equality problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyak's gradient method for split feasibility problem constrained by level sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relaxed CQ algorithm solving the split feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inertial Douglas-Rachford splitting for monotone inclusion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inertial accelerated algorithms for solving a split feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and monotone operator theory in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization and Variable Selection Via the Elastic Net / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5142522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed alternating CQ-algorithm for convex feasibility problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ball-relaxed CQ algorithms for the split feasibility problem / rank
 
Normal rank

Latest revision as of 02:40, 26 July 2024

scientific article; zbMATH DE number 7367148
Language Label Description Also known as
English
An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
scientific article; zbMATH DE number 7367148

    Statements

    An inertial relaxed CQ algorithm with an application to the LASSO and elastic net (English)
    0 references
    0 references
    0 references
    0 references
    2 July 2021
    0 references
    split feasibility problem
    0 references
    relaxed CQ algorithm
    0 references
    variable step-size
    0 references
    weak convergence
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references