Newton method for the composite row sparsity regularized optimization
From MaRDI portal
Cites work
- $\ell_1$ Trend Filtering
- A variational approach to sparsity optimization based on Lagrange multiplier theory
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
- Adaptive piecewise polynomial estimation via trend filtering
- Analysis of financial time series
- Column \(\ell_{2,0}\)-norm regularized factorization model of low-rank matrix recovery and its computation
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 6982301 (Why is no real title available?)
- scientific article; zbMATH DE number 951459 (Why is no real title available?)
- scientific article; zbMATH DE number 7370526 (Why is no real title available?)
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Newton method for \(\ell_0\)-regularized optimization
- Non-convex total variation regularization for convex denoising of signals
- Nonlinear total variation based noise removal algorithms
- Proximal mapping for symmetric penalty and sparsity
- Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization
- Solution sets of three sparse optimization problems for multivariate regression
- Statistical foundations of data science
- Statistics for high-dimensional data. Methods, theory and applications.
- Variational Analysis
This page was built for publication: Newton method for the composite row sparsity regularized optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995150)
