Searched for: contributor%3A%22Roos%2C+C.+%28promotor%29%22
(1 - 10 of 10)
document
Asadi, A. (author)
Recently, C. Roos proposed a full-Newton step infeasible interior-point method (IIPM) for linear optimization (LO). Shortly afterwards, Mansouri and Roos presented a variant of this algorithm and Gu et al. a version with a simplified analysis. Roos' algorithm is a path-following method. It uses the so-called homotopy path as a guideline to an...
doctoral thesis 2011
document
Silalahi, B.P. (author)
doctoral thesis 2011
document
Gu, G. (author)
In [SIAM J. Optim., 16(4):1110--1136 (electronic), 2006] Roos proposed a full-Newton step Infeasible Interior-Point Method (IIPM) for Linear Optimization (LO). It is a primal-dual homotopy method; it differs from the classical IIPMs in that it uses only full steps. This means that no line searches are needed. In this thesis, we first present an...
doctoral thesis 2009
document
Mansouri, H. (author)
In the theory of polynomial-time interior-point methods (IPMs) two important classes of methods are distinguished: small-update and large-update methods, respectively. Small-update IPMs have the best theoretical iteration bound and IPMs with full-Newton steps belong to this class of methods. Within each of these classes one has feasible and...
doctoral thesis 2008
document
Ivanov, I.D. (author)
doctoral thesis 2008
document
Vieira, M.V.C. (author)
In this thesis we present a generalization of interior-point methods for linear optimization based on kernel functions to symmetric optimization. It covers the three standard cases of conic optimization: linear optimization, second-order cone optimization and semi-definite optimization. We give an introduction to Euclidean Jordan algebras and...
doctoral thesis 2007
document
Chaerani, D. (author)
This thesis deals with optimization problems with uncertain data. Uncertainty here means that the data is not known exactly at the time when its solution has to be determined. In many models the uncertainty is ignored and a representative nominal value of the data is used. The uncertainty may be due to measurement or modelling errors or simply...
doctoral thesis 2006
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
document
Peng, J. (author)
doctoral thesis 2001
document
Quist, A.J. (author)
doctoral thesis 2000
Searched for: contributor%3A%22Roos%2C+C.+%28promotor%29%22
(1 - 10 of 10)