A long-step barrier method for convex quadratic programming

DOI10.1007/BF01769704zbMath0783.90093OpenAlexW1966520331MaRDI QIDQ689102

Dick den Hertog, Kurt M. Anstreicher, Cornelis Roos, Tamás Terlaky

Publication date: 6 December 1993

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01769704

zbMATH Keywords

interior-point methodconvex quadratic programmingpolynomial algorithmlinear equality constraintslong-step logarithmic barrier function

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20)

Related Items (8)

On controlling the parameter in the logarithmic barrier term for convex programming problems ⋮ An interior point method for general large-scale quadratic programming problems ⋮ A path following algorithm for a class of convex programming problems ⋮ Convergence behavior of interior-point algorithms ⋮ Computing Maximum Likelihood Estimators of Convex Density Functions ⋮ The nearest point problem in a polyhedral set and its extensions ⋮ An active index algorithm for the nearest point problem in a polyhedral cone ⋮ A long-step primal-dual path-following method for semidefinite programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• A polynomial-time algorithm for a class of linear complementarity problems
• A class of linear complementarity problems solvable in polynomial time
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Unified complexity analysis for Newton LP methods
• A polynomial method of approximate centers for linear programming
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• On computing the center of a convex quadratically constrained set
• 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
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM
• Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
• A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
• A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming

This page was built for publication: A long-step barrier method for convex quadratic programming