A Modified Infeasible-Interior-Point Algorithm for Linear Optimization Problems
H. Mansouri (),
M. Zangiabadi () and
M. Arzani
Additional contact information
H. Mansouri: Shahrekord University
M. Zangiabadi: Shahrekord University
M. Arzani: Shahrekord University
Journal of Optimization Theory and Applications, 2015, vol. 166, issue 2, No 13, 605-618
Abstract:
Abstract In this paper, we present an improved version of the infeasible-interior-point method for linear optimization introduced by Roos (SIAM J Optim 16(4):1110–1136, 2006). Each main step of Roos’s algorithm is composed of one feasibility step and several centering steps. By using a new search direction, we prove that it is enough to take only one step in order to obtain a polynomial-time method. The iteration bound coincides with the currently best iteration bound for linear optimization problems.
Keywords: Infeasible-interior-point method; Central path; Search directions; Full-Newton step; Perturbed problems; 90C05; 90C51 (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10957-015-0719-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
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:spr:joptap:v:166:y:2015:i:2:d:10.1007_s10957-015-0719-7
Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2
DOI: 10.1007/s10957-015-0719-7
Access Statistics for this article
Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull
More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().