论文信息 - Testing the definiteness of matrices on polyhedral cones

Testing the definiteness of matrices on polyhedral cones

Abstract The principal pivoting scheme for quadratic programming is used to derive finite criteria for testing whether a real symmetric matirx is nonnegative definite, nonnegative definite plus, or positive definite on a convex polyhedral cone. The paper is an extension of a recent one where the author gave criteria for different classes of copositive matrices.

H. Väliaho | H. Väliaho

[1] Hannu Väliaho,et al. A unified approach to one-parametric general quadratic programming , 1985, Math. Program..

[2] C. E. Lemke,et al. QUADRATIC FORMS SEMI-DEFINITE OVER CONVEX CONES. , 1967 .

[3] C. Panne. Methods for Linear and Quadratic Programming , 1975 .

[4] J. Crouzeix,et al. Definiteness and semidefiniteness of quadratic forms revisited , 1984 .

[5] G. Styan,et al. Equalities and Inequalities for Ranks of Matrices , 1974 .

[6] J. Dieudonne. Foundations of Modern Analysis , 1969 .

[7] R. Cottle. Manifestations of the Schur complement , 1974 .

[8] K. P. Hadeler,et al. On copositive matrices , 1983 .

[9] D. H. Jacobson,et al. Copositive matrices and definiteness of quadratic forms subject to homogeneous linear inequality constraints , 1981 .

[10] Edward L. Keller,et al. The general quadratic optimization problem , 1973, Math. Program..

[11] Richard W. Cottle,et al. On classes of copositive matrices , 1970 .

[12] D. H. Martin. Finite criteria for conditional definiteness of quadratic forms , 1981 .

[13] H. Väliaho,et al. Criteria for copositive matrices , 1986 .

[14] J. Telgen. Redundancy and linear programs , 1981 .

[15] Stanley Zionts,et al. Redundancy in Mathematical Programming , 1983 .

[16] Robert L. Graves,et al. A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming , 1967, Oper. Res..