Abstract
A Unifying Framework for the Convexification of Mixed-Integer Conic Binary Sets The paper “Conic Mixed-Binary Sets: Convex Hull Characterizations and Applications,” by Fatma Kilinc-Karzan, Simge Kucukyavuz, Dabeen Lee, and Soroosh Shafieezadeh-Abadeh, develops a unifying framework for convexifying mixed-integer conic binary sets. Many applications in machine-learning and operations research give rise to integer programming models with nonlinear structures and binary variables. The paper develops general methods for generating strong valid inequalities that take into account multiple conic constraints at the same time. The authors demonstrate that their framework applies to conic quadratic programming with binary variables, fractional programming, best subset selection, distributionally robust optimization, and sparse approximation of positive semidefinite matrices.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
