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

DOI10.1007/BF01588957MaRDI QIDQ4159182zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4159182)