A gradient descent based algorithm for _p minimization
From MaRDI portal
Publication:2286916
Recommendations
- An improved algorithm for the \(L_2-L_p\) minimization problem
- Entropy function-based algorithms for solving a class of nonconvex minimization problems
- A note on the complexity of \(L _{p }\) minimization
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- A gradient based method for the \(L_{2}-L_{1/2}\) minimization and application to compressive sensing
Cites work
- A note on the complexity of \(L _{p }\) minimization
- A smoothing SQP framework for a class of composite L_q minimization over polyhedron
- An improved algorithm for the \(L_2-L_p\) minimization problem
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Compressed sensing
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Improved iteratively reweighted least squares for unconstrained smoothed _q minimization
- Lower bound theory of nonzero entries in solutions of _2-_p minimization
- Matrix-free interior point method for compressed sensing problems
- Maximum correntropy criterion based sparse adaptive filtering algorithms for robust channel estimation under non-Gaussian environments
- Probing the Pareto frontier for basis pursuit solutions
Cited in
(17)- An improved algorithm for the \(L_2-L_p\) minimization problem
- A unifying analysis of projected gradient descent for \(\ell_p\)-constrained least squares
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- Entropy function-based algorithms for solving a class of nonconvex minimization problems
- A new hybrid l_p-l₂ model for sparse solutions with applications to image processing
- Lower bound theory of nonzero entries in solutions of _2-_p minimization
- scientific article; zbMATH DE number 4137532 (Why is no real title available?)
- scientific article; zbMATH DE number 94238 (Why is no real title available?)
- A gradient based method for the \(L_{2}-L_{1/2}\) minimization and application to compressive sensing
- Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model
- Iterative gradient descent for outlier detection
- Gradient iteration with \(\ell _{p}\)-norm constraints
- Minimizing theL∞Norm of the Gradient with an Energy Constraint
- A note on the complexity of \(L _{p }\) minimization
- Constrained optimization involving nonconvex _p norms: optimality conditions, algorithm and convergence
- Smoothed hybrid l_p-l₂ model for sparse optimization
- A sparsity-driven solution method for the cardinality constrained mean-variance portfolio selection problem
This page was built for publication: A gradient descent based algorithm for \(\ell_p\) minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286916)
