A study of the dual affine scaling continuous trajectories for linear programming (Q481775): Difference between revisions

From MaRDI portal
Normalize DOI.
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1007/S10957-013-0495-1 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S10957-013-0495-1 / rank
 
Normal rank

Latest revision as of 18:49, 9 December 2024

scientific article
Language Label Description Also known as
English
A study of the dual affine scaling continuous trajectories for linear programming
scientific article

    Statements

    A study of the dual affine scaling continuous trajectories for linear programming (English)
    0 references
    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
    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

    Identifiers