78
Views
4
CrossRef citations to date
0
Altmetric
Section A

A new infeasible interior-point algorithm with full step for linear optimization based on a simple function

&
Pages 3163-3185 | Received 22 Dec 2010, Accepted 09 Jun 2011, Published online: 27 Jul 2011
 

Abstract

In this paper, we design and analyse an infeasible interior-point algorithm based on a simple function for linear optimization. The infeasible algorithm contains two types of search directions: the feasibility search direction and the centrality search direction. Both of the directions are determined by the simple function. The algorithm uses full step, thus no need to perform the line-search procedure. Although the proposed function is simple, as it will be shown, the induced infeasible algorithm enjoys the best-known iteration complexity for infeasible interior-point algorithm.

2000 AMS Subject Classifications :

Acknowledgements

The research is supported by National Natural Science Foundation of China (No. 11071221, 11071158) and key disciplines of Shanghai Municipality Discipline Project (No. S30104).

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.