A Polynomial Method of Weighted Centers for Convex Quadratic Programming

DOI10.1080/02522667.1991.10699062zbMath0746.90047OpenAlexW1975279600MaRDI QIDQ3976933

Tamás Terlaky, Cornelis Roos, 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 programminginterior point methodsweighted central path-following methodweighted logarithmic barrier functionweighted trajectories

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Primal-dual target-following algorithms for linear programming, Solving nonmonotone affine variational inequalities problem by DC programming and DCA, A survey of search directions in interior point methods for linear programming, On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm, A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization, The linear complementarity problem, sufficient matrices, and the criss- cross method

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