BOUALI, SAMIR (2015) COMPLEXITY ANALYSIS OF INTERIOR-POINT METHODS FOR LINEAR OPTIMIZATION BASED ON A NEW KERNEL FUNCTION WITH A TRIGONOMETRIC BARRIER TERM. Asian Journal of Mathematics and Computer Research, 5 (1). pp. 1-9.
Full text not available from this repository.Abstract
In this paper, we present a new barrier function for primal-dual interior-point methods in linear optimization. This kernel function has a trigonometric barrier term. It is proved that the algorithm based on this new kernel function has O (n34log nϵ) iteration complexity for a large-update methods, for a small-update the algorithm has O(√n log nϵ), which coincide with the best known iteration bound for linear optimization.
| Item Type: | Article |
|---|---|
| Subjects: | Institute Archives > Mathematical Science |
| Depositing User: | Managing Editor |
| Date Deposited: | 27 Dec 2023 05:47 |
| Last Modified: | 27 Dec 2023 05:47 |
| URI: | http://eprint.subtopublish.com/id/eprint/3882 |
Actions (login required)
- View Item