Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q124828843, #quickstatements; #temporary_batch_1710970253704
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A primal-dual infeasible-interior-point algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A little theorem of the big \({\mathcal M}\) in interior point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence in infeasible-interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility issues in a primal-dual interior-point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a primal-dual interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4206561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomiality of infeasible-interior-point algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Surface of Analytic Centers and Primal-Dual Infeasible-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: An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear convergence of infeasible-interior-point methods for linear programming / rank
 
Normal rank

Revision as of 12:55, 24 May 2024

scientific article
Language Label Description Also known as
English
Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
scientific article

    Statements

    Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (English)
    0 references
    6 November 1996
    0 references
    primal-dual infeasible-interior-point algorithm
    0 references
    polynomial-time computational complexity
    0 references
    initial points
    0 references
    step lengths
    0 references
    nonlinear monotone complementarity
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers