The error bounds of linear and tensor complementarity problems
From MaRDI portal
Cites work
- AN ENCLOSURE METHOD FOR FREE BOUNDARY PROBLEMS BASED ON A LINEAR COMPLEMENTARITY PROBLEM WITH INTERVAL DATA*
- Computation of error bounds for P-matrix linear complementarity problems
- Equivalence of the generalized complementarity problem to differentiable unconstrained minimization
- Error bounds for the linear complementarity problem with a P-matrix
- Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
- Global error bound for the vertical tensor complementarity problem
- Global error bounds for the extended vertical LCP
- Global error bounds for the tensor complementarity problem with a \(P\)-tensor
- Global uniqueness and solvability for tensor complementarity problems
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 1059222 (Why is no real title available?)
- Modulus-based matrix splitting iteration methods for linear complementarity problems.
- On error bounds of polynomial complementarity problems with structured tensors
- Perturbation Bounds of P-Matrix Linear Complementarity Problems
- Properties of tensor complementarity problem and some classes of structured tensors
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- Some perturbation bounds of the tensor complementarity problem
- Tensor complementarity problems. I: Basic theory
- Tensor complementarity problems. III: Applications
- The GUS-property and modulus-based methods for tensor complementarity problems
- The perturbation bound of the extended vertical linear complementarity problem
- Two-person nonzero-sum games and quadratic programming
This page was built for publication: The error bounds of linear and tensor complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6850181)
