Optimal centers in branch-and-prune algorithms for univariate global optimization

We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound constraints. The algorithm works within the branch-and-bound framework and uses first order information of the objective funct...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Applied mathematics and computation Ročník 169; číslo 1; s. 247 - 277
Hlavní autori:	Sotiropoulos, D.G., Grapsa, T.N.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY Elsevier Inc 01.10.2005 Elsevier
Predmet:	Branch-and-prune Calculus of variations and optimal control Exact sciences and technology Global optimization Mathematical analysis Mathematics Numerical analysis Numerical analysis. Scientific computation Numerical methods in mathematical programming, optimization and calculus of variations Numerical methods in optimization and calculus of variations Optimal centers Optimal mean value form Pruning steps Sciences and techniques of general use Optimal centers Global optimization Optimal mean value form Pruning steps Branch-and-prune Optimal mean value Optimization method Numerical method Computing Algorithm Natural selection Optimal center Branching process Applied mathematics Pruning(tree) Objective function Mathematical programming Branch and prune algorithm
ISSN:	0096-3003, 1873-5649
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!