An alternative method for a global analysis of quadratic programs in a finite number of steps

DOI10.1007/BF01609005zbMath0389.90077OpenAlexW2046548674MaRDI QIDQ4171874

A. F. Perold

Publication date: 1978

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

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

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items (11)

Finite criteria for conditional definiteness of quadratic forms ⋮ Optimality conditions and strong duality in abstract and continuous-time linear programming ⋮ A simplex based algorithm to solve separated continuous linear programs ⋮ Algebra -- 9. Translated from the Russian ⋮ Higher order Moreau's sweeping process: mathematical formulation and numerical simulation ⋮ Bitopological spaces ⋮ A recurrence method for a special class of continuous time linear programming problems ⋮ Investigations in topology. 9. Work collection ⋮ Conditionally definite matrices ⋮ Bitopologies on products and ratios ⋮ Solving staircase linear programs by the simplex method, 1: Inversion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A finite procedure for determining if a quadratic form is bounded below on a closed polyhedral convex set
• On Quadratic Programming

This page was built for publication: An alternative method for a global analysis of quadratic programs in a finite number of steps