Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals (Q1205513): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Gongyun Zhao / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Josef Stoer / rank | |||
Normal rank | |||
Revision as of 20:02, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals |
scientific article |
Statements
Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals (English)
0 references
1 April 1993
0 references
A class of primal-dual path following interior point methods for solving linear programming problems is analyzed. The method's iteration steps consist of a Newton-type predictor step along the tangent of an optimal trajectory and some corrector steps recentering the resulting point in order to get close to the trajectory again. It is shown that the number of iterations being necessary to obtain a desired accuracy can be estimated by some curvature integral of the trajectory.
0 references
predictor-corrector methods
0 references
primal-dual path following interior point methods
0 references
Newton-type predictor step
0 references
curvature integral of the trajectory
0 references
