A new self-adaptive CQ algorithm with an application to the LASSO problem
type: Item
instance of: scholarly article
title: A new self-adaptive CQ algorithm with an application to the LASSO problem
zbMATH Open document ID: 1398.65149
author: Pham Ky Anh
author: Nguyen The Vinh
author: Vu Tien Dung
published in: Journal of Fixed Point Theory and Applications
publication date: 2018-10-30T00:00:00Z
Mathematics Subject Classification ID: 65K15
Mathematics Subject Classification ID: 47J25
zbMATH DE Number: 6969135
zbMATH Keywords: split feasibility problem
zbMATH Keywords: variational inequality
zbMATH Keywords: fixed point problem
zbMATH Keywords: monotone operator
zbMATH Keywords: weak convergence
zbMATH Keywords: strong convergence
MaRDI profile type: Publication
full work available at URL: s11784-018-0620-8
OpenAlex ID: W2889882686
cites work: On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
cites work: Split Feasibility and Fixed Point Problems
cites work: Q4695312
cites work: Iterative oblique projection onto convex sets and the split feasibility problem
cites work: A unified treatment of some iterative algorithms in signal processing and image reconstruction
cites work: An extragradient method for solving split feasibility and fixed point problems
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: The multiple-sets split feasibility problem and its applications for inverse problems
cites work: Convergence of direct methods for paramonotone variational inequalities
cites work: An explicit algorithm for monotone variational inequalities
cites work: The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
cites work: Q4908849
cites work: Q3322631
cites work: Solving the split feasibility problem without prior knowledge of matrix norms
cites work: Q5445188
cites work: A note on the CQ algorithm for the split feasibility problem
cites work: Forcing strong convergence of proximal point iterations in a Hilbert space
cites work: Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
cites work: Q4864293
cites work: Cyclic algorithms for split feasibility problems in Hilbert spaces
cites work: Polyak's gradient method for split feasibility problem constrained by level sets
cites work: A new method for split common fixed-point problem without priori knowledge of operator norms
cites work: Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
cites work: Strong convergence of the CQ method for fixed point iteration processes
cites work: The relaxed CQ algorithm solving the split feasibility problem
Wikidata QID: Q129208151
DOI: 10.1007/S11784-018-0620-8
Recommended article: An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
Recommended article: Q4874685
Recommended article: Properties and iterative methods for the \(Q\)-lasso
Recommended article: The Adaptive Lasso and Its Oracle Properties
Recommended article: Adaptive Randomized Coordinate Descent for Sparse Systems: Lasso and Greedy Algorithms
Recommended article: A Practical Scheme and Fast Algorithm to Tune the Lasso With Optimality Guarantees
Recommended article: Adaptive Lasso in high-dimensional settings
Recommended article: Q4607743
Recommended article: Adaptive LASSO model selection in a multiphase quantile regression
Recommended article: A forward and backward stagewise algorithm for nonconvex loss functions with adaptive Lasso
description: scientific article; zbMATH DE number 6969135