๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Identifying non-active restrictions in convex quadratic programming

โœ Scribed by Peter Recht

Book ID
105857775
Publisher
Springer
Year
2001
Tongue
English
Weight
103 KB
Volume
54
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Identifying the optimal partition in con
Identifying the optimal partition in convex quadratic programming
โœ Stephen E. Wright ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 131 KB

Given an optimal solution for a convex quadratic programming (QP) problem, the optimal partition of the QP can be computed by solving a pair of linear or QP problems for which nearly optimal solutions are known.