Pages that link to "Item:Q2665935"
From MaRDI portal
The following pages link to Newton method for \(\ell_0\)-regularized optimization (Q2665935):
Displaying 15 items.
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem (Q890462) (← links)
- Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem (Q2072164) (← links)
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems (Q2079693) (← links)
- A Lagrange-Newton algorithm for sparse nonlinear programming (Q2089792) (← links)
- A data-driven line search rule for support recovery in high-dimensional data analysis (Q2157522) (← links)
- The minimal-norm Gauss-Newton method and some of its regularized variants (Q2203382) (← links)
- An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization (Q2307750) (← links)
- Newton-type optimal thresholding algorithms for sparse optimization problems (Q2676159) (← links)
- Newton-type Alternating Minimization Algorithm for Convex Optimization (Q4629822) (← links)
- Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems (Q5093646) (← links)
- Inexact Newton Regularization Using Conjugate Gradients as Inner Iteration (Q5700285) (← links)
- Proximal variable metric method with spectral diagonal update for large scale sparse optimization (Q6099831) (← links)
- A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems (Q6116248) (← links)
- Convergence properties of stochastic proximal subgradient method in solving a class of composite optimization problems with cardinality regularizer (Q6536946) (← links)
- Subspace Newton method for sparse group \(\ell_0\) optimization problem (Q6607024) (← links)
