Successive Convex Approximation Algorithms for Sparse Signal Estimation with Nonconvex Regularizations.
Yang YangMarius PesaventoSymeon ChatzinotasBjörn E. OtterstenPublished in: CoRR (2018)
Keyphrases
- approximation algorithms
- convex optimization
- signal reconstruction
- np hard
- compressive sensing
- worst case
- signal recovery
- special case
- vertex cover
- quadratic program
- convex functions
- facility location problem
- minimum cost
- group lasso
- convex hull
- open shop
- network design problem
- exact algorithms
- primal dual
- np hardness
- constant factor
- minimization problems
- optimization problems
- precedence constraints
- randomized algorithms
- approximation ratio
- objective function
- polynomial time approximation
- low rank matrices
- quadratic optimization problems
- set cover
- low rank
- approximation schemes
- constant factor approximation
- optimal solution
- approximation guarantees
- convex sets
- undirected graph
- total variation
- greedy algorithm
- linear program
- disjoint paths
- linear programming
- computational complexity