Pages that link to "Item:Q3006142"
From MaRDI portal
The following pages link to Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization (Q3006142):
Displayed 50 items.
- An alternating direction method with continuation for nonconvex low rank minimization (Q257130) (← links)
- Entropy function-based algorithms for solving a class of nonconvex minimization problems (Q259115) (← links)
- A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem (Q292553) (← links)
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
- Sparse solutions of linear complementarity problems (Q312696) (← links)
- DC approximation approaches for sparse optimization (Q319281) (← links)
- Point source super-resolution via non-convex \(L_1\) based methods (Q333212) (← links)
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint (Q384213) (← links)
- Recovery of sparsest signals via \(\ell^q \)-minimization (Q413642) (← links)
- A unified algorithm for mixed \(l_{2,p}\)-minimizations and its application in feature selection (Q457211) (← links)
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming (Q463732) (← links)
- Global solutions of non-Lipschitz \(S_{2}\)-\(S_{p}\) minimization over the positive semidefinite cone (Q476270) (← links)
- Minimal zero norm solutions of linear complementarity problems (Q481048) (← links)
- A note on the smoothing quadratic regularization method for non-Lipschitz optimization (Q494677) (← links)
- Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization (Q742293) (← links)
- A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization (Q742307) (← links)
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach (Q742312) (← links)
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms (Q778013) (← links)
- Half thresholding eigenvalue algorithm for semidefinite matrix completion (Q887385) (← links)
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm (Q890292) (← links)
- Adaptive projected gradient thresholding methods for constrained \(l_0\) problems (Q892792) (← links)
- Iterative thresholding algorithm based on non-convex method for modified \(l_p\)-norm regularization minimization (Q1631426) (← links)
- Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization (Q1650690) (← links)
- The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\) (Q1666063) (← links)
- An improved algorithm for the \(L_2-L_p\) minimization problem (Q1683685) (← links)
- Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions (Q1683689) (← links)
- A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery (Q1687319) (← links)
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization (Q1694395) (← links)
- Affine matrix rank minimization problem via non-convex fraction function penalty (Q1696454) (← links)
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration (Q1716780) (← links)
- On monotone and primal-dual active set schemes for \(\ell^p\)-type problems, \(p \in (0,1]\) (Q1734767) (← links)
- Robust \(L_p\)-norm least squares support vector regression with feature selection (Q1735423) (← links)
- Iterative reweighted methods for \(\ell _1-\ell _p\) minimization (Q1753073) (← links)
- Recovery of seismic wavefields by an \(l_{q}\)-norm constrained regularization method (Q1785033) (← links)
- A truncation algorithm for minimizing the Frobenius-Schatten norm to find a sparse matrix (Q1792415) (← links)
- Restricted \(p\)-isometry properties of partially sparse signal recovery (Q1956098) (← links)
- A general truncated regularization framework for contrast-preserving variational signal and image restoration: motivation and implementation (Q1989900) (← links)
- A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization (Q2000528) (← links)
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems (Q2022292) (← links)
- Novel iterative ensemble smoothers derived from a class of generalized cost functions (Q2027194) (← links)
- Evaluating and selecting features via information theoretic lower bounds of feature inner correlations for high-dimensional data (Q2029330) (← links)
- Convergent inexact penalty decomposition methods for cardinality-constrained problems (Q2031962) (← links)
- New regularization method and iteratively reweighted algorithm for sparse vector recovery (Q2033724) (← links)
- Image retinex based on the nonconvex TV-type regularization (Q2063022) (← links)
- Robust distribution-based nonnegative matrix factorizations for dimensionality reduction (Q2123493) (← links)
- A truncated Newton algorithm for nonconvex sparse recovery (Q2143093) (← links)
- An interior stochastic gradient method for a class of non-Lipschitz optimization problems (Q2161545) (← links)
- A globally convergent algorithm for a constrained non-Lipschitz image restoration model (Q2173566) (← links)
