scientific article; zbMATH DE number 776084

MaRDI QIDQ4840104zbMATH OpenFDO

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

Publication date 14 August 1995

zbMATH Keywords

column generation and deletioncomplexity analysisinterior point methodlogarithmic barrier methodpolynomial algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• A build-up variant of the logarithmic barrier method for LP
• Some Convergence Properties of the Modified Log Barrier Method for Linear Programming
• Primal-dual algorithms for linear programming based on the logarithmic barrier method
• Primal-dual methods for linear programming
• Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method

Cited in

(10)

• A build-up variant of the logarithmic barrier method for LP
• Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
• A logarithmic barrier cutting plane method for convex programming
• A cutting plane algorithm for convex programming that uses analytic centers
• Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
• A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme
• A constraint-reduced variant of Mehrotra's predictor-corrector algorithm
• An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers
• Adaptive constraint reduction for convex quadratic programming
• A polynomial time constraint-reduced algorithm for semidefinite optimization problems

This page was built for publication:

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