Reformulations for utilizing separability when solving convex MINLP problems
From MaRDI portal
Publication:721170
DOI10.1007/s10898-018-0616-3zbMath1402.90098OpenAlexW2793437242MaRDI QIDQ721170
Andreas Lundell, Tapio Westerlund, Jan Kronqvist
Publication date: 18 July 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0616-3
outer approximationextended cutting plane algorithmextended supporting hyperplane algorithmconvex MINLPlifted polyhedral approximationseparable MINLP
Related Items
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, A disjunctive cut strengthening technique for convex MINLP, Pyomo.GDP: an ecosystem for logic based modeling and optimization development, Using projected cutting planes in the extended cutting plane method, The supporting hyperplane optimization toolkit for convex MINLP, A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints, Sparse convex optimization toolkit: a mixed-integer framework, Distributed primal outer approximation algorithm for sparse convex programming with separable structures, A proximal-point outer approximation algorithm, Preface to the special issue ``GOW'16, Partially distributed outer approximation, Using regularization and second order information in outer approximation for convex MINLP, Alternative regularizations for outer-approximation algorithms for convex MINLP, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
Uses Software
Cites Work
- A reformulation framework for global optimization
- Projection, lifting and extended formulation integer and combinatorial optimization
- A review of recent advances in global optimization
- Convex underestimation for posynomial functions of positive variables
- An algorithmic framework for convex mixed integer nonlinear programs
- A tutorial on geometric programming
- Solving mixed integer nonlinear programs by outer approximation
- Extended formulations in mixed integer conic quadratic programming
- 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
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- BARON: A general purpose global optimization software package
- On interval branch-and-bound for additively separable functions with common variables
- Generalized Benders decomposition
- Polyhedral approximations inp-order cone programming
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- Extended Formulations in Mixed-Integer Convex Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A tree-search algorithm for mixed integer programming problems
- Convex Analysis
- Extended formulations in combinatorial optimization
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
