Pages that link to "Item:Q4595956"

The following pages link to Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization (Q4595956):

Displaying 11 items.

• A proximal difference-of-convex algorithm with extrapolation (Q1744881) (← links)
• On the discontinuity of images recovered by noncovex nonsmooth regularized isotropic models with box constraints (Q2000487) (← links)
• Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods (Q2052389) (← links)
• Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems (Q2105897) (← links)
• An interior stochastic gradient method for a class of non-Lipschitz optimization problems (Q2161545) (← links)
• Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem (Q2307753) (← links)
• Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649) (← links)
• Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm (Q6043130) (← links)
• Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints (Q6051303) (← links)
• Smoothing neural network for \(L_0\) regularized optimization problem with general convex constraints (Q6055122) (← links)
• Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem (Q6111359) (← links)