Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. (Q1872636): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jcom.2002.0640 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084215264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the average behavior of simplex algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of optimization algorithms - some aspects from a practical point of view / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum: A Sharp Upper Bound for the Expected Number of Shadow Vertices in LP-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4346077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4494406 / 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: Finding an interior point in the optimal face of linear programs / 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: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average number of steps of the simplex method of linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Models for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JCOM.2002.0640 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:54, 16 December 2024

scientific article
Language Label Description Also known as
English
Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure.
scientific article

    Statements

    Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. (English)
    0 references
    0 references
    0 references
    14 May 2003
    0 references
    linear programming
    0 references
    interior-point methods
    0 references
    probabilistic analysis.
    0 references

    Identifiers