Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem
From MaRDI portal
Publication:6111359
DOI10.1007/s10915-023-02249-8zbMath1522.90193OpenAlexW4380790226MaRDI QIDQ6111359
Publication date: 6 July 2023
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-023-02249-8
nonsmooth optimizationconvergence ratesmoothing methodaccelerated algorithm with extrapolationcardinality penalty
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Numerical methods based on nonlinear programming (49M37)
Cites Work
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Gradient methods for minimizing composite functions
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Smoothing methods for nonsmooth, nonconvex minimization
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- A bilinear formulation for vector sparsity optimization
- On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems
- A smoothing proximal gradient algorithm for matrix rank minimization problem
- Variable smoothing for convex optimization problems using stochastic gradients
- An extension of the second order dynamical system that models Nesterov's convex gradient method
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$
- A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
- Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
- Smoothing Techniques for Computing Nash Equilibria of Sequential Games
- A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
- Local Strong Homogeneity of a Regularized Estimator
- Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Matching pursuits with time-frequency dictionaries
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Smoothing accelerated algorithm for constrained nonsmooth convex optimization problems
- Finite Convergence of Proximal-Gradient Inertial Algorithms Combining Dry Friction with Hessian-Driven Damping
- Accelerated dual-averaging primal–dual method for composite convex minimization
- Contracting Proximal Methods for Smooth Convex Optimization
- Newton-like Inertial Dynamics and Proximal Algorithms Governed by Maximally Monotone Operators
- A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
- Sparse Approximation via Penalty Decomposition Methods
- Signal Recovery by Proximal Forward-Backward Splitting
- High Dimensional Thresholded Regression and Shrinkage Effect
- Compressed sensing
This page was built for publication: Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem