Pages that link to "Item:Q1683685"

The following pages link to An improved algorithm for the \(L_2-L_p\) minimization problem (Q1683685):

Displaying 12 items.

• Entropy function-based algorithms for solving a class of nonconvex minimization problems (Q259115) (← links)
• A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
• Iterative thresholding algorithm based on non-convex method for modified \(l_p\)-norm regularization minimization (Q1631426) (← links)
• Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis (Q1734769) (← links)
• A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization (Q2000528) (← links)
• An interior stochastic gradient method for a class of non-Lipschitz optimization problems (Q2161545) (← links)
• A gradient descent based algorithm for \(\ell_p\) minimization (Q2286916) (← links)
• Note on time bounds of two-phase algorithms for \(L\)-convex function minimization (Q2400167) (← links)
• Iterative positive thresholding algorithm for non-negative sparse optimization (Q4559400) (← links)
• A new algorithm for minimax and<i>l</i>₁-norm optimization (Q4944416) (← links)
• Sparse Solutions by a Quadratically Constrained ℓq (0 &lt;<i>q</i>&lt; 1) Minimization Model (Q4995085) (← links)
• Complexity of finite-sum optimization with nonsmooth composite functions and non-Lipschitz regularization (Q6579994) (← links)