Strict monotonicity in Todd's low-complexity algorithm for linear programming (Q1200765): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On monotonicity in the scaled potential algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variation on Karmarkar’s algorithm for solving linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Todd's low-complexity algorithm is a predictor-corrector path-following method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming / rank
 
Normal rank

Latest revision as of 12:05, 17 May 2024

scientific article
Language Label Description Also known as
English
Strict monotonicity in Todd's low-complexity algorithm for linear programming
scientific article

    Statements

    Strict monotonicity in Todd's low-complexity algorithm for linear programming (English)
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    interior point algorithm
    0 references
    potential function
    0 references
    strictly monotone algorithm
    0 references