Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming (Q1319021): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A monotonic projective algorithm for fractional linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long steps in an \(O(n^ 3L)\) algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Family of Search Directions for Karmarkar's Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial Newton method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3480806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of Karmarkar's linear programming algorithm for problems in standard form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conical projection algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Karmarkar's algorithm with improved steps / 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: A different convergence proof of the projective method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm, based on Newton's method, for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3494376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Path-Following Projective Interior Point Method for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Karmarkar's algorithm for linear programming using dual variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Centered Projective Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming / rank
 
Normal rank

Latest revision as of 14:28, 22 May 2024

scientific article
Language Label Description Also known as
English
Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
scientific article

    Statements

    Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming (English)
    0 references
    0 references
    12 April 1994
    0 references
    0 references
    Karmarkar's algorithm
    0 references
    projective algorithm
    0 references
    0 references
    0 references
    0 references