Please use this identifier to cite or link to this item:
|Title:||Parallel Interior Point Schemes for Solving Multistage Convex Programming|
|Keywords:||Interior point methods|
|Citation:||Hegland, M., Osborne, M.R., Sun, J. (2001). Parallel Interior Point Schemes for Solving Multistage Convex Programming. Annals of Operations Research 108 (1-4) : 75-85. ScholarBank@NUS Repository. https://doi.org/10.1023/A:1016098709653|
|Abstract:||The predictor-corrector interior-point path-following algorithm is promising in solving multistage convex programming problems. Among many other general good features of this algorithm, especially attractive is that the algorithm allows possibility to parallelise the major computations. The dynamic structure of the multistage problems specifies a block-tridiagonal system at each Newton step of the algorithm. A wrap-around permutation is then used to implement the parallel computation for this step.|
|Source Title:||Annals of Operations Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 16, 2019
WEB OF SCIENCETM
checked on Jan 7, 2019
checked on Dec 8, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.