Determining subspaces on which a matrix is nonnegative definite

DOI10.1016/0024-3795(92)90289-MzbMath0753.15013MaRDI QIDQ1189625

Hannu Väliaho

Publication date: 27 September 1992

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

zbMATH Keywords

subspaceeigenvaluesinertianonnegative definite matrixTest problems

Mathematics Subject Classification ID

Related Items (1)

Block pivoting and shortcut strategies for detecting copositivity

Cites Work

• Unnamed Item
• Unnamed Item
• Definiteness and semidefiniteness of quadratic forms revisited
• An inertia theorem for symmetric matrices and its application to nonlinear programming
• A quantitative formulation of Sylvester's law of inertia. III
• On inertia and Schur complement in optimization
• Testing the definiteness of matrices on polyhedral cones
• Restricted quadratic forms, inertia theorems, and the Schur complement
• Quadratic-programming criteria for copositive matrices
• Manifestations of the Schur complement
• Determination of the inertia of a partitioned Hermitian matrix
• A combinatorial approach to convex quadratic programming
• Local Duality of Nonlinear Programs
• The general quadratic optimization problem

This page was built for publication: Determining subspaces on which a matrix is nonnegative definite