An Arc-search Interior Point Method in the 𝒩−∞ Neighborhood for Symmetric Optimization

DOI10.3233/FI-2016-1385zbMath1371.65053OpenAlexW2551338718MaRDI QIDQ4976389

Behrouz Kheirfam

Publication date: 28 July 2017

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2016-1385

zbMATH Keywords

algorithmconvergencepolynomial complexityinfeasible interior-point methodsymmetric optimizationarc-search directionsnegative infinity neighborhood

Mathematics Subject Classification ID

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

Related Items (5)

On the extension of an arc-search interior-point algorithm for semidefinite optimization ⋮ An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood ⋮ A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization ⋮ A primal-dual interior-point algorithm with arc-search for semidefinite programming ⋮ A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood

This page was built for publication: An Arc-search Interior Point Method in the 𝒩−∞ Neighborhood for Symmetric Optimization