A long-step barrier method for convex quadratic programming

DOI10.1007/BF01769704zbMATH Open0783.90093OpenAlexW1966520331MaRDI QIDQ689102FDOQ689102

Authors: Kurt M. Anstreicher, D. Den Hertog, C. 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

Recommendations

• Publication:3494376
• A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
• Long-step path-following algorithm for convex quadratic programming problems in a Hilbert space
• An efficient logarithmic barrier method without line search for convex quadratic programming
• A long step primal-dual path-following algorithm for convex quadratic semidefinite programming
• Logarithmic barrier function method for convex quadric programming problem
• A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
• A Barrier Method for Large-Scale Constrained Optimization
• A quasi-Newton penalty barrier method for convex minimization problems
• An adaptive barrier method for convex programming

zbMATH Keywords

polynomial algorithmconvex quadratic programminginterior-point methodlinear equality constraintslong-step logarithmic barrier function

Mathematics Subject Classification ID

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

Cites Work

• A new polynomial-time algorithm for linear programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Title not available (Why is that?)
• A polynomial-time algorithm for a class of linear complementarity problems
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• A class of linear complementarity problems solvable in polynomial time
• Title not available (Why is that?)
• An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
• On the convergence of the method of analytic centers when applied to convex quadratic programs
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• Unified complexity analysis for Newton LP methods
• A polynomial method of approximate centers for linear programming
• On computing the center of a convex quadratically constrained set
• AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

Cited In (13)

• The nearest point problem in a polyhedral set and its extensions
• Title not available (Why is that?)
• Convergence behavior of interior-point algorithms
• Logarithmic barrier function method for convex quadric programming problem
• An active index algorithm for the nearest point problem in a polyhedral cone
• A long-step primal-dual path-following method for semidefinite programming
• On controlling the parameter in the logarithmic barrier term for convex programming problems
• A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
• Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
• An interior point method for general large-scale quadratic programming problems
• A path following algorithm for a class of convex programming problems
• Computing Maximum Likelihood Estimators of Convex Density Functions
• Title not available (Why is that?)

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

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