Pages that link to "Item:Q2330642"
From MaRDI portal
The following pages link to Optimization problems involving group sparsity terms (Q2330642):
Displaying 12 items.
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
- Subspace quadratic regularization method for group sparse multinomial logistic regression (Q2044487) (← links)
- Nonconvex flexible sparsity regularization: theory and monotone numerical schemes (Q5077167) (← links)
- Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems (Q5093646) (← links)
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions (Q5860273) (← links)
- Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm (Q6043130) (← links)
- Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training (Q6076869) (← links)
- Constrained composite optimization and augmented Lagrangian methods (Q6110459) (← links)
- A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems (Q6116248) (← links)
- A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems (Q6154406) (← links)
- Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability (Q6161546) (← links)
- A Path-Based Approach to Constrained Sparse Optimization (Q6202768) (← links)
