An O(n 3 L) primal interior point algorithm for convex quadratic programming

This publication has 15 references indexed in Scilit:

• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
  Mathematics of Operations Research, 1990
• A polynomial-time algorithm for a class of linear complementarity problems
  Mathematical Programming, 1989
• A Primal-Dual Interior Point Algorithm for Linear Programming
  Published by Springer Nature ,1989
• A variation on Karmarkar’s algorithm for solving linear programming problems
  Mathematical Programming, 1986
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
  Mathematical Programming, 1986
• Fast algorithms for convex quadratic programming and multicommodity flows
  Published by Association for Computing Machinery (ACM) ,1986
• A new polynomial-time algorithm for linear programming
  Combinatorica, 1984
• A numerically stable dual method for solving strictly convex quadratic programs
  Mathematical Programming, 1983
• Matrix factorizations in optimization of nonlinear functions subject to linear constraints
  Mathematical Programming, 1976
• Methods for modifying matrix factorizations
  Mathematics of Computation, 1974