A survey of search directions in interior point methods for linear programming (Q1181912): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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 monotonic projective algorithm for fractional linear 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: A variation on Karmarkar’s algorithm for solving linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial Newton method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A potential-reduction variant of Renegar's short-step path-following method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of Karmarkar's linear programming algorithm for problems in standard form / rank
 
Normal rank
Property / cites work
 
Property / cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / 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: Interior point algorithms for linear programming with inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial affine algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conical projection algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convexity of the multiplicative version of Karmarkar's potential function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiplicative barrier function method 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: Q3491304 / 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: 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: Interior path following primal-dual algorithms. I: Linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension / 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: New trajectory-following polynomial-time algorithm for linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Method of Weighted Centers for Convex Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial method of approximate centers for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733658 / 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 algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations / 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: Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming / rank
 
Normal rank

Latest revision as of 14:33, 15 May 2024

scientific article
Language Label Description Also known as
English
A survey of search directions in interior point methods for linear programming
scientific article

    Statements

    A survey of search directions in interior point methods for linear programming (English)
    0 references
    0 references
    27 June 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    potential function
    0 references
    interior point algorithm
    0 references
    search direction
    0 references
    projected gradient
    0 references
    Newton directions
    0 references
    barrier functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references