Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
From MaRDI portal
Publication:2866194
DOI10.1137/120869778zbMath1295.90051arXiv1203.4580MaRDI QIDQ2866194
Publication date: 13 December 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.4580
numerical methods; optimality conditions; stationarity; compressed sensing; sparsity constrained problems
90C26: Nonconvex programming, global optimization
90C46: Optimality conditions and duality in mathematical programming
Related Items
Quasi-linear Compressed Sensing, Convex Optimization and Parsimony of $L_p$-balls Representation, Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method, Nomonotone spectral gradient method for sparse recovery, On solutions of sparsity constrained optimization, The first-order necessary conditions for sparsity constrained optimization, The sparse principal component analysis problem: optimality conditions and algorithms, The non-convex sparse problem with nonnegative constraint for signal reconstruction, Greedy approximation in convex optimization, Finding sparse solutions of systems of polynomial equations via group-sparsity optimization, Phase retrieval: stability and recovery guarantees, Duality and Convex Programming, On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
