Non UBC
DSpace
Simone Naldi
2019-11-25T09:37:09Z
2019-05-28T17:32
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Ã¢ for which rational infeasibility certificates exist.
https://circle.library.ubc.ca/rest/handle/2429/72394?expand=metadata
31.0 minutes
video/mp4
Author affiliation: Université de Limoges
Banff (Alta.)
10.14288/1.0385858
eng
Unreviewed
Vancouver : University of British Columbia Library
Banff International Research Station for Mathematical Innovation and Discovery
Attribution-NonCommercial-NoDerivatives 4.0 International
http://creativecommons.org/licenses/by-nc-nd/4.0/
Researcher
BIRS Workshop Lecture Videos (Banff, Alta)
Mathematics
Operations Research, Mathematical Programming, Algebraic Geometry, Control/Optimization/Operation Research
Conic programming: infeasibility certificates and projective geometry
Moving Image
http://hdl.handle.net/2429/72394