Primal-dual fixed point methods for regularized least-squares problems

DOI10.24193/FPT-RO.2023.2.13MaRDI QIDQ6576066zbMATH OpenFDO

Authors Guohui Liu, Hong-Kun Xu

Publication date 22 July 2024

Published in Fixed Point Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.24193/FPT-RO.2023.2.13

zbMATH Keywords

elastic netfixed point methodlassoprime-dual methodregularization

Mathematics Subject Classification ID

Fixed-point theorems (47H10) Iterative procedures involving nonlinear operators (47J25) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Cites work

• A new accelerated algorithm for ill-conditioned ridge regression problems
• An l₁-l_p DC regularization method for compressed sensing
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Averaged mappings and the gradient-projection algorithm
• Convexity and optimization in Banach spaces.
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• Properties and iterative methods for the lasso and its variants
• Proximal methods for reweighted \(l_Q\)-regularization of sparse signal recovery
• Proximity algorithms for image models: denoising
• Regularization and Variable Selection Via the Elastic Net
• Signal Recovery by Proximal Forward-Backward Splitting
• Sparsity-enforcing regularisation and ISTA revisited
• The complexity of primal-dual fixed point methods for ridge regression

Cited in

(1)

• Weak and strong convergence of split Douglas-Rachford algorithms for monotone inclusions

This page was built for publication: Primal-dual fixed point methods for regularized least-squares problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6576066)