Two simple proofs for analyticity of the central path in linear programming. (Q5937499): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q128100534, #quickstatements; #temporary_batch_1722529404325
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting behavior of the affine scaling continuous trajectories for linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-Following Methods for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting behavior of weighted central paths in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degeneracy in interior point methods for linear programming: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical properties of the central path at boundary point in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4355913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity / rank
 
Normal rank
Property / cites work
 
Property / cites work: High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The analyticity of interior-point-paths at strictly complementary solutions of linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840116 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128100534 / rank
 
Normal rank

Latest revision as of 18:30, 1 August 2024

scientific article; zbMATH DE number 1619351
Language Label Description Also known as
English
Two simple proofs for analyticity of the central path in linear programming.
scientific article; zbMATH DE number 1619351

    Statements

    Two simple proofs for analyticity of the central path in linear programming. (English)
    0 references
    12 July 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references