On solving generalized convex MINLP problems using supporting hyperplane techniques
From MaRDI portal
Publication:1668811
DOI10.1007/s10898-018-0644-zzbMath1397.90286MaRDI QIDQ1668811
Marko M. Mäkelä, Tapio Westerlund, Ville-Pekka Eronen
Publication date: 29 August 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0644-z
nonsmooth optimization; cutting planes; supporting hyperplanes; mixed-integer nonlinear programming; generalized convexities
Related Items
Using projected cutting planes in the extended cutting plane method, Outer approximation for mixed-integer nonlinear robust optimization, The supporting hyperplane optimization toolkit for convex MINLP, On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A reformulation framework for global optimization
- Regularized optimization methods for convex MINLP problems
- Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17--21, 2008
- Generalized convexity and optimization. Theory and applications
- Different transformations for solving non-convex trim-loss problems by MINLP
- Solving mixed integer nonlinear programs by outer approximation
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A branch-and-reduce approach to global optimization
- Generalized Benders decomposition
- Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Introduction to Nonsmooth Optimization
- The Cutting-Plane Method for Solving Convex Programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
- Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
- The Supporting Hyperplane Method for Unimodal Programming
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
