A study of the dual affine scaling continuous trajectories for linear programming (Q481775)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6380445
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A study of the dual affine scaling continuous trajectories for linear programming |
scientific article; zbMATH DE number 6380445 |
Statements
A study of the dual affine scaling continuous trajectories for linear programming (English)
0 references
15 December 2014
0 references
In this paper the authors adopted a continuous method approach to study both the entire process and the limiting behaviors of the dual affine scaling continuous trajectories for linear programming. Their approach is different from the method presented by \textit{I. Adler} and \textit{R. D. C. Monteiro} [Math. Program. 50, No. 1 (A), 29--51 (1991; Zbl 0719.90044)]. Many new theoretical results on the trajectories resulting from the dual affine scaling continuous method model for linear programming are obtained.
0 references
semidefinite programming
0 references
semidefinite least squares
0 references
infeasible central path, infeasible interior point method
0 references
inexact search direction
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0 references
0 references
0.8552480340003967
0 references
0.7947430610656738
0 references
0.7945849895477295
0 references
