On hidden Z-matrix and interior point algorithm
From MaRDI portal
On hidden \(Z\)-matrix and interior point algorithm
Recommendations
- More on hidden Z-matrices and linear complementarity problem
- On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem
- On some classes of matrices related to solving linear complementarity problems as linear programs
- scientific article; zbMATH DE number 6020688
- Good hidden \(P\)-matrix sandwiches
Cites work
- An interior point potential reduction algorithm for the linear complementarity problem
- Finiteness of Criss-Cross Method in Complementarity Problem
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- Linear complementarity problems solvable by A single linear program
- Polyhedral sets having a least element
Cited in
(13)- On some classes of matrices related to solving linear complementarity problems as linear programs
- On column competent matrices and linear complementarity problem
- A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps
- More on hidden Z-matrices and linear complementarity problem
- On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem
- Bounded homotopy path approach to the solution of linear complementarity problems
- On some properties of \(K\)-type block matrices in the context of complementarity problem
- On some properties of S-tensor
- New accelerated modulus-based iteration method for solving large and sparse linear complementarity problem
- On the solution set of semi-infinite tensor complementarity problem
- Error bound for the linear complementarity problem using plus function
- More on semipositive tensor and tensor complementarity problem
- On some properties of \({\omega}\)-uniqueness in tensor complementarity problem
This page was built for publication: On hidden \(Z\)-matrix and interior point algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009197)
