Pages that link to "Item:Q644905"

The following pages link to A note on the complexity of \(L _{p }\) minimization (Q644905):

Displaying 50 items.

• Entropy function-based algorithms for solving a class of nonconvex minimization problems (Q259115) (← links)
• Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization (Q263209) (← 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)
• CVaR (superquantile) norm: stochastic case (Q320902) (← links)
• Recent advances in mathematical programming with semi-continuous variables and cardinality constraint (Q384213) (← links)
• Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\) (Q479885) (← 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)
• Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\) (Q650241) (← links)
• Restricted \(p\)-isometry property and its application for nonconvex compressive sensing (Q695638) (← 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)
• Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach (Q742312) (← links)
• Local search methods for \(\ell_{1}\)-minimization in frame based signal compression (Q833415) (← links)
• A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery (Q905912) (← links)
• A joint matrix minimization approach for multi-image face recognition (Q1656900) (← links)
• An improved algorithm for the \(L_2-L_p\) minimization problem (Q1683685) (← links)
• Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization (Q1688516) (← links)
• Univariate \(L^p\) and \(l^p\) averaging, \(0<p<1\), in polynomial time by utilization of statistical structure (Q1736520) (← links)
• Spark-level sparsity and the \(\ell_1\) tail minimization (Q1748258) (← links)
• On finding a generalized lowest rank solution to a linear semi-definite feasibility problem (Q1785372) (← links)
• Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays (Q1929588) (← links)
• Restricted \(p\)-isometry properties of partially sparse signal recovery (Q1956098) (← links)
• Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems (Q2022292) (← links)
• Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems (Q2026765) (← links)
• New regularization method and iteratively reweighted algorithm for sparse vector recovery (Q2033724) (← links)
• Large deviations for stochastic fluid networks with Weibullian tails (Q2095026) (← links)
• A solution approach for cardinality minimization problem based on fractional programming (Q2168753) (← links)
• A nonconvex \(l_1 (l_1-l_2)\) model for image restoration with impulse noise (Q2178405) (← links)
• A smoothing method for sparse optimization over convex sets (Q2191281) (← links)
• Block-sparse recovery of semidefinite systems and generalized null space conditions (Q2197151) (← links)
• The complexity results of the sparse optimization problems and reverse convex optimization problems (Q2228394) (← links)
• Relating \(\ell_p\) regularization and reweighted \(\ell_1\) regularization (Q2230788) (← links)
• The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement (Q2251573) (← links)
• A reweighted nuclear norm minimization algorithm for low rank matrix recovery (Q2252420) (← links)
• A gradient descent based algorithm for \(\ell_p\) minimization (Q2286916) (← links)
• On sparse beamformer design with reverberation (Q2295315) (← links)
• Queue length asymptotics for the multiple-server queue with heavy-tailed Weibull service times (Q2297808) (← links)
• An interior point method for \(L_{1 / 2}\)-SVM and application to feature selection in classification (Q2336857) (← links)
• On the entropy of couplings (Q2346421) (← links)
• Rank-one and sparse matrix decomposition for dynamic MRI (Q2353466) (← links)
• Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization (Q2374365) (← links)
• Note on time bounds of two-phase algorithms for \(L\)-convex function minimization (Q2400167) (← links)
• Complexity of unconstrained \(L_2 - L_p\) minimization (Q2436652) (← links)
• Nonconvex sorted \(\ell_1\) minimization for sparse approximation (Q2516375) (← links)
• Smoothing strategy along with conjugate gradient algorithm for signal reconstruction (Q2660684) (← links)
• The equivalence of three types of error bounds for weakly and approximately convex functions (Q2671442) (← links)
• Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations (Q2672063) (← links)
• Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems (Q2688921) (← links)