Accelerated nonnegative proximal gradient algorithm for sparse linear complementarity problem
From MaRDI portal
No records found.
Cites work
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A half thresholding projection algorithm for sparse solutions of LCPs
- A nonconvex model with minimax concave penalty for image restoration
- A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem
- Analytical convergence regions of accelerated gradient descent in nonconvex optimization under regularity condition
- Convergence analysis of iteratively reweighted _1 algorithms for computing the proximal operator of _p-norm
- Crack identification in two-dimensional unilateral contact mechanics with the boundary element method
- First-order methods in optimization
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
- scientific article; zbMATH DE number 6982922 (Why is no real title available?)
- Iterative positive thresholding algorithm for non-negative sparse optimization
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Iterative thresholding for sparse approximations
- L 1/2 regularization
- Minimal zero norm solutions of linear complementarity problems
- New constrained optimization reformulation of complementarity problems
- New NCP-functions and their properties
- Newton hard-thresholding pursuit for sparse linear complementarity problem via a new merit function
- Nonnegative iterative reweighted method for sparse linear complementarity problem
- On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization
- On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke's method
- On unconstrained and constrained stationary points of the implicit Lagrangian
- Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Sparse solutions of linear complementarity problems
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Stationary points of bound constrained minimization reformulations of complementarity problems
- The Linear Complementarity Problem
- The proximity operator of the log-sum penalty
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(2)
This page was built for publication: Accelerated nonnegative proximal gradient algorithm for sparse linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307979)
