An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs
From MaRDI portal
Publication:1315412
DOI10.1007/BF01582145zbMath0792.90056MaRDI QIDQ1315412
Publication date: 27 March 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
linear complementarityinterior point methodconvex quadratic programmingrank-one updateprimal-dual potential functionKarmarkar's methodpartial updating
Convex programming (90C25) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Scheduling with partial rejection, Log-domain interior-point methods for convex quadratic programming, On the cooperation of recycling operations, An exterior point polynomial-time algorithm for convex quadratic programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming
- On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise
- Polynomial affine algorithms for linear programming
- On the convergence of the method of analytic centers when applied to convex quadratic programs
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
- An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
