Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A truncated Newton algorithm for nonconvex sparse recovery - MaRDI portal

A truncated Newton algorithm for nonconvex sparse recovery (Q2143093)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A truncated Newton algorithm for nonconvex sparse recovery	scientific article

Statements

scholarly article

0 references

A truncated Newton algorithm for nonconvex sparse recovery (English)

0 references

0 references

0 references

0 references

Applied Numerical Mathematics

0 references

publication date

30 May 2022

0 references

zbMATH Keywords

nonsmooth nonconvex penalty

0 references

sparse optimization

0 references

subspace optimization

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.apnum.2022.04.006

0 references

Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity

0 references

Fast Image Recovery Using Variable Splitting and Constrained Optimization

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization

0 references

From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images

0 references

Enhancing sparsity by reweighted \(\ell _{1}\) minimization

0 references

Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization

0 references

Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization

0 references

Gradient-based method with active set strategy for $\ell _1$ optimization

0 references

Benchmarking optimization software with performance profiles.

0 references

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

0 references

A Nonmonotone Line Search Technique for Newton’s Method

0 references

A truncated Newton method with non-monotone line search for unconstrained optimization

0 references

Gradient-Based Methods for Sparse Recovery

0 references

Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis

0 references

A unified primal dual active set algorithm for nonconvex sparse recovery

0 references

Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm

0 references

A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization

0 references

A coordinate gradient descent method for nonsmooth separable minimization

0 references

A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation

0 references

Sparse Reconstruction by Separable Approximation

0 references

Nearly unbiased variable selection under minimax concave penalty

0 references

The Adaptive Lasso and Its Oracle Properties

0 references

Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.APNUM.2022.04.006

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2143093

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2143093&oldid=38904365"