A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound
In this paper, we propose a large-update primal-dual interior point algorithm for linear optimization. The method is based on a new class of kernel functions which differs from the existing kernel functions in which it has a double barrier term. The investigation according to it yields the best know...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2020-06-01
|
| Series: | Communications in Mathematics |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/cm-2020-0003 |
| id |
doaj-9fd16faa65474c88a42b24bfdf6bf230 |
|---|---|
| record_format |
Article |
| spelling |
doaj-9fd16faa65474c88a42b24bfdf6bf2302021-09-06T19:22:06ZengSciendoCommunications in Mathematics2336-12982020-06-01281274110.2478/cm-2020-0003cm-2020-0003A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration boundAyache Benhadid0Khaled Saoudi1Department of mathematics, Université de Batna 2 – Mostefa, Ben Boulaïd, 53, Route de Constantine, Fésdis, Batna05078, AlgeriaDepartment of Mathematics and Computer Science, Abbes Laghrour University, BP 1252 Route de Batna, Khenchela40004, AlgeriaIn this paper, we propose a large-update primal-dual interior point algorithm for linear optimization. The method is based on a new class of kernel functions which differs from the existing kernel functions in which it has a double barrier term. The investigation according to it yields the best known iteration bound Onlog(n)log(n∈)\sqrt n \log (n)\log \left( {{n \over \in }} \right) for large-update algorithm with the special choice of its parameter m and thus improves the iteration bound obtained in Bai et al. [2] for large-update algorithm.https://doi.org/10.2478/cm-2020-0003linear optimizationkernel functioninterior point methodscomplexity bound90c0590c5190c31 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Ayache Benhadid Khaled Saoudi |
| spellingShingle |
Ayache Benhadid Khaled Saoudi A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound Communications in Mathematics linear optimization kernel function interior point methods complexity bound 90c05 90c51 90c31 |
| author_facet |
Ayache Benhadid Khaled Saoudi |
| author_sort |
Ayache Benhadid |
| title |
A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound |
| title_short |
A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound |
| title_full |
A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound |
| title_fullStr |
A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound |
| title_full_unstemmed |
A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound |
| title_sort |
new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound |
| publisher |
Sciendo |
| series |
Communications in Mathematics |
| issn |
2336-1298 |
| publishDate |
2020-06-01 |
| description |
In this paper, we propose a large-update primal-dual interior point algorithm for linear optimization. The method is based on a new class of kernel functions which differs from the existing kernel functions in which it has a double barrier term. The investigation according to it yields the best known iteration bound Onlog(n)log(n∈)\sqrt n \log (n)\log \left( {{n \over \in }} \right) for large-update algorithm with the special choice of its parameter m and thus improves the iteration bound obtained in Bai et al. [2] for large-update algorithm. |
| topic |
linear optimization kernel function interior point methods complexity bound 90c05 90c51 90c31 |
| url |
https://doi.org/10.2478/cm-2020-0003 |
| work_keys_str_mv |
AT ayachebenhadid anewparameterizedlogarithmickernelfunctionforlinearoptimizationwithadoublebarriertermyieldingthebestknowniterationbound AT khaledsaoudi anewparameterizedlogarithmickernelfunctionforlinearoptimizationwithadoublebarriertermyieldingthebestknowniterationbound AT ayachebenhadid newparameterizedlogarithmickernelfunctionforlinearoptimizationwithadoublebarriertermyieldingthebestknowniterationbound AT khaledsaoudi newparameterizedlogarithmickernelfunctionforlinearoptimizationwithadoublebarriertermyieldingthebestknowniterationbound |
| _version_ |
1717772705132969984 |