Linear programming and the Newton barrier flow (Q1111465): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(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: A variation on Karmarkar’s algorithm for solving linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories / 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: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction: New approaches to 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: A polynomial-time algorithm, based on Newton's method, 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:48, 19 June 2024

scientific article
Language Label Description Also known as
English
Linear programming and the Newton barrier flow
scientific article

    Statements

    Linear programming and the Newton barrier flow (English)
    0 references
    1988
    0 references
    The author investigates the interior algorithms for linear programming. These algorithms are connected with some trajectories of vectors approximating an optimal solution to a linear programming problem. The author shows that given a bounded polyhedral set P with nonempty interior, the logarithmic barrier function (with no objective components) induces a vector field of negative Newton directions which flows from the center of P to the solution of every possible linear program of P.
    0 references
    central trajectory
    0 references
    Newton's method
    0 references
    interior algorithms
    0 references
    logarithmic barrier function
    0 references

    Identifiers