A Polynomial-time Algorithm for Linear Optimization Based on a New Kernel Function with Trigonometric Barrier Term


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 log iteration complexity. 


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics