A Polynomial Method of Weighted Centers for Convex Quadratic Programming

DOI10.1080/02522667.1991.10699062zbMath0746.90047MaRDI QIDQ3976933

Cornelis Roos, Tamás Terlaky, Dick den Hertog

Publication date: 25 June 1992

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1991.10699062

zbMATH Keywords

convex quadratic programming; interior point methods; weighted central path-following method; weighted logarithmic barrier function; weighted trajectories

Mathematics Subject Classification ID

90C25: Convex programming

90C60: Abstract computational complexity for mathematical programming problems

90C20: Quadratic programming

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm, A survey of search directions in interior point methods for linear programming, The linear complementarity problem, sufficient matrices, and the criss- cross method, Primal-dual target-following algorithms for linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A monotonic projective algorithm for fractional linear programming
• Linear quadratic programming in oriented matroids
• A new polynomial-time algorithm for linear programming
• On \(\ell_ p\) programming
• New trajectory-following polynomial-time algorithm for linear programming problems
• A polynomial-time algorithm for a class of linear complementarity problems
• Complementary pivot theory of mathematical programming
• A variation on Karmarkar’s algorithm for solving linear programming problems
• The Simplex Method for Quadratic Programming
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• A variable dimension algorithm for the linear complementarity problem
• Bimatrix Equilibrium Points and Mathematical Programming