Entropy function-based algorithms for solving a class of nonconvex minimization problems
From MaRDI portal
Recommendations
- Iterative thresholding algorithm based on non-convex method for modified \(l_p\)-norm regularization minimization
- A maximum entropy function method for nonconvex optimization in compressed sensing
- A gradient descent based algorithm for \(\ell_p\) minimization
- An improved algorithm for the \(L_2-L_p\) minimization problem
- Entropic regularization of the \(\ell _{0}\) function
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A note on the complexity of \(L _{p }\) minimization
- An affine scaling methodology for best basis selection
- An aggregate function method for nonlinear programming
- An iterative algorithm for fitting nonconvex penalized generalized linear models with grouped predictors
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Approximation procedures based on the method of multipliers
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- L 1/2 regularization
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- On the convergence of the exponential multiplier method for convex programming
- On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Restricted isometry properties and nonconvex compressive sensing
- Reweighted \(\ell_1\)-minimization for sparse solutions to underdetermined linear systems
- Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Thresholding-based iterative selection procedures for model selection and shrinkage
Cited in
(8)- A maximum entropy function method for nonconvex optimization in compressed sensing
- Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem
- A gradient descent based algorithm for \(\ell_p\) minimization
- Minimization Problems Based on Relative <inline-formula> <tex-math notation="LaTeX">$\alpha $ </tex-math></inline-formula>-Entropy I: Forward Projection
- scientific article; zbMATH DE number 5524524 (Why is no real title available?)
- An entropy regularization technique for minimizing a sum of Tchebycheff norms
- Entropic regularization of the \(\ell _{0}\) function
- Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm
This page was built for publication: Entropy function-based algorithms for solving a class of nonconvex minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259115)
