CP-rays in simplicial cones
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3982937 (Why is no real title available?)
- scientific article; zbMATH DE number 3799581 (Why is no real title available?)
- scientific article; zbMATH DE number 3212891 (Why is no real title available?)
- A critical index algorithm for nearest point problems on simplicial cones
- An algorithm for the linear complementarity problem
- Computational complexity of complementary pivot methods
- Erratum: Some Perturbation Theorems for Q-Matrices
- Finding the nearest point in A polytope
- Geometric Properties of Hidden Minkowski Matrices
- Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
- Monotone solutions of the parametric linear complementarity problem
- Q-matrices and spherical geometry
- Some Perturbation Theorems for Q-Matrices
- The Jacobian matrix and global univalence of mappings
- The steepest descent gravitational method for linear programming
Cited in
(7)- On highly eccentric cones
- Some LCPs solvable in strongly polynomial time with Lemke's algorithm
- Conic version of Loewner-John ellipsoid theorem
- Good hidden \(P\)-matrix sandwiches
- Extended \(P\)-pairs
- The extreme rays of the \(5 \times 5\) copositive cone
- A class of polynomially solvable linear complementarity problems
This page was built for publication: CP-rays in simplicial cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q811413)