Skip to main content
Log in

Parallel interior-point solver for structured linear programs

  • Published:
Mathematical Programming Submit manuscript

Abstract.

 Issues of implementation of an object-oriented library for parallel interior-point methods are addressed. The solver can easily exploit any special structure of the underlying optimization problem. In particular, it allows a nested embedding of structures and by this means very complicated real-life optimization problems can be modelled. The efficiency of the solver is illustrated on several problems arising in the optimization of networks. The sequential implementation outperforms the state-of-the-art commercial optimization software. The parallel implementation achieves speed-ups of about 3.1-3.9 on 4-processors parallel systems and speed-ups of about 10-12 on 16-processors parallel systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: December 4, 2000 / Accepted: January 2003 Published online: April 10, 2003

RID="⋆"

ID="⋆" Supported by the Engineering and Physical Sciences Research Council of UK, EPSRC grant GR/M68169.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gondzio, J., Sarkissian, R. Parallel interior-point solver for structured linear programs. Math. Program., Ser. A 96, 561–584 (2003). https://doi.org/10.1007/s10107-003-0379-5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-003-0379-5

Keywords

Navigation