Interior Point Methods

Nikolaos Ploskas and Nikolaos Samaras
Additional contact information
Nikolaos Ploskas: University of Macedonia
Nikolaos Samaras: University of Macedonia

Chapter Chapter 11 in Linear Programming Using MATLAB®, 2017, pp 491-540 from Springer

Abstract: Abstract Nowadays, much attention is focused on primal-dual Interior Point Methods (IPMs) due to their great computational performance. IPMs have permanently changed the landscape of mathematical programming theory and computation. Most primal-dual IPMs are based on Mehrotra’s Predictor-Corrector (MPC) method. In this chapter, a presentation of the basic concepts of primal-dual IPMs is performed. Next, we present the MPC method. The various steps of the algorithm are presented. Numerical examples are also presented in order for the reader to understand better the algorithm. Furthermore, an implementation of the algorithm in MATLAB is presented. Finally, a computational study over benchmark LPs and randomly generated sparse LPs is performed in order to compare the efficiency of the proposed implementation with MATLAB’s IPM solver.

Date: 2017
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-65919-0_11

Ordering information: This item can be ordered from
http://www.springer.com/9783319659190

DOI: 10.1007/978-3-319-65919-0_11

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().