.png){kind=icon}
.png){kind=icon}
Return
NEW INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION BASED ON A UNIVERSAL TANGENT DIRECTION
.png){kind=icon}
PRE
AI
DOI：10.1137/24M1705780.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we suggest a new interior-point algorithm for linear optimization, based on the idea of parabolic target space. Our algorithm can start at any strictly feasible primal-dual pair and go directly towards a solution by a predictor-corrector scheme. We prove that the complexity of the proposed method coincides with the currently known best complexity results for interior-point algorithms. The method demonstrates a very fast local convergence on the test set problems we have evaluated. One of the main differences between our approach and the standard framework is that our algorithm is based on a parabolic primal-dual barrier function.
Keywords:
linear optimization
interior-point algorithms
parabolic target space
universal tangent direction
Journal
IF:
2.3
Papers:
27
Citations:
1.0W