Linearization and parallelization schemes for convex mixed-integer nonlinear optimization

We develop and test linearization and parallelization schemes for convex mixed-integer nonlinear programming. Several linearization approaches are proposed for LP/NLP based branch-and-bound. Some of these approaches strengthen the linear approximation to nonlinear constraints at the root node and so...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computational optimization and applications Ročník 81; číslo 2; s. 423 - 478
Hlavní autoři:	Sharma, Meenarli, Palkar, Prashant, Mahajan, Ashutosh
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.03.2022 Springer Nature B.V
Témata:	Algorithms Approximation Convex and Discrete Geometry Linearization Management Science Mathematics Mathematics and Statistics Mixed integer Nodes Nonlinear programming Operations Research Operations Research/Decision Theory Optimization Statistics Toolkits Variables Branch-and-bound Convex MINLP Outer approximation Linearization techniques Shared-memory parallel
ISSN:	0926-6003, 1573-2894
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!