Volume 42, Number 2, April-June 2008CIRO 05
|Page(s)||199 - 213|
|Published online||17 May 2008|
Generic Primal-dual Interior Point Methods Based on a New Kernel Function
Department of Informatics, University
of Bergen, Thormøblensgate 55, 5008 Bergen, Norway;
2 Faculty of Electrical Engineering, Mathematics, and Computer Science, Delft University of Technology, PO Box 5031, 2600 GA Delft, The Netherlands; C.Roos@ewi.tudelft.nl
Accepted: 28 November 2007
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 . We show that the corresponding large-update algorithm improves the iteration complexity with a factor when compared with the method based on the use of the classical logarithmic barrier function. For small-update interior point methods the iteration bound is which is currently the best-known bound for primal-dual IPMs.
Mathematics Subject Classification: 90C05 / 90C31
Key words: Linear optimization / primal-dual interior-point algorithm / large and small-update method.
© EDP Sciences, ROADEF, SMAI, 2008
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.