Pages that link to "Item:Q5093646"

The following pages link to Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems (Q5093646):

Displaying 16 items.

• Optimality conditions for locally Lipschitz optimization with \(l_0\)-regularization (Q1996752) (← links)
• High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
• Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems (Q2026765) (← links)
• Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring (Q2185626) (← links)
• An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization (Q2307750) (← links)
• Newton method for \(\ell_0\)-regularized optimization (Q2665935) (← links)
• A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem (Q2696923) (← links)
• (Q5037987) (← links)
• Equivalent Lipschitz optimization model for the group zero-norm regularized problem (Q5197268) (← links)
• Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm (Q6043130) (← links)
• Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates (Q6051201) (← links)
• A wonderful triangle in compressed sensing (Q6122304) (← links)
• Convergence properties of stochastic proximal subgradient method in solving a class of composite optimization problems with cardinality regularizer (Q6536946) (← links)
• Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems (Q6569683) (← links)
• Smoothing composite proximal gradient algorithm for sparse group Lasso problems with nonsmooth loss functions (Q6584749) (← links)
• Subspace Newton method for sparse group \(\ell_0\) optimization problem (Q6607024) (← links)