A primal–dual interior point algorithm with an exact and differentiable merit function for nonlinear programming

DOI10.1080/10556780008805791zbMath0988.90047OpenAlexW2071474509MaRDI QIDQ4521377

Ioannis G. Akrotirianakis, Berc Rustem

Publication date: 22 July 2002

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780008805791

zbMATH Keywords

global convergenceconstrained optimizationnonlinear programmingprimal-dual interior point methods

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interior-point methods (90C51)

Related Items (2)

An interior-point algorithm for computing equilibria in economies with incomplete asset markets ⋮ Globally convergent interior-point algorithm for nonlinear programming

This page was built for publication: A primal–dual interior point algorithm with an exact and differentiable merit function for nonlinear programming