Linear-time algorithm for verifying the copositivity of an acyclic matrix

Computational Mathematics and Mathematical Physics

Volumn 42, Issue 12, 2002, Pages 1701-1703

  Ikramov, Kh D ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38849207529     PISSN: 09655425     EISSN: 15556662     Source Type: Journal    
DOI: None     Document Type: Article

References (7)

1. Murty, K.G. and Kabadi, S.N., Some NP-Complete Problems in Quadratic and Nonlinear Programming, Math. Progr., 1987, vol. 39, pp. 117-129.
2. Bomze, I.M., Linear-time Copositivity Detection for Tridiagonal Matrices and Extension to Block-Tridiagonality, SIAM J. Matrix Anal. Appl., 2000, vol. 21, no. 3, pp. 840-848.
3. Parter, S.V., The Use of Linear Graphs in Gauss Elimination, SIAM Rev., 1961, vol. 3, pp. 119-130.
4. George, A. and Liu, J., Computer Solution of Large Sparse Positive Definite Systems, Englewood Cliffs: Prentice Hall, 1981. Translated under the title Chislennoe reshenie bol'shikh razrezhennykh polozhitel'no opredelennykh sistem, Moscow: Mir, 1984.
5. Li, P. and Feng, Y.Y., Criteria for Copositive Matrices of Order Four, Linear Algebra Appl., 1993, vol. 194, pp. 109-124.
6. Bomze, I.M., Remarks on the Recursive Structure of Copositivity, J. Inf. Optimizat. Sci., 1987, vol. 8, pp. 243-260.
7. Bomze, I.M., Block Pivoting and Shortcut Strategies for Detecting Copositivity, Linear Algebra Appl., 1996, vol. 248, pp. 161-184.