A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term
Kheirfam B., Moslemi M.
Yugoslav Journal of Operations Research · 2015
doi:10.2298/yjor120904006k (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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 O(3/4log n/?) iteration complexity.
Abstract licence: CC BY-NC-SA
References22
22 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.