A weighted least squares study of robustness in interior point linear programming (Q1260620): 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: A variation on Karmarkar’s algorithm for solving linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / 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: Degeneracy in interior point methods for linear programming: A survey / 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: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational results of an interior point algorithm for large scale linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879581 / 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: Boundary Behavior of Interior Point Algorithms in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a dual affine variant of Karmarkar's method 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: A modification of Karmarkar's linear programming algorithm / rank
 
Normal rank

Latest revision as of 18:38, 17 May 2024

scientific article
Language Label Description Also known as
English
A weighted least squares study of robustness in interior point linear programming
scientific article

    Statements

    A weighted least squares study of robustness in interior point linear programming (English)
    0 references
    0 references
    30 August 1993
    0 references
    Although global convergence of the affine scaling algorithm has been proved, it is known that, for a bad choice of the initial interior point, the convergence may become very slow, or even numerical stall may occur. The paper in question studied the robustness of interior point linear programming algorithms, with respect to initial iterates that are close to the boundary (bad initial point). The author computes a modified Newton centering direction and shows that the approach which uses this direction is more robust than both the pure affine scaling approach and one which uses the Newton direction as the centering direction.
    0 references
    0 references
    robustness of interior point linear programming algorithms
    0 references
    modified Newton centering direction
    0 references