An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming (Q1919092): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: An implementation of Karmarkar's algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of search directions in interior point methods for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal projective interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conical projection algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search directions for interior linear-programming methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest step path following algorithm for monotone linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5540119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new variant of the primal affine scaling algorithm for linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming / 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 unified approach to interior point algorithms for linear complementarity problems: A summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual affine-scaling potential-reduction algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. I: Linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / 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: New complexity results for the Iri-Imai method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of the affine scaling methods for degenerate linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant potential primal-dual algorithms: A framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02592088 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1498125507 / rank
 
Normal rank

Latest revision as of 09:04, 30 July 2024

scientific article
Language Label Description Also known as
English
An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
scientific article

    Statements

    An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming (English)
    0 references
    17 October 1996
    0 references
    primal-dual interior point algorithm
    0 references
    polynomiality
    0 references
    primal-dual affine scaling method
    0 references
    primal-dual central path
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers