An infeasible interior-point algorithm with full-Newton step for linear optimization (Q2464638): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11075-007-9135-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1965802713 / rank | |||
Normal rank | |||
Revision as of 19:14, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An infeasible interior-point algorithm with full-Newton step for linear optimization |
scientific article |
Statements
An infeasible interior-point algorithm with full-Newton step for linear optimization (English)
0 references
17 December 2007
0 references
The linear optimization problem in the standard form with linear equality constraints and its dual are considered. For solving the problems, the authors propose a primal-dual infeasible interior-point algorithm that uses a feasibility step different from that one used by \textit{C. Roos} [SIAM J. Optim. 16, No. 4, 1110--1136 (2006; Zbl 1131.90029)]. The new feasibility step proposed by the authors contains as a special case the feasibility step proposed by \textit{H. Mansouri} and \textit{C. Roos} [Optim. Methods Softw. 22, No. 3, 519--530 (2007; Zbl 1186.90077)]. The authors obtain the same order of iteration complexity as in the paper by Roos.
0 references
linear optimization
0 references
infeasible interior-point method
0 references
primal-dual
0 references
polynomial complexity
0 references
