Entropic Regularization of the ℓ 0 Function
From MaRDI portal
Publication:2897276
DOI10.1007/978-1-4419-9569-8_5zbMath1357.49115MaRDI QIDQ2897276
Jonathan M. Borwein, D. Russell Luke
Publication date: 10 July 2012
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4419-9569-8_5
90C30: Nonlinear programming
65K10: Numerical optimization and variational techniques
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
49N15: Duality theory (optimization)
49M20: Numerical methods of relaxation type
Related Items
Imaging with highly incomplete and corrupted data, Regularity properties of non-negative sparsity sets, Restricted normal cones and sparsity optimization with affine constraints, A note on the complexity of \(L _{p }\) minimization, DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS, Maximum entropy and feasibility methods for convex and nonconvex inverse problems
Cites Work
- Unnamed Item
- Convex analysis and nonlinear optimization. Theory and examples.
- Exact matrix completion via convex optimization
- Sparse representations in unions of bases
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
- Linear Inversion of Band-Limited Reflection Seismograms
- Atomic Decomposition by Basis Pursuit
- Variational Analysis
- Relaxed averaged alternating reflections for diffraction imaging
- Sparse Approximate Solutions to Linear Systems
- Duality and Convex Programming
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
