Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
From MaRDI portal
Publication:2124807
DOI10.1007/s10898-021-01006-1zbMath1490.90200OpenAlexW3136201123MaRDI QIDQ2124807
Andreas Lundell, Jan Kronqvist
Publication date: 11 April 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01006-1
polyhedral outer approximationreformulation techniquesnonconvex MINLPfeasibility relaxationlocal and global MINLP techniquesSupporting Hyperplane Optimization Toolkit (SHOT)
Related Items
Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs, Optimization and analysis of three-part tariff pricing strategies, Preface to the special issue dedicated to the 6th world congress on global optimization held in Metz, France, July 8--10, 2019
Uses Software
Cites Work
- Unnamed Item
- ROSE
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- A reformulation framework for global optimization
- A recipe for finding good solutions to MINLPs
- Reformulations for utilizing separability when solving convex MINLP problems
- Interval analysis on directed acyclic graphs for global optimization
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Piecewise-linear approximations of multidimensional functions
- Editorial: Reformulation techniques in mathematical programming
- Some transformation techniques with applications in global optimization
- Solving mixed integer nonlinear programs by outer approximation
- Juniper: an open-source nonlinear branch-and-bound solver in Julia
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- Decomposition-based inner- and outer-refinement algorithms for global optimization
- 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
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A storm of feasibility pumps for nonconvex MINLP
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- SUSPECT: MINLP special structure detector for Pyomo
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Piecewise linear approximation of functions of two variables in MILP models
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- A branch-and-cut algorithm for mixed-integer bilinear programming
- Using regularization and second order information in outer approximation for convex MINLP
- Three ideas for a feasibility pump for nonconvex MINLP
- Mixed integer nonlinear programming tools: an updated practical overview
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Generalized Benders decomposition
- The feasibility pump
- Piecewise polyhedral formulations for a multilinear term
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Improving the performance of DICOPT in convex MINLP problems using a feasibility pump
- A tree-search algorithm for mixed integer programming problems
- Deterministic global optimization using interval constraint propagation techniques
- JuMP: A Modeling Language for Mathematical Optimization
- Pyomo -- optimization modeling in Python
- Deterministic global optimization in nonlinear optimal control problems
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
