A Polynomial Method of Weighted Centers for Convex Quadratic Programming

DOI10.1080/02522667.1991.10699062MaRDI QIDQ3976933zbMATH OpenOpenAlexFDO

Authors D. Den Hertog, C. Roos, Tamás Terlaky

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

interior point methodsconvex quadratic programmingweighted central path-following methodweighted logarithmic barrier functionweighted trajectories

Mathematics Subject Classification ID

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

Recommendations

• A weighted path-following method for linearly constrained convex programming
• A new primal-dual polynomial algorithm for convex quadratic programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Weighted-path-following algorithm for linear programming
• On the complexity of following the central path of linear programs by linear extrapolation. II

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• scientific article; zbMATH DE number 194636 (Why is no real title available?)
• A monotonic projective algorithm for fractional linear programming
• A new polynomial-time algorithm for linear programming
• A polynomial-time algorithm for a class of linear complementarity problems
• A variable dimension algorithm for the linear complementarity problem
• A variation on Karmarkar’s algorithm for solving linear programming problems
• Bimatrix Equilibrium Points and Mathematical Programming
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• Complementary pivot theory of mathematical programming
• Linear quadratic programming in oriented matroids
• New trajectory-following polynomial-time algorithm for linear programming problems
• On \(\ell_ p\) programming
• The Simplex Method for Quadratic Programming

Cited in

(11)

• Solving LP Problems via Weighted Centers
• An efficient DCA algorithm for solving non-monotone affine variational inequality problem
• 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
• Primal-dual target-following algorithms for linear programming
• A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
• The linear complementarity problem, sufficient matrices, and the criss- cross method
• A weighted path-following method for linearly constrained convex programming
• A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization
• Solving nonmonotone affine variational inequalities problem by DC programming and DCA
• On weighted centers for semidefinite programming

This page was built for publication: A Polynomial Method of Weighted Centers for Convex Quadratic Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976933)