A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term | Zendy

Behrouz Kheirfam | Zendy; M. Moslemi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term

Author(s) -

Behrouz Kheirfam,

M. Moslemi

Publication year - 2014

Publication title -

yugoslav journal of operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.221

H-Index - 21

eISSN - 1820-743X

pISSN - 0354-0243

DOI - 10.2298/yjor120904006k

Subject(s) - algorithm , trigonometric functions , kernel (algebra) , mathematics , measure (data warehouse) , time complexity , term (time) , function (biology) , mathematical optimization , interior point method , computer science , discrete mathematics , physics , geometry , quantum mechanics , evolutionary biology , biology , database

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research