|
کلیدواژهها
|
Kernel function, Interior-point algorithm, Linear optimization, Polynomial complexity,
Primal-dual method.
|
|
چکیده
|
In this paper, we propose a large-update interior-point algorithm for linear
optimization based on a new kernel function. New search directions and proximity
measure are defined based on this kernel function. We show that if a strictly feasible
starting point is available, then the new algorithm has
|