✦ LIBER ✦

Analysis of a Quadratic Programming Decomposition Algorithm

✍ Scribed by Bencteux, G.; Cancés, E.; Hager, W. W.; Bris, C. Le

Book ID: 118184658
Publisher: Society for Industrial and Applied Mathematics
Year: 2010
Tongue: English
Weight: 316 KB
Volume: 47
Category: Article
ISSN: 0036-1429
DOI: 10.1137/070701728

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A decomposition algorithm for quadratic

A decomposition algorithm for quadratic programming

✍ Richard S. Sacher 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 696 KB

A quadratic programming algorithm

✍ M. J. Best; K. Ritter 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 820 KB

A quadratic programming algorithm

✍ Johan Philip 📂 Article 📅 1966 🏛 Springer 🌐 English ⚖ 764 KB

A new successive quadratic programming a

A new successive quadratic programming algorithm

✍ Zengxin Wei 📂 Article 📅 1992 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 416 KB

A new algorithm for quadratic programmin

A new algorithm for quadratic programming

✍ Tamás Terlaky 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 531 KB

We present a new finite algorithm for quadratic programming. Our algorithm is based on the solution procedures of linear programming (pivoting, Bland's rule, Hungarian Methods, criss-cross method), however this method does not require the enlargement of the basic tableau as Frank-Wolfe method does.

A decomposition method for structured qu

A decomposition method for structured quadratic programming problems

✍ K. Ritter 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 877 KB

This paper describes a decomposition method for large structured quadratic maximization problems. The method can be applied to problems which contain coupling constraints or coupling variables occurring in the objective function.