Complexity analysis of a linear complementarity algorithm based on a Lyapunov function

This publication has 9 references indexed in Scilit:

• An O(n 3 L) primal interior point algorithm for convex quadratic programming
  Mathematical Programming, 1990
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
  Mathematics of Operations Research, 1990
• Interior path following primal-dual algorithms. part II: Convex quadratic programming
  Mathematical Programming, 1989
• A polynomial-time algorithm for a class of linear complementarity problems
  Mathematical Programming, 1989
• An Extension of Karmarkar’s Algorithm and the Trust Region Method for Quadratic Programming
  Published by Springer Nature ,1989
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
  Mathematical Programming, 1986
• A new polynomial-time algorithm for linear programming
  Combinatorica, 1984
• Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
  Journal of Optimization Theory and Applications, 1984
• Convex Analysis
  Published by Walter de Gruyter GmbH ,1970