Minimizing Nonconvex Functions for Sparse Vector Reconstruction

DOI10.1109/TSP.2010.2046900zbMath1391.90492OpenAlexW2163293561MaRDI QIDQ4570350

James P. Reilly, Nasser Mourad

Publication date: 9 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsp.2010.2046900

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (13)

Duality of nonconvex optimization with positively homogeneous functions ⋮ Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization ⋮ A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron ⋮ Robust optimization for spread quality and shortfall in guaranteed targeted display advertising planning ⋮ \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization ⋮ Affine matrix rank minimization problem via non-convex fraction function penalty ⋮ Block-sparse recovery of semidefinite systems and generalized null space conditions ⋮ Registration-based compensation using sparse representation in conformal-array STAP ⋮ A note on the complexity of \(L _{p }\) minimization ⋮ Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming ⋮ A note on the smoothing quadratic regularization method for non-Lipschitz optimization ⋮ Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization ⋮ New regularization method and iteratively reweighted algorithm for sparse vector recovery

This page was built for publication: Minimizing Nonconvex Functions for Sparse Vector Reconstruction