An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption (Q1915917): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An implementation of Karmarkar's algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm / 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: A combined phase I-phase II projective algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variation on Karmarkar’s algorithm for solving linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-thirds is sharp for affine scaling / 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 primal-dual infeasible-interior-point algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified global convergence proof of the affine scaling algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of a primal affine scaling method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the affine-scaling algorithm / 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 Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear convergence of the affine scaling algorithm / 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: A modification of Karmarkar's linear programming algorithm / 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

Latest revision as of 11:56, 24 May 2024

scientific article
Language Label Description Also known as
English
An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
scientific article

    Statements

    An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption (English)
    0 references
    0 references
    0 references
    24 October 1996
    0 references
    global convergence
    0 references
    infeasible-interior-point algorithm
    0 references
    affine scaling algorithm
    0 references
    nondegeneracy assumption
    0 references
    0 references
    0 references
    0 references

    Identifiers