Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s10957-015-0719-7 | Journal of Optimization Theory and Applications |
Keywords | Field | DocType |
Infeasible-interior-point method, Central path, Search directions, Full-Newton step, Perturbed problems, 90C05, 90C51 | Mathematical optimization,Algorithm,Linear programming,Interior point method,Mathematics | Journal |
Volume | Issue | ISSN |
166 | 2 | 1573-2878 |
Citations | PageRank | References |
2 | 0.37 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hossein Mansouri | 1 | 9 | 3.26 |
| Maryam Zangiabadi | 2 | 40 | 6.07 |
| M. Arzani | 3 | 2 | 0.37 |