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

KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems

โœ Scribed by Lu, Cheng; Fang, Shu-Cherng; Jin, Qingwei; Wang, Zhenbo; Xing, Wenxun

Book ID
118203680
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
220 KB
Volume
21
Category
Article
ISSN
1052-6234

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Parallel computational issues of an inte
Parallel computational issues of an interior point method for solving large bound-constrained quadratic programming problems
โœ M. Dโ€™Apuzzo; M. Marino ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 181 KB

This paper deals with a parallel implementation of an interior point algorithm for solving sparse convex quadratic programs with bound constraints. The parallelism is introduced at the linear algebra level. Concerning the solution of the linear system arising at each step of the considered algorithm