A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood

DOI10.3233/FI-2017-1511zbMath1386.90100OpenAlexW2596876371MaRDI QIDQ4595585

Behrouz Kheirfam

Publication date: 5 December 2017

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

Full work available at URL: https://doi.org/10.3233/fi-2017-1511

zbMATH Keywords

predictor-corrector methodsemidefinite optimizationpolynomial complexitywide neighborhoodinfeasible-interior-point method

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Related Items (9)

A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization ⋮ A wide neighbourhood primal-dual second-order corrector interior point algorithm for semidefinite optimization ⋮ A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood ⋮ A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization ⋮ A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization ⋮ A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function ⋮ A wide neighborhood interior-point algorithm based on the trigonometric kernel function ⋮ A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood ⋮ A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization

This page was built for publication: A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood