Testing the definiteness of matrices on polyhedral cones
From MaRDI portal
Publication:1104045
zbMath0646.65039MaRDI QIDQ1104045
Publication date: 1988
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
quadratic programmingnumerical examplesconvex polyhedral conedefiniteness of matricesprincipal pivoting scheme
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (17)
Criteria for copositive matrices using simplices and barycentric coordinates ⋮ Almost copositive matrices ⋮ Copositive optimization -- recent developments and applications ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ An algorithm for determining copositive matrices ⋮ Matrix criteria for the pseudo-P-convexity of a quadratic form ⋮ Almost definiteness of matrices on polyhedral cones ⋮ Algebra -- 9. Translated from the Russian ⋮ Determining subspaces on which a matrix is nonnegative definite ⋮ Algorithmic copositivity detection by simplicial partition ⋮ Bitopological spaces ⋮ Copositive Lyapunov functions for switched systems over cones ⋮ Quadratic-programming criteria for copositive matrices ⋮ Investigations in topology. 9. Work collection ⋮ Conditionally definite matrices ⋮ Bitopologies on products and ratios ⋮ Block pivoting and shortcut strategies for detecting copositivity
Cites Work
- Redundancy in mathematical programming. A state-of-the-art survey
- Definiteness and semidefiniteness of quadratic forms revisited
- Criteria for copositive matrices
- Copositive matrices and definiteness of quadratic forms subject to homogeneous linear inequality constraints
- Finite criteria for conditional definiteness of quadratic forms
- On copositive matrices
- Manifestations of the Schur complement
- On classes of copositive matrices
- A unified approach to one-parametric general quadratic programming
- The general quadratic optimization problem
- A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Testing the definiteness of matrices on polyhedral cones
