The optimality of iterative maximum penalized likelihood algorithms for ridge regression
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1217676
- Quadratic extrapolation for accelerating convergence of the EM fixed point problem
- N-Stage splitting for maximum penalized likelihood estimation with gaussian data and stationary linear iterative methods
- Ridge Regression — 1980: Advances, Algorithms, and Applications
- An iterative approach to minimize the mean squared error in ridge regression
Cites work
- scientific article; zbMATH DE number 4159863 (Why is no real title available?)
- scientific article; zbMATH DE number 3720254 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 4001209 (Why is no real title available?)
- Matrix Analysis of a Two-Stage-Splitting Iteration for Maximum Penalized Likelihood Estimation
- Nonparametric Roughness Penalties for Probability Densities
- Ridge Regression: Applications to Nonorthogonal Problems
Cited in
(3)
This page was built for publication: The optimality of iterative maximum penalized likelihood algorithms for ridge regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334819)