Generic primal-dual interior point methods based on a new kernel function

Journal article (2008)

Authors

M. EL Ghami

C. Roos

Department

Software Technology () (TU Delft)

DOI: https://doi.org/doi:10.1051/ro:2008009

Linear optimization Primal-dual interior-point algorithm Large and small-update method

To reference this document use:

http://resolver.tudelft.nl/uuid:ad6fd841-d17d-4d5c-bb6d-1b12438e2868

More Info

expand_more

Published Date

17-05-2008

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Source:

RAIRO-Operations Research, 42 (2) 2008

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Technology

Abstract

In this paper we present a generic primal-dual interior point methods (IPMs) for linear optimization in which the search direction depends on a univariate kernel function which is also used as proximity measure in the analysis of the algorithm. The proposed kernel function does not satisfy all the conditions proposed in

Files

Roos2008.pdf

(pdf | 0.221 Mb)

Unknown license