Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems

DOI10.1080/10556789808805715zbMATH Open0942.90032OpenAlexW2078452707MaRDI QIDQ4946709

Levent Tunçel, Masakazu Kojima

Publication date: 20 August 2000

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

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

zbMATH Keywords

semidefinite programminginterior-point methodspolynomial complexityprimal-dual algorithms

Mathematics Subject Classification ID

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

Uses Software

• SDPA

This page was built for publication: Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4946709)