Minimal zero norm solutions of linear complementarity problems
From MaRDI portal
Recommendations
- Sparse solutions of linear complementarity problems
- Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem
- scientific article; zbMATH DE number 7668284
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
- A shrinkage-thresholding projection method for sparsest solutions of LCPs
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- A note on the complexity of \(L _{p }\) minimization
- An implementable active-set algorithm for computing a B-stationary point of a mathematical program with linear complementarity constraints
- Complementarity: applications, algorithms and extensions. Papers from the international conference on complementarity (ICCP 99), Madison, WI, USA, June 9--12, 1999
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- Mathematical Programs with Equilibrium Constraints
- New reformulations for stochastic nonlinear complementarity problems
- On sparse approximations to randomized strategies and convex combinations
- Randomized portfolio selection, with constraints
- Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
- Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization
- Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints
- Sparse Approximate Solutions to Linear Systems
- The Optimal Selection of Small Portfolios
Cited in
(16)- Newton method for \(\ell_0\)-regularized optimization
- Extragradient thresholding methods for sparse solutions of co-coercive ncps
- The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement
- A linearly convergent iterative method for identifying H-matrices
- The sparsest solutions to \(Z\)-tensor complementarity problems
- Newton hard-thresholding pursuit for sparse linear complementarity problem via a new merit function
- Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem
- Minimal realization in the max algebra is an extended linear complementarity problem
- An effective smoothing Newton projection algorithm for finding sparse solutions to NP-hard tensor complementarity problems
- Nonnegative iterative reweighted method for sparse linear complementarity problem
- Spectral residual methods with two new non-monotone line searches for large-scale nonlinear systems of equations
- Sparse solutions of linear complementarity problems
- A half thresholding projection algorithm for sparse solutions of LCPs
- Implicit solution function of P\(_{0}\) and Z matrix linear complementarity constraints
- Lagrangian duality and saddle points for sparse linear programming
- A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game
This page was built for publication: Minimal zero norm solutions of linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q481048)
