Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions

DOI10.1016/j.ejor.2007.12.030zbMath1154.90542OpenAlexW2075328604MaRDI QIDQ1002052

Petra Huhn, Verena Wehlitz

Publication date: 23 February 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.12.030

zbMATH Keywords

linear programminginterior point methodsaverage case complexity of algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
• A combined phase I-phase II projective algorithm for linear programming
• A combined phase I-phase II scaled potential algorithm for linear programming
• Superlinear convergence of infeasible-interior-point methods for linear programming
• Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure.
• Combining phase I and phase II in a potential reduction algorithm for linear programming
• Probabilistic Models for Linear Programming
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming

This page was built for publication: Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions