Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Parallel Interior Point Schemes for Solving Multistage Convex Programming

Loading...
Thumbnail Image

Date

Authors

Hegland, Markus
Osborne, Michael
Sun, Felix Jie

Journal Title

Journal ISSN

Volume Title

Publisher

Kluwer Academic Publishers

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.

Description

Citation

Source

Annals of Operations Research

Book Title

Entity type

Access Statement

License Rights

Restricted until

2037-12-31
abcd