Almost definiteness of matrices on polyhedral cones

DOI10.1016/0024-3795(92)90006-VzbMath0757.15018OpenAlexW2063005030MaRDI QIDQ1183149

Hannu Väliaho

Publication date: 28 June 1992

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(92)90006-v

zbMATH Keywords

quadratic programmingquadratic formsprincipal pivotingalmost definite matricesconditional definitenessnonnegative polyhedral cone

Mathematics Subject Classification ID

Quadratic programming (90C20) Positive matrices and their generalizations; cones of matrices (15B48) Quadratic and bilinear forms, inner products (15A63)

Cites Work

• Unnamed Item
• Unnamed Item
• Criteria for copositive matrices
• Testing the definiteness of matrices on polyhedral cones
• Almost copositive matrices
• Manifestations of the Schur complement
• Determination of the inertia of a partitioned Hermitian matrix
• On classes of copositive matrices
• A combinatorial approach to convex quadratic programming
• On a Conjecture of L. J. Mordell Regarding an Inequality Involving Quadratic Forms
• Least-index resolution of degeneracy in quadratic programming
• The general quadratic optimization problem

This page was built for publication: Almost definiteness of matrices on polyhedral cones