Conic programming: Infeasibility certificates and projective geometry

[摘要] We revisit facial reduction from the point of view of projective geometry. This leads us to a homogenization strategy in conic programming that eliminates the phenomenon of weak infeasibility. For semidefinite programs (and others), this yields infeasibility certificates that can be checked in polynomial time. Furthermore, we propose a refined type of infeasibility, which we call stably infeasible, for which rational infeasibility certificates exist and that can be distinguished from other infeasibility types by our homogenization. (C) 2020 Elsevier B.V. All rights reserved.

[发布日期] 2021-07-01

[效力级别]  Proceedings Paper