The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
From MaRDI portal
Recommendations
- The supporting hyperplane optimization toolkit for convex MINLP
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- On solving generalized convex MINLP problems using supporting hyperplane techniques
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- Two linear approximation algorithms for convex mixed integer nonlinear programming
Cites work
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- A reformulation framework for global optimization
- A review of recent advances in global optimization
- A tree-search algorithm for mixed integer programming problems
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Algorithm 748: enclosing zeros of continuous functions
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- An algorithmic framework for convex mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- BARON: A general purpose global optimization software package
- Generalized Benders decomposition
- Global optimization of mixed-integer signomial programming problems
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Introduction to nonsmooth optimization. Theory, practice and software
- OSiL: An instance language for optimization
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- Some transformation techniques with applications in global optimization
- Survey of Bundle Methods for Nonsmooth Optimization
- The Supporting Hyperplane Method for Unimodal Programming
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
Cited in
(38)- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Reformulating the disjunctive cut generating linear program
- Using projected cutting planes in the extended cutting plane method
- A polyhedral approximation algorithm for recession cones of spectrahedral shadows
- On cutting plane algorithms for nonlinear binary optimization
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- Solving Euclidean max-sum problems exactly with cutting planes
- Polyhedral approximation of spectrahedral shadows via homogenization
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- Conflict Analysis for MINLP
- Outer approximation for integer nonlinear programs via decision diagrams
- On decomposition and multiobjective-based column and disjunctive cut generation for MINLP
- Reformulations for utilizing separability when solving convex MINLP problems
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
- Global optimization of mixed-integer nonlinear programs with SCIP 8
- A proximal-point outer approximation algorithm
- Preprocessing and cutting planes with conflict graphs
- Using regularization and second order information in outer approximation for convex MINLP
- Fill‐rate service level constrained distribution network design
- The supporting hyperplane optimization toolkit for convex MINLP
- On the approximation of unbounded convex sets by polyhedra
- A disjunctive cut strengthening technique for convex MINLP
- 50 years of mixed-integer nonlinear and disjunctive programming
- SHOT
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
- Convex mixed-integer optimization with Frank-Wolfe methods
- On solving generalized convex MINLP problems using supporting hyperplane techniques
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
- Solving continuous and discrete nonlinear programs with BARON
- A choice-based optimization approach for contracting in supply chains
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- Distributed primal outer approximation algorithm for sparse convex programming with separable structures
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- Generating feasible points for mixed-integer convex optimization problems by inner parallel cuts
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023
Describes a project that uses
Uses Software
This page was built for publication: The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5964241)
