In this paper we present a class of polynomial primal-dual interior-point algorithms for linear optimization based on a new class of kernel functions.
Missing: simple | Show results with:simple
Abstract. We present a new barrier function, based on a kernel function with a linear growth term and an inverse linear barrier term.
A polynomial-time algorithm for linear optimization based on a new simple kernel function · Yanqin Bai, Kees Roos · Published in Optim. Methods Softw. 1 December ...
In this paper, we propose a large-update interior-point algorithm for linear optimization based on a new kernel function.
Abstract In this work, we present an interior point algorithm for linear optimization problems based on a kernel function which has a hyperbolic-logarithmic ...
In this paper we present a class of polynomial primal-dual interior-point algorithms for linear optimization based on a new class of kernel functions.
... algorithm for linear optimization based on a new kernel function. New search directions and proximity measure are defined based on this kernel function. We ...
A polynomial-time algorithm for linear optimization based on a new simple kernel function. Optimization Methods and Software, 18(6), 631-646. Bai, Y ; Roos, C.
Jun 1, 2015 · In this paper, we propose a large-update interior-point algorithm for linear optimization based on a new kernel function. New search directions ...
A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term · B. Kheirfam, M. Moslemi · Published 28 March ...