𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A decomposition algorithm for quadratic programming

✍ Scribed by Richard S. Sacher

Publisher
Springer-Verlag
Year
1980
Tongue
English
Weight
696 KB
Volume
18
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A quadratic programming algorithm
A quadratic programming algorithm
✍ M. J. Best; K. Ritter πŸ“‚ Article πŸ“… 1988 πŸ› Springer 🌐 English βš– 820 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.

An algorithm for quadratic programming
An algorithm for quadratic programming
✍ Marguerite Frank; Philip Wolfe πŸ“‚ Article πŸ“… 1956 πŸ› John Wiley and Sons 🌐 English βš– 744 KB

Pr in c e t o n Un i v e r s i t y A finite iteration method for calculating the solution of quadratic Extensions to m o r e general nonprogramming problems is described.r linear Droblems a r e suggested.

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.