On the complexity of the primal self-concordant barrier method.

DOI10.1016/S0167-6377(03)00056-7zbMath1049.90141OpenAlexW1979705221MaRDI QIDQ1412708

Jan Brinkhuis

Publication date: 25 November 2003

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(03)00056-7

zbMATH Keywords

AlgorithmComplexityInterior point methodsOptimizationAnalytical centerBarrier methodPrimal path-following methodsSelf-concordance

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• A Mathematical View of Interior-Point Methods in Convex Optimization

This page was built for publication: On the complexity of the primal self-concordant barrier method.