Searched for: subject%3A%22primal%255C-dual%255C+interior%255C-point%255C+algorithm%22
(1 - 2 of 2)
document
EL Ghami, M. (author), Roos, C. (author)
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
journal article 2008
document
El Ghami, M. (author)
Two important classes of polynomial-time interior-point method (IPMs) are small- and large-update methods, respectively. The theoretical complexity bound for large-update methods is a factor $\sqrt{n}$ worse than the bound for small-update methods, where $n$ denotes the number of (linear) inequalities in the problem. In practice the situation is...
doctoral thesis 2005