No label defined (Q4558147)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 6982301

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 6982301

Statements

scholarly article

0 references

zbMATH Open document ID

0 references

0 references

0 references

0 references

0 references

publication date

21 November 2018

0 references

full work available at URL

https://arxiv.org/abs/1701.05128

0 references

http://jmlr.csail.mit.edu/papers/v19/17-194.html

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

geometrical convergence

0 references

Karush-Kuhn-Tucker (KKT) conditions

0 references

nonasymptotic error bounds

0 references

oracle property

0 references

root finding

0 references

support detection

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

Fast global convergence of gradient methods for high-dimensional statistical recovery

0 references

Best subset selection via a modern optimization lens

0 references

Iterative thresholding for sparse approximations

0 references

Iterative hard thresholding for compressed sensing

0 references

Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection

0 references

Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise

0 references

Decoding by Linear Programming

0 references

Stable signal recovery from incomplete and inaccurate measurements

0 references

Atomic Decomposition by Basis Pursuit

0 references

Complexity of unconstrained \(L_2 - L_p\) minimization

0 references

Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse

0 references

Stable recovery of sparse overcomplete representations in the presence of noise

0 references

Least angle regression. (With discussion)

0 references

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

0 references

Sure Independence Screening for Ultrahigh Dimensional Feature Space

0 references

Nonconcave penalized likelihood with a diverging number of parameters.

0 references

Strong oracle optimality of folded concave penalized estimation

0 references

Pathwise coordinate optimization

0 references

Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming

0 references

0 references

Asymptotic properties of bridge estimators in sparse high-dimensional regression models

0 references

0 references

Variable selection using MM algorithms

0 references

A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem

0 references

Smoothly Clipped Absolute Deviation on High Dimensions

0 references

Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima

0 references

Sup-norm convergence rate and sign concentration property of Lasso and Dantzig estimators

0 references

Matching pursuits with time-frequency dictionaries

0 references

<i>SparseNet</i>: Coordinate Descent With Nonconvex Penalties

0 references

High-dimensional graphs and variable selection with the Lasso

0 references

Sparse Approximate Solutions to Linear Systems

0 references

Gradient methods for minimizing composite functions

0 references

A new approach to variable selection in least squares problems

0 references

Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls

0 references

Thresholding-based iterative selection procedures for model selection and shrinkage

0 references

0 references

The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing

0 references

Greed is Good: Algorithmic Results for Sparse Approximation

0 references

Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)

0 references

Calibrating nonconvex penalized regression in ultra-high dimension

0 references

Optimal computational and statistical rates of convergence for sparse nonconvex learning problems

0 references

Coordinate descent algorithms for lasso penalized regression

0 references

A Proximal-Gradient Homotopy Method for the Sparse Least-Squares Problem

0 references

0 references

Nearly unbiased variable selection under minimax concave penalty

0 references

The sparsity and bias of the LASSO selection in high-dimensional linear regression

0 references

A general theory of concave regularization for high-dimensional sparse estimation problems

0 references

Some sharp performance bounds for least squares regression with \(L_1\) regularization

0 references

0 references

Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations

0 references

Sparse Recovery With Orthogonal Matching Pursuit Under RIP

0 references

0 references

The Adaptive Lasso and Its Oracle Properties

0 references

Rejoinder: One-step sparse estimates in nonconcave penalized likelihood models

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4558147

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4558147&oldid=36450413"