Status determination by interior-point methods for convex optimization problems in domain-driven form

DOI10.1007/s10107-021-01663-wzbMath1494.90079arXiv1901.07084MaRDI QIDQ2149574

Tunçel, Levent, Mehdi Karimi

Publication date: 29 June 2022

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.07084

zbMATH Keywords

convex optimization; interior-point methods; duality theory; primal-dual algorithms; status determination

Mathematics Subject Classification ID

90C25: Convex programming

90C51: Interior-point methods

49N15: Duality theory (optimization)

65Y20: Complexity and performance of numerical algorithms

Uses Software

• SeDuMi
• SDPT3
• DDS