An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs
type: Item
instance of: scholarly article
title: An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs
zbMATH Open document ID: 0792.90056
DOI: 10.1007/BF01582145
author: Shucheng Liu
author: Donald Goldfarb
published in: Mathematical Programming. Series A. Series B
publication date: 1994-03-27T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 513276
zbMATH Keywords: interior point method
zbMATH Keywords: Karmarkar's method
zbMATH Keywords: rank-one update
zbMATH Keywords: partial updating
zbMATH Keywords: primal-dual potential function
zbMATH Keywords: linear complementarity
zbMATH Keywords: convex quadratic programming
MaRDI profile type: Publication
cites work: Long steps in an \(O(n^ 3L)\) algorithm for linear programming
cites work: Q3783074
cites work: On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise
cites work: Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
cites work: An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
cites work: Q3033554
cites work: Polynomial affine algorithms for linear programming
cites work: Q5540119
cites work: On the convergence of the method of analytic centers when applied to convex quadratic programs
cites work: A new polynomial-time algorithm for linear programming
cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
cites work: Q3873927
cites work: An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
cites work: Interior path following primal-dual algorithms. I: Linear programming
cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming
cites work: An extension of Karmarkar's projective algorithm for convex quadratic programming
description: scientific article; zbMATH DE number 513276