Complexity and applications of the homotopy principle for uniformly constrained sparse minimization
type: Item
instance of: scholarly article
title: Complexity and applications of the homotopy principle for uniformly constrained sparse minimization
zbMATH Open document ID: 1468.65070
author: Christoph Brauer
author: Dirk A. Lorenz
published in: Applied Mathematics and Optimization
publication date: 2021-04-22T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65C20
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7336653
zbMATH Keywords: convex optimization
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: homotopy methods
zbMATH Keywords: primal-dual methods
zbMATH Keywords: binary classification
zbMATH Keywords: cross-validation
describes a project that uses: PDCO
describes a project that uses: UCI-ml
MaRDI profile type: Publication
full work available at URL: s00245-019-09565-2
OpenAlex ID: W2938146253
cites work: On L1 and Chebyshev estimation
cites work: A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints
cites work: A Direct Estimation Approach to Sparse Linear Discriminant Analysis
cites work: A Constrainedℓ1Minimization Approach to Sparse Precision Matrix Estimation
cites work: Decoding by Linear Programming
cites work: The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
cites work: Atomic Decomposition by Basis Pursuit
cites work: Compressed sensing
cites work: For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
cites work: Least angle regression. (With discussion)
cites work: A mathematical introduction to compressive sensing
cites work: DASSO: Connections Between the Dantzig Selector and Lasso
cites work: Solving Basis Pursuit
cites work: Sparse Approximate Solutions to Linear Systems
cites work: A new approach to variable selection in least squares problems
cites work: Über diskrete und lineare Tschebyscheff-Approximationen
cites work: Q4864293
Wikidata QID: Q128051230
DOI: 10.1007/S00245-019-09565-2
description: scientific article; zbMATH DE number 7336653