Entropy function-based algorithms for solving a class of nonconvex minimization problems
DOI10.1007/S40305-015-0103-1zbMATH Open1332.90210OpenAlexW2174437456MaRDI QIDQ259115FDOQ259115
Authors: Yu-Fan Li, Zhenghai Huang, Min Zhang 
Publication date: 11 March 2016
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-015-0103-1
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
Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- An affine scaling methodology for best basis selection
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization
- Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
- On the convergence of the exponential multiplier method for convex programming
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- An aggregate function method for nonlinear programming
- Approximation procedures based on the method of multipliers
- An iterative algorithm for fitting nonconvex penalized generalized linear models with grouped predictors
- Thresholding-based iterative selection procedures for model selection and shrinkage
- Complexity of unconstrained \(L_2 - L_p\) minimization
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Restricted isometry properties and nonconvex compressive sensing
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- L 1/2 regularization
- A note on the complexity of \(L _{p }\) minimization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems
Cited In (6)
- Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem
- An entropy regularization technique for minimizing a sum of Tchebycheff norms
- Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm
- Title not available (Why is that?)
- Minimization Problems Based on Relative <inline-formula> <tex-math notation="LaTeX">$\alpha $ </tex-math></inline-formula>-Entropy I: Forward Projection
- Entropic regularization of the \(\ell _{0}\) function
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)
