An interior point method, based on rank-1 updates, for linear programming (Q1290600): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Shu-Zhong Zhang / rank
Normal rank
 
Property / author
 
Property / author: Shu-Zhong Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Q3033554 / 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: Interior path following primal-dual algorithms. II: Convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long steps in an \(O(n^ 3L)\) algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Mizuno’s Rank-One Updating Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Centered Projective Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise / rank
 
Normal rank
Property / cites work
 
Property / cites work: DEFERRED RANK ONE UPDATES IN O(n_3L) INTERIOR POINT ALGORITHM / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm, based on Newton's method, for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Karmarkar projections quickly / rank
 
Normal rank

Latest revision as of 20:24, 28 May 2024

scientific article
Language Label Description Also known as
English
An interior point method, based on rank-1 updates, for linear programming
scientific article

    Statements

    An interior point method, based on rank-1 updates, for linear programming (English)
    0 references
    0 references
    0 references
    0 references
    3 June 1999
    0 references
    0 references
    linear programming
    0 references
    interior point method
    0 references
    potential function
    0 references
    polynomial time primal-dual potential reduction algorithm
    0 references