Unified complexity analysis for Newton LP methods (Q1184332): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01585691 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016205992 / rank
 
Normal rank

Latest revision as of 10:47, 30 July 2024

scientific article
Language Label Description Also known as
English
Unified complexity analysis for Newton LP methods
scientific article

    Statements

    Unified complexity analysis for Newton LP methods (English)
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    The authors show that a theorem of S. Smale can be applied to unify the polynomial-time bound proofs of several of the recent interior algorithms. They consider, in particular, \textit{C. C. Gonzaga's} linear programming barrier method [in: Progress in mathematical programming, Interior-point and related methods, Proc. Conf., Pacific Grove/Calif. 1987, 1-28 (1989; Zbl 0691.90053)], the barrier method applied to convex quadratic programming, a primal linear programming method, a primal-dual linear programming method, and a primal-dual method applied to convex quadratic programming. A good reference for all this material is the collection of papers mentioned above.
    0 references
    Newton's method
    0 references
    interior algorithms
    0 references
    barrier method
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references