Entropic regularization of the _0 function
DOI10.1007/978-1-4419-9569-8_5zbMATH Open1357.49115OpenAlexW62292376MaRDI QIDQ2897276FDOQ2897276
Authors: 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
Recommendations
- Entropy function-based algorithms for solving a class of nonconvex minimization problems
- Sparse regularization with the ℓ0 norm
- Newton method for \(\ell_0\)-regularized optimization
- A smoothing method for sparse optimization over convex sets
- A smoothing method for sparse optimization over polyhedral sets
Numerical optimization and variational techniques (65K10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Nonlinear programming (90C30) Numerical methods of relaxation type (49M20) Duality theory (optimization) (49N15)
Cites Work
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Atomic Decomposition by Basis Pursuit
- Variational Analysis
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Exact matrix completion via convex optimization
- 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
- Convex functions. Constructions, characterizations and counterexamples
- Sparse Approximate Solutions to Linear Systems
- Sparse representations in unions of bases
- Convex analysis and nonlinear optimization. Theory and examples.
- Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
- Relaxed averaged alternating reflections for diffraction imaging
- Linear Inversion of Band-Limited Reflection Seismograms
- Duality and Convex Programming
Cited In (12)
- Entropy function-based algorithms for solving a class of nonconvex minimization problems
- Restricted normal cones and sparsity optimization with affine constraints
- A note on the complexity of \(L _{p }\) minimization
- Cardinality minimization, constraints, and regularization: a survey
- Sparse regularization with the ℓ0 norm
- Maximum entropy and feasibility methods for convex and nonconvex inverse problems
- Regularity properties of non-negative sparsity sets
- The Entropic Regularization of the Monge Problem on the Real Line
- Imaging with highly incomplete and corrupted data
- Entropic Regularization of NonGradient Systems
- Douglas-Rachford feasibility methods for matrix completion problems
- Forward mean proximal pairs and zero entropy
This page was built for publication: Entropic regularization of the \(\ell _{0}\) function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897276)
