Criteria for copositive matrices
From MaRDI portal
Publication:1079631
DOI10.1016/0024-3795(86)90246-6zbMath0598.15017OpenAlexW2049231822MaRDI QIDQ1079631
Publication date: 1986
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(86)90246-6
Related Items
Cutting planes for semidefinite relaxations based on triangle-free subgraphs, Tensor complementarity problem and semi-positive tensors, Criteria for copositive matrices using simplices and barycentric coordinates, Testing the definiteness of matrices on polyhedral cones, On monotonicity and search strategies in face-based copositivity detection algorithms, Properties of some matrix classes based on principal pivot transform, Copositive matrices and Simpson's paradox, Almost copositive matrices, Necessary and sufficient conditions for copositive tensors, Symmetric nonnegative tensors and copositive tensors, Separation and relaxation for cones of quadratic forms, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, The inverse of a symmetric nonnegative matrix can be copositive, Sufficient conditions to be exceptional, An algorithm for determining copositive matrices, Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision, On generalizations of positive subdefinite matrices and the linear complementarity problem, Inheritance and inverse monotonicity properties of copositive matrices, On almost type classes of matrices withQ-property, Almost definiteness of matrices on polyhedral cones, Algebra -- 9. Translated from the Russian, Copositivity and sparsity relations using spectral properties, A note on weakly active constraints in connection with nonconvex quadratic programming, Analytical expressions of copositivity for fourth-order symmetric tensors, Algorithmic copositivity detection by simplicial partition, Algorithms for determining the copositivity of a given symmetric matrix, Bitopological spaces, On the classes of fully copositive and fully semimonotone matrices, Copositive realxation for genera quadratic programming, Spectral theory of copositive matrices, Unnamed Item, Principal pivot transforms of some classes of matrices, A copositivity probe, Copositivity tests based on the linear complementarity problem, Linear preservers of copositive matrices, On the numerical realization of the exact penalty method for quadratic programming algorithms, Unnamed Item, More tight monomials in quantized enveloping algebras, Depth-first simplicial partition for copositivity detection, with an application to MaxClique, Quadratic-programming criteria for copositive matrices, Remarks on second-order conditions in connection with the algorithm of Beale for quadratic programming, Linear mappings preserving the copositive cone, Investigations in topology. 9. Work collection, Conditionally definite matrices, Bitopologies on products and ratios, Block pivoting and shortcut strategies for detecting copositivity, A test for copositive matrices, The copositive completion problem, Criteria for copositive matrices of order four
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On copositive matrices
- Manifestations of the Schur complement
- On copositive matrices with -1, 9, 1 entries
- Determination of the inertia of a partitioned Hermitian matrix
- On classes of copositive matrices
- Matrix-theoretic criteria for the quasi-convexity and pseudo-convexity of quadratic functions
- The general quadratic optimization problem
- A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
