Greedy Sparsity-Constrained Optimization

zbMath1320.90046arXiv1203.5483MaRDI QIDQ5405269

B. Raj, Sohail Bahmani, Petros T. Boufounos

Publication date: 1 April 2014

Full work available at URL: https://arxiv.org/abs/1203.5483

zbMATH Keywords

optimizationgreedy algorithmsparsitycompressed sensing

Mathematics Subject Classification ID

Parametric inference under constraints (62F30) Generalized linear models (logistic models) (62J12) Large-scale problems in mathematical programming (90C06) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (31)

A survey on compressive sensing: classical results and recent advancements ⋮ Nonlinear Variable Selection via Deep Neural Networks ⋮ A data-driven line search rule for support recovery in high-dimensional data analysis ⋮ Gradient projection Newton pursuit for sparsity constrained optimization ⋮ Generalized greedy alternatives ⋮ Newton method for \(\ell_0\)-regularized optimization ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A local MM subspace method for solving constrained variational problems in image recovery ⋮ A greedy Newton-type method for multiple sparse constraint problem ⋮ Iterative hard thresholding methods for \(l_0\) regularized convex cone programming ⋮ Efficient projected gradient methods for cardinality constrained optimization ⋮ Restricted strong convexity implies weak submodularity ⋮ A Tight Bound of Hard Thresholding ⋮ A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization ⋮ Unnamed Item ⋮ Error bounds for rank constrained optimization problems and applications ⋮ An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets ⋮ On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms ⋮ Double fused Lasso regularized regression with both matrix and vector valued predictors ⋮ Subspace quadratic regularization method for group sparse multinomial logistic regression ⋮ Nonsmooth sparsity constrained optimization problems: optimality conditions ⋮ Optimality conditions for rank-constrained matrix optimization ⋮ Solving equations of random convex functions via anchored regression ⋮ Weighted thresholding homotopy method for sparsity constrained optimization ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Greedy approximation in convex optimization ⋮ Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications ⋮ On solutions of sparsity constrained optimization ⋮ The first-order necessary conditions for sparsity constrained optimization

This page was built for publication: Greedy Sparsity-Constrained Optimization