On the superlinear convergence order of the logarithmic barrier algorithm

DOI10.1023/A:1011220302800zbMath0992.90066OpenAlexW61549919MaRDI QIDQ5939943

Abdellatif Elafia, Jean-Pierre Dussault

Publication date: 2001

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011220302800

zbMATH Keywords

interior point methodsasymptotic convergence rateaverage superlinear convergence orderinequality constrained optimizationlog barrier algorithmpenalty algorithmspredictor-corrector interior point methodsSUMT method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)

Related Items (3)

A local convergence property of primal-dual methods for nonlinear programming ⋮ High-order Newton-penalty algorithms ⋮ Optimal Flight Paths Reducing the Aircraft Noise during Landing

This page was built for publication: On the superlinear convergence order of the logarithmic barrier algorithm