Pages that link to "Item:Q2000528"

The following pages link to A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization (Q2000528):

Displaying 15 items.

• An effective optimization algorithm for locally nonconvex Lipschitz functions based on mollifier subgradients (Q648482) (← links)
• The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms (Q778013) (← links)
• Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization (Q1650690) (← links)
• An improved algorithm for the \(L_2-L_p\) minimization problem (Q1683685) (← links)
• An efficient and globally convergent algorithm for \(\ell_{p,q} - \ell_r\) model in group sparse optimization (Q1984711) (← links)
• Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm (Q2031758) (← links)
• Image retinex based on the nonconvex TV-type regularization (Q2063022) (← links)
• Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems (Q2089886) (← links)
• Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems (Q2105897) (← links)
• Image restoration via the adaptive \(TV^p\) regularization (Q2194779) (← links)
• Nonconvex piecewise-quadratic underestimation for global minimization (Q2494310) (← links)
• Proximal linearization methods for Schatten \(p\)-quasi-norm minimization (Q2678970) (← links)
• An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model ^* (Q5019920) (← links)
• A General Non-Lipschitz Infimal Convolution Regularized Model: Lower Bound Theory and Algorithm (Q5043740) (← links)
• A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal (Q5148413) (← links)