A finite procedure for determining if a quadratic form is bounded below on a closed polyhedral convex set

DOI10.1007/BF01588957zbMath0378.90077OpenAlexW2067085289MaRDI QIDQ4159182

B. Curtis Eaves

Publication date: 1978

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01588957

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items (8)

Formulation of linear problems and solution by a universal machine ⋮ Finite criteria for conditional definiteness of quadratic forms ⋮ Algebra -- 9. Translated from the Russian ⋮ Bitopological spaces ⋮ An alternative method for a global analysis of quadratic programs in a finite number of steps ⋮ Investigations in topology. 9. Work collection ⋮ Conditionally definite matrices ⋮ Bitopologies on products and ratios

This page was built for publication: A finite procedure for determining if a quadratic form is bounded below on a closed polyhedral convex set