A new accelerated algorithm for ill-conditioned ridge regression problems
From MaRDI portal
Publication:725822
Recommendations
- An accelerated augmented projection algorithm for ridge regression problem
- The complexity of primal-dual fixed point methods for ridge regression
- Convergence rates of a dual gradient method for constrained linear ill-posed problems
- Accelerated iterative regularization via dual diagonal descent
- A Newton root-finding algorithm for estimating the regularization parameter for solving ill-conditioned least squares problems
Cites work
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A faster algorithm for ridge regression of reduced rank data
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
- Benchmarking optimization software with performance profiles.
- On Conjugate Convex Functions
- On the dual formulation of regularized linear systems with convex risks
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Solving multicollinearity problem using ridge regression models
- The elements of statistical learning. Data mining, inference, and prediction
Cited in
(6)- A faster algorithm for ridge regression of reduced rank data
- Obtaining a threshold for the Stewart index and its extension to ridge regression
- Primal-dual fixed point methods for regularized least-squares problems
- scientific article; zbMATH DE number 7449564 (Why is no real title available?)
- The complexity of primal-dual fixed point methods for ridge regression
- An accelerated augmented projection algorithm for ridge regression problem
This page was built for publication: A new accelerated algorithm for ill-conditioned ridge regression problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q725822)