An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Donald Goldfarb / rank
Normal rank
 
Property / author
 
Property / author: Donald Goldfarb / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Q3783074 / 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: 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: An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3033554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial affine algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5540119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the method of analytic centers when applied to convex quadratic programs / 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: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3873927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Convex Quadratic Programming That Requires <i>O</i>(<i>n</i><sup>3.5</sup><i>L</i>) Arithmetic Operations / 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: Interior path following primal-dual algorithms. II: Convex quadratic 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 \(O(n^ 3L)\) potential reduction algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Karmarkar's projective algorithm for convex quadratic programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:18, 22 May 2024

scientific article
Language Label Description Also known as
English
An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs
scientific article

    Statements

    An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (English)
    0 references
    0 references
    0 references
    27 March 1994
    0 references
    interior point method
    0 references
    Karmarkar's method
    0 references
    rank-one update
    0 references
    partial updating
    0 references
    primal-dual potential function
    0 references
    linear complementarity
    0 references
    convex quadratic programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references