Extended reverse-convex programming: an approximate enumeration approach to global optimization

A new approach to solving a large class of factorable nonlinear programming (NLP) problems to global optimality is presented in this paper. Unlike the traditional strategy of partitioning the decision-variable space employed in many branch-and-bound methods, the proposed approach approximates the NL...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of global optimization Ročník 65; číslo 2; s. 191 - 229
Hlavní autor:	Bunin, Gene A.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.06.2016 Springer Springer Nature B.V
Témata:	Algorithms Approximation Candidates Computer Science Enumeration Mathematical analysis Mathematics Mathematics and Statistics Nonlinear programming Operations Research/Decision Theory Optimization Programming Real Functions Regularity Strategy Studies Variables Implicit enumeration methods Concave programming Factorable programming Piecewise-concave approximation Reverse-convex programming
ISSN:	0925-5001, 1573-2916
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!