Pages that link to "Item:Q481048"
From MaRDI portal
The following pages link to Minimal zero norm solutions of linear complementarity problems (Q481048):
Displaying 12 items.
- A half thresholding projection algorithm for sparse solutions of LCPs (Q497459) (← links)
- The sparsest solutions to \(Z\)-tensor complementarity problems (Q519760) (← links)
- Spectral residual methods with two new non-monotone line searches for large-scale nonlinear systems of equations (Q668640) (← links)
- Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem (Q1993073) (← links)
- Lagrangian duality and saddle points for sparse linear programming (Q2010427) (← links)
- Extragradient thresholding methods for sparse solutions of co-coercive ncps (Q2260937) (← links)
- Newton method for \(\ell_0\)-regularized optimization (Q2665935) (← links)
- A linearly convergent iterative method for identifying H-matrices (Q5240730) (← links)
- Newton Hard-Thresholding Pursuit for Sparse Linear Complementarity Problem via A New Merit Function (Q5857635) (← links)
- A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game (Q6049293) (← links)
- Nonnegative iterative reweighted method for sparse linear complementarity problem (Q6577600) (← links)
- An effective smoothing Newton projection algorithm for finding sparse solutions to NP-hard tensor complementarity problems (Q6582027) (← links)
