Artikel
The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
This paper presents a new two-phase method for solving convex mixed-integer nonlinear programming (MINLP) problems, called Decomposition-based Outer Approximation Algorithm (DECOA). In the first phase, a sequence of linear integer relaxed sub-problems (LP phase) is solved in order to rapidly generate a good linear relaxation of the original MINLP problem. In the second phase, the algorithm solves a sequence of mixed integer linear programming sub-problems (MIP phase). In both phases the outer approximation is improved iteratively by adding new supporting hyperplanes by solving many easier sub-problems in parallel. DECOA is implemented as a part of Decogo (Decomposition-based Global Optimizer), a parallel decomposition-based MINLP solver implemented in Python and Pyomo. Preliminary numerical results based on 70 convex MINLP instances up to 2700 variables show that due to the generated cuts in the LP phase, on average only 2–3 MIP problems have to be solved in the MIP phase.
- Sprache
-
Englisch
- Erschienen in
-
Journal: Journal of Global Optimization ; ISSN: 1573-2916 ; Volume: 77 ; Year: 2020 ; Issue: 1 ; Pages: 75-96 ; New York, NY: Springer US
- Klassifikation
-
Mathematik
- Thema
-
Global optimization
Decomposition method
Convex MINLP
Outer approximation
DECOA
- Ereignis
-
Geistige Schöpfung
- (wer)
-
Muts, Pavlo
Nowak, Ivo
Hendrix, Eligius M. T.
- Ereignis
-
Veröffentlichung
- (wer)
-
Springer US
- (wo)
-
New York, NY
- (wann)
-
2020
- DOI
-
doi:10.1007/s10898-020-00888-x
- Letzte Aktualisierung
-
10.03.2025, 11:43 MEZ
Datenpartner
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Artikel
Beteiligte
- Muts, Pavlo
- Nowak, Ivo
- Hendrix, Eligius M. T.
- Springer US
Entstanden
- 2020
Ähnliche Objekte (12)
Convex relaxations for mixed-integer nonlinear programs
Algorithms for Mixed-Integer Bilevel Problems with Convex Followers
Lagrangian Decomposition of Mixed-Integer All-Quadratic Programs
hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
Convex approximations for a class of mixed-integer recourse models
Outer approximation for global optimization of mixed-integer quadratic bilevel problems
A branch-and-bound algorithm for multiobjective mixed-integer convex optimization
Exact mixed-integer programming
Decomposition Methods for Time-Dependent Mixed-Integer Nonlinear Optimization Problems on Graphs
Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming
Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming
Computational mixed-integer semidefinite programming
Convex relaxations for mixed-integer nonlinear programs
Algorithms for Mixed-Integer Bilevel Problems with Convex Followers
Lagrangian Decomposition of Mixed-Integer All-Quadratic Programs
hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
Convex approximations for a class of mixed-integer recourse models
Outer approximation for global optimization of mixed-integer quadratic bilevel problems
A branch-and-bound algorithm for multiobjective mixed-integer convex optimization
Exact mixed-integer programming
Decomposition Methods for Time-Dependent Mixed-Integer Nonlinear Optimization Problems on Graphs
Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming
Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming
Computational mixed-integer semidefinite programming
Convex relaxations for mixed-integer nonlinear programs
Algorithms for Mixed-Integer Bilevel Problems with Convex Followers
Lagrangian Decomposition of Mixed-Integer All-Quadratic Programs
hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
Convex approximations for a class of mixed-integer recourse models
Outer approximation for global optimization of mixed-integer quadratic bilevel problems
A branch-and-bound algorithm for multiobjective mixed-integer convex optimization
Exact mixed-integer programming
Decomposition Methods for Time-Dependent Mixed-Integer Nonlinear Optimization Problems on Graphs
Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming
Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming