An iterative algorithm for the square-root Lasso
From MaRDI portal
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Comments on: \(\ell_{1}\)-penalization for mixture regression models
- Compressive imaging: structure, sampling, learning. With contributions by Vegard Antun
- Convex analysis and monotone operator theory in Hilbert spaces
- Correcting for unknown errors in sparse high-dimensional function approximation
- Estimation and testing under sparsity. École d'Été de Probabilités de Saint-Flour XLV -- 2015
- First-order methods in optimization
- scientific article; zbMATH DE number 6388313 (Why is no real title available?)
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6472991 (Why is no real title available?)
- Improved bounds for square-root Lasso and square-root slope
- MM optimization algorithms
- Model Selection and Estimation in Regression with Grouped Variables
- Numerical Analysis for Statisticians
- On efficient algorithms for computing near-best polynomial approximations to high-dimensional, Hilbert-valued functions from limited samples
- On gradients of functions definable in o-minimal structures
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Robust Statistics
- Selective inference with unknown variance via the square-root Lasso
- Sharp oracle inequalities for square root regularization
- Signal Recovery by Proximal Forward-Backward Splitting
- Square root LASSO: well-posedness, Lipschitz stability, and the tuning trade-off
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- The Group Square-Root Lasso: Theoretical Properties and Fast Algorithms
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
This page was built for publication: An iterative algorithm for the square-root Lasso
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6877079)
