Complexity Analysis of Primal‐Dual Interior‐Point Methods for Linear Optimization Based on a New Parametric Kernel Function with a Trigonometric Barrier Term

X. Z. Cai, G. Q. Wang, M. El Ghami and Y. J. Yue

Abstract and Applied Analysis, 2014, vol. 2014, issue 1

Abstract: We introduce a new parametric kernel function, which is a combination of the classic kernel function and a trigonometric barrier term, and present various properties of this new kernel function. A class of large‐ and small‐update primal‐dual interior‐point methods for linear optimization based on this parametric kernel function is proposed. By utilizing the feature of the parametric kernel function, we derive the iteration bounds for large‐update methods, O(n2/3log⁡(n/ε)), and small‐update methods, O(nlog⁡(n/ε)). These results match the currently best known iteration bounds for large‐ and small‐update methods based on the trigonometric kernel functions.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2014/710158

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnlaaa:v:2014:y:2014:i:1:n:710158

Access Statistics for this article

More articles in Abstract and Applied Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().