Parallel Interior Point Schemes for Solving Multistage Convex Programming
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...[Show more]
|Collections||ANU Research Publications|
|Source:||Annals of Operations Research|
|01_Hegland_Parallel_Interior_Point_2001.pdf||91.15 kB||Adobe PDF||Request a copy|
|02_Hegland_Parallel_Interior_Point_2001.pdf||91.15 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.