"Non UBC"@en .
"DSpace"@en .
"Simone Naldi"@en .
"2019-11-25T09:37:09Z"@en .
"2019-05-28T17:32"@en .
"The feasible set in a conic program is the intersection of a convex cone with an affine space. In this talk, I will be interested in the feasibility problem of conic programming: How to decide whether an affine space intersects a convex cone or, conversely, that the intersection is empty Can we compute certificates of infeasibility The problem is harder than expected since in (non-linear) conic programming, several types of infeasibility might arise. In a joint work with R. Sinn we revisit the classical facial reduction algorithm from the point of view of projective geometry. This leads us to a homogenization strategy for the general conic feasibility problem. For semidefinite programs, this yields infeasibility certificates that can be checked in polynomial time. We also propose a refined type of infeasibility, which we call \"stable infeasibility\u00C3\u00A2 for which rational infeasibility certificates exist."@en .
"https://circle.library.ubc.ca/rest/handle/2429/72394?expand=metadata"@en .
"31.0 minutes"@en .
"video/mp4"@en .
""@en .
"Author affiliation: Universit\u00E9 de Limoges"@en .
"Banff (Alta.)"@en .
"10.14288/1.0385858"@en .
"eng"@en .
"Unreviewed"@en .
"Vancouver : University of British Columbia Library"@en .
"Banff International Research Station for Mathematical Innovation and Discovery"@en .
"Attribution-NonCommercial-NoDerivatives 4.0 International"@en .
"http://creativecommons.org/licenses/by-nc-nd/4.0/"@en .
"Researcher"@en .
"BIRS Workshop Lecture Videos (Banff, Alta)"@en .
"Mathematics"@en .
"Operations Research, Mathematical Programming, Algebraic Geometry, Control/Optimization/Operation Research"@en .
"Conic programming: infeasibility certificates and projective geometry"@en .
"Moving Image"@en .
"http://hdl.handle.net/2429/72394"@en .