Polyhedral approximation in mixed-integer convex optimization
Abstract
Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. Here, we intend to provide a broadly accessible introduction to our recent work in developing algorithms and software for this problem class. Our approach is based on constructing polyhedral outer approximations of the convex constraints, resulting in a global solution by solving a finite number of mixed-integer linear and continuous convex subproblems. The key advance we present is to strengthen the polyhedral approximations by constructing them in a higher-dimensional space. In order to automate this extended formulation we rely on the algebraic modeling technique of disciplined convex programming (DCP), and for generality and ease of implementation we use conic representations of the convex constraints. Although our framework requires a manual translation of existing models into DCP form, after performing this transformation on the MINLPLIB2 benchmark library we were able to solve a number of unsolved instances and on many other instances achieve superior performance compared with state-of-the-art solvers like Bonmin, SCIP, and Artelys Knitro.
- Authors:
-
- Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States)
- Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
- Publication Date:
- Research Org.:
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- Sponsoring Org.:
- USDOE National Nuclear Security Administration (NNSA)
- OSTI Identifier:
- 1663183
- Report Number(s):
- LA-UR-16-24325
Journal ID: ISSN 0025-5610
- Grant/Contract Number:
- 89233218CNA000001
- Resource Type:
- Accepted Manuscript
- Journal Name:
- Mathematical Programming
- Additional Journal Information:
- Journal Volume: 172; Journal Issue: 1-2; Journal ID: ISSN 0025-5610
- Publisher:
- Springer
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 97 MATHEMATICS AND COMPUTING; Convex MINLP; Outer approximation; Disciplined convex programming
Citation Formats
Lubin, Miles, Yamangil, Emre, Bent, Russell Whitford, and Vielma, Juan Pablo. Polyhedral approximation in mixed-integer convex optimization. United States: N. p., 2017.
Web. doi:10.1007/s10107-017-1191-y.
Lubin, Miles, Yamangil, Emre, Bent, Russell Whitford, & Vielma, Juan Pablo. Polyhedral approximation in mixed-integer convex optimization. United States. https://doi.org/10.1007/s10107-017-1191-y
Lubin, Miles, Yamangil, Emre, Bent, Russell Whitford, and Vielma, Juan Pablo. Thu .
"Polyhedral approximation in mixed-integer convex optimization". United States. https://doi.org/10.1007/s10107-017-1191-y. https://www.osti.gov/servlets/purl/1663183.
@article{osti_1663183,
title = {Polyhedral approximation in mixed-integer convex optimization},
author = {Lubin, Miles and Yamangil, Emre and Bent, Russell Whitford and Vielma, Juan Pablo},
abstractNote = {Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. Here, we intend to provide a broadly accessible introduction to our recent work in developing algorithms and software for this problem class. Our approach is based on constructing polyhedral outer approximations of the convex constraints, resulting in a global solution by solving a finite number of mixed-integer linear and continuous convex subproblems. The key advance we present is to strengthen the polyhedral approximations by constructing them in a higher-dimensional space. In order to automate this extended formulation we rely on the algebraic modeling technique of disciplined convex programming (DCP), and for generality and ease of implementation we use conic representations of the convex constraints. Although our framework requires a manual translation of existing models into DCP form, after performing this transformation on the MINLPLIB2 benchmark library we were able to solve a number of unsolved instances and on many other instances achieve superior performance compared with state-of-the-art solvers like Bonmin, SCIP, and Artelys Knitro.},
doi = {10.1007/s10107-017-1191-y},
journal = {Mathematical Programming},
number = 1-2,
volume = 172,
place = {United States},
year = {Thu Sep 14 00:00:00 EDT 2017},
month = {Thu Sep 14 00:00:00 EDT 2017}
}
Web of Science
Works referenced in this record:
An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
journal, February 2014
- Hijazi, Hassan; Bonami, Pierre; Ouorou, Adam
- INFORMS Journal on Computing, Vol. 26, Issue 1
Convex programming for disjunctive convex optimization
journal, December 1999
- Ceria, Sebastián; Soares, João
- Mathematical Programming, Vol. 86, Issue 3
Differential properties of Euclidean projection onto power cone
journal, September 2015
- Hien, Le Thi Khanh
- Mathematical Methods of Operations Research, Vol. 82, Issue 3
A polyhedral branch-and-cut approach to global optimization
journal, May 2005
- Tawarmalani, Mohit; Sahinidis, Nikolaos V.
- Mathematical Programming, Vol. 103, Issue 2
Extended formulations in mixed integer conic quadratic programming
journal, November 2016
- Vielma, Juan Pablo; Dunning, Iain; Huchette, Joey
- Mathematical Programming Computation, Vol. 9, Issue 3
Convex Optimization in Julia
conference, November 2014
- Udell, Madeleine; Mohan, Karanveer; Zeng, David
- 2014 First Workshop for High Performance Technical Computing in Dynamic Languages (HPTCDL)
Benchmarking optimization software with performance profiles
journal, January 2002
- Dolan, Elizabeth D.; Moré, Jorge J.
- Mathematical Programming, Vol. 91, Issue 2
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
journal, October 1986
- Duran, Marco A.; Grossmann, Ignacio E.
- Mathematical Programming, Vol. 36, Issue 3
Different transformations for solving non-convex trim-loss problems by MINLP
journal, March 1998
- Harjunkoski, Iiro; Westerlund, Tapio; Pörn, Ray
- European Journal of Operational Research, Vol. 105, Issue 3
Disciplined convex-concave programming
conference, December 2016
- Shen, Xinyue; Diamond, Steven; Gu, Yuantao
- 2016 IEEE 55th Conference on Decision and Control (CDC)
NP-hardness of deciding convexity of quartic polynomials and related problems
journal, November 2011
- Ahmadi, Amir Ali; Olshevsky, Alex; Parrilo, Pablo A.
- Mathematical Programming, Vol. 137, Issue 1-2
Constraint qualification failure in action
journal, July 2016
- Hijazi, Hassan; Liberti, Leo
- Operations Research Letters, Vol. 44, Issue 4
Algorithms for discrete nonlinear optimization in FICO Xpress
conference, July 2016
- Belotti, Pietro; Berthold, Timo; Neves, Kelligton
- 2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM)
An algorithmic framework for convex mixed integer nonlinear programs
journal, May 2008
- Bonami, Pierre; Biegler, Lorenz T.; Conn, Andrew R.
- Discrete Optimization, Vol. 5, Issue 2
On branching rules for convex mixed-integer nonlinear optimization
journal, December 2013
- Bonami, Pierre; Lee, Jon; Leyffer, Sven
- ACM Journal of Experimental Algorithmics, Vol. 18
Knitro: An Integrated Package for Nonlinear Optimization
book, January 2006
- Byrd, Richard H.; Nocedal, Jorge; Waltz, Richard A.
- Nonconvex Optimization and Its Applications
SCIP: solving constraint integer programs
journal, January 2009
- Achterberg, Tobias
- Mathematical Programming Computation, Vol. 1, Issue 1
FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
journal, November 2010
- Abhishek, Kumar; Leyffer, Sven; Linderoth, Jeff
- INFORMS Journal on Computing, Vol. 22, Issue 4
JuMP: A Modeling Language for Mathematical Optimization
journal, January 2017
- Dunning, Iain; Huchette, Joey; Lubin, Miles
- SIAM Review, Vol. 59, Issue 2
DrAmpl: a meta solver for optimization problem analysis
journal, August 2009
- Fourer, R.; Orban, Dominique
- Computational Management Science, Vol. 7, Issue 4
Branch and Bound Experiments in Convex Nonlinear Integer Programming
journal, December 1985
- Gupta, Omprakash K.; Ravindran, A.
- Management Science, Vol. 31, Issue 12
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
journal, October 1987
- Duran, Marco A.; Grossmann, Ignacio E.
- Mathematical Programming, Vol. 39, Issue 3
An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs
text, January 2005
- Bonami, Pierre; Biegler, Lorenz; Conn, Andrew
- Carnegie Mellon University
An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs
text, January 2006
- Bonami, Pierre; Biegler, Lorenz T.; Conn, Andrew R.
- Carnegie Mellon University
An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs
text, January 2006
- Bonami, Pierre; Biegler, Lorenz T.; Conn, Andrew R.
- Carnegie Mellon University
NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems
text, January 2010
- Ahmadi, Amir Ali; Olshevsky, Alex; Parrilo, Pablo A.
- arXiv
Convex Optimization in Julia
preprint, January 2014
- Udell, Madeleine; Mohan, Karanveer; Zeng, David
- arXiv
Disciplined Convex-Concave Programming
preprint, January 2016
- Shen, Xinyue; Diamond, Steven; Gu, Yuantao
- arXiv
Benchmarking Optimization Software with Performance Profiles
text, January 2001
- Dolan, Elizabeth D.; Moré, Jorge J.
- arXiv
Split cuts and extended formulations for Mixed Integer Conic Quadratic Programming
journal, January 2015
- Modaresi, Sina; Kılınç, Mustafa R.; Vielma, Juan Pablo
- Operations Research Letters, Vol. 43, Issue 1
Disjunctive cuts for cross-sections of the second-order cone
journal, July 2015
- Yıldız, Sercan; Cornuéjols, Gérard
- Operations Research Letters, Vol. 43, Issue 4
Applications of second-order cone programming
journal, November 1998
- Lobo, Miguel Sousa; Vandenberghe, Lieven; Boyd, Stephen
- Linear Algebra and its Applications, Vol. 284, Issue 1-3
How to Convexify the Intersection of a Second Order Cone and a Nonconvex Quadratic
preprint, January 2014
- Burer, Sam; Kilinc-Karzan, Fatma
- arXiv
Extended Formulations in Mixed-integer Convex Programming
text, January 2015
- Lubin, Miles; Yamangil, Emre; Bent, Russell
- arXiv
Works referencing / citing this record:
Small and strong formulations for unions of convex sets from the Cayley embedding
journal, March 2018
- Vielma, Juan Pablo
- Mathematical Programming, Vol. 177, Issue 1-2
Certifiably optimal sparse inverse covariance estimation
journal, August 2019
- Bertsimas, Dimitris; Lamperski, Jourdain; Pauphilet, Jean
- Mathematical Programming, Vol. 184, Issue 1-2
A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
journal, November 2019
- Kobayashi, Ken; Takano, Yuich
- Computational Optimization and Applications, Vol. 75, Issue 2
Mixed-Integer Convex Representability
journal, February 2022
- Lubin, Miles; Vielma, Juan Pablo; Zadik, Ilias
- Mathematics of Operations Research, Vol. 47, Issue 1
Submodularity in conic quadratic mixed 0-1 optimization
preprint, January 2017
- Atamturk, Alper; Gomez, Andres
- arXiv