CP-rays in simplicial cones

DOI10.1007/BF01582265zbMath0734.90097OpenAlexW2067991980MaRDI QIDQ811413

Leroy M. Kelly, Layne T. Watson, Katta G. Murty

Publication date: 1990

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582265

zbMATH Keywords

positive definite matricessimplicial conesP-matricesCP-pointZ- matrices

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (6)

Extended \(P\)-pairs ⋮ Some LCPs solvable in strongly polynomial time with Lemke's algorithm ⋮ On highly eccentric cones ⋮ A class of polynomially solvable linear complementarity problems ⋮ Good hidden \(P\)-matrix sandwiches ⋮ Conic version of Loewner-John ellipsoid theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The steepest descent gravitational method for linear programming
• Q-matrices and spherical geometry
• The Jacobian matrix and global univalence of mappings
• Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
• Geometric Properties of Hidden Minkowski Matrices
• A critical index algorithm for nearest point problems on simplicial cones
• Finding the nearest point in A polytope
• Some Perturbation Theorems for Q-Matrices
• Erratum: Some Perturbation Theorems for Q-Matrices
• Computational complexity of complementary pivot methods
• An algorithm for the linear complementarity problem
• Monotone solutions of the parametric linear complementarity problem

This page was built for publication: CP-rays in simplicial cones