Generic primal-dual interior point methods based on a new kernel function
More Info
expand_more
expand_more
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)