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
โฆ LIBER โฆ
Quadratic regularizations in an interior-point method for primal block-angular problems
โ Scribed by Jordi Castro; Jordi Cuesta
- Publisher
- Springer-Verlag
- Year
- 2010
- Tongue
- English
- Weight
- 458 KB
- Volume
- 130
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Parallel computational issues of an inte
โ
M. DโApuzzo; M. Marino
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 181 KB
Primal-Dual Interior-Point Method for an
โ
N. R. Amundson; A. Caboussat; J. W. He; J. H. Seinfeld
๐
Article
๐
2006
๐
Springer
๐
English
โ 522 KB
Using an interior point method for the m
โ
J. Gondzio; R. Sarkissian; J.-P. Vial
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 764 KB
We addres some of the issues that arise when an interior point method is used to handle the master problem in a decomposition approach. The main points concern the efficient exploitation of the special structure of the master problem to reduce the cost of a single interior point iteration. The parti
An interior penalty function method for
โ
Ronald J Stern; Adi Ben-Israel
๐
Article
๐
1974
๐
Elsevier Science
๐
English
โ 363 KB