Decomposition-based inner- and outer-refinement algorithms for global optimization
From MaRDI portal
Publication:1756777
DOI10.1007/s10898-018-0633-2zbMath1417.90122OpenAlexW2790736634MaRDI QIDQ1756777
Grégoire Njacheun-Njanzoua, Norman Breitfeld, Ivo Nowak, Eligius M. T. Hendrix
Publication date: 21 December 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0633-2
Related Items (11)
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT ⋮ A disjunctive cut strengthening technique for convex MINLP ⋮ On decomposition and multiobjective-based column and disjunctive cut generation for MINLP ⋮ The supporting hyperplane optimization toolkit for convex MINLP ⋮ The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming ⋮ A column generation algorithm for solving energy system planning problems ⋮ Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes ⋮ Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization ⋮ Partially distributed outer approximation ⋮ Branch-and-price for a class of nonconvex mixed-integer nonlinear programs ⋮ Decogo
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Decomposition in general mathematical programming
- Global minimization by reducing the duality gap
- Solving mixed integer nonlinear programs by outer approximation
- A polyhedral branch-and-cut approach to global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Could we use a million cores to solve an integer program?
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Decomposition and dynamic cut generation in integer linear programming
- Generalized Benders decomposition
- An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization
- Combination of Nonlinear and Linear Optimization of Transient Gas Networks
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Une méthode d'optimisation non linéaire en variables mixtes pour la conception de procédés
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
- Selected Topics in Column Generation
- Mixed-integer nonlinear optimization
- Pyomo -- optimization modeling in Python
- A geometric study of dual gaps, with applications
This page was built for publication: Decomposition-based inner- and outer-refinement algorithms for global optimization
