The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
From MaRDI portal
Publication:2173514
DOI10.1007/s10898-020-00888-xzbMath1441.90100OpenAlexW3007543531MaRDI QIDQ2173514
Ivo Nowak, Pavlo Muts, Eligius M. T. Hendrix
Publication date: 23 April 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00888-x
Convex programming (90C25) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
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 ⋮ Fill‐rate service level constrained distribution network design ⋮ Distributed primal outer approximation algorithm for sparse convex programming with separable structures ⋮ Partially distributed outer approximation
Uses Software
Cites Work
- Unnamed Item
- Decomposition in general mathematical programming
- Solving mixed integer nonlinear programs by outer approximation
- Decomposition-based inner- and outer-refinement algorithms for global optimization
- A polyhedral branch-and-cut approach to global optimization
- Polyhedral approximation in mixed-integer convex optimization
- A storm of feasibility pumps for nonconvex MINLP
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Decomposition and dynamic cut generation in integer linear programming
- Generalized Benders decomposition
- 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
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Selected Topics in Column Generation
- A tree-search algorithm for mixed integer programming problems
- Pyomo -- optimization modeling in Python
- A geometric study of dual gaps, with applications
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
This page was built for publication: The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
