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

Simple method of solving an auxiliary quadratic programming problem

โœ Scribed by V. N. Gordeev

Publisher
Springer US
Year
1981
Tongue
English
Weight
297 KB
Volume
16
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Solving nonlinearly constrained global o
Solving nonlinearly constrained global optimization problem via an auxiliary function method
โœ Wenxing Zhu; M.M. Ali ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 752 KB

This paper considers the nonlinearly constrained continuous global minimization problem. Based on the idea of the penalty function method, an auxiliary function, which has approximately the same global minimizers as the original problem, is constructed. An algorithm is developed to minimize the auxi

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