An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 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: Q5583564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for Modifying Matrix Factorizations / 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: Matrix factorizations in optimization of nonlinear functions subject to linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerically stable dual method for solving strictly convex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5540119 / 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: A polynomial-time algorithm for a class of 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: Q5655195 / 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: Recovering optimal dual solutions in Karmarkar's polynomial 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
Property / cites work
 
Property / cites work: Q4097094 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01588795 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075023395 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:17, 30 July 2024

scientific article
Language Label Description Also known as
English
An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
scientific article

    Statements

    An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (English)
    0 references
    0 references
    0 references
    1991
    0 references
    Karmarkar's method
    0 references
    primal interior point method
    0 references
    convex quadratic programming
    0 references
    logarithmic barrier function
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references