Suchergebnisse - "Extended supporting hyperplane algorithm"

The supporting hyperplane optimization toolkit for convex MINLP

Autoren: Lundell, A. Kronqvist, Jan Westerlund, T.

Quelle: Journal of Global Optimization. 84(1):1-41

Schlagwörter: Convex mixed-integer nonlinear programming (MINLP), Extended cutting plane (ECP) algorithm, Extended supporting hyperplane (ESH) algorithm, Multi-tree and single-tree algorithms, Polyhedral outer approximation (POA), Supporting hyperplane optimization toolkit (SHOT), Approximation algorithms, Benchmarking, Forestry, Integer programming, Iterative methods, Linearization, Nonlinear programming, Open source software, Trees (mathematics), Convex mixed-integer nonlinear programming, Cutting plane algorithms, Extended cutting plane algorithm, Extended supporting hyperplane algorithm, Mixed-integer nonlinear programming, Multi-tree and single-tree algorithm, Optimisations, Outer approximation, Polyhedral outer approximation, Supporting hyperplane optimization toolkit, Tree algorithms, Geometry

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-320541
https://doi.org/10.1007/s10898-022-01128-0

Reformulations for utilizing separability when solving convex MINLP problems

Autoren: Kronqvist, Jan Lundell, Andreas Westerlund, Tapio

Quelle: Kronqvist, J, Lundell, A & Westerlund, T 2018, 'Reformulations for utilizing separability when solving convex MINLP problems', Journal of Global Optimization, vol. 71, no. 3, pp. 571–592. https://doi.org/10.1007/s10898-018-0616-3

Schlagwörter: Convex MINLP, Lifted polyhedral approximation, Separable MINLP, Extended supporting hyperplane algorithm, Outer approximation, extended cutting plane algorithm

Relation: info:eu-repo/semantics/altIdentifier/pissn/0925-5001; info:eu-repo/semantics/altIdentifier/eissn/1573-2916

Verfügbarkeit: https://research.abo.fi/en/publications/3dd44456-2c88-48d5-9541-fad12c32eae3
https://doi.org/10.1007/s10898-018-0616-3