A new filled function algorithm for constrained global optimization problems

A new filled function with one parameter is proposed for solving constrained global optimization problems without the coercive condition, in which the filled function contains neither exponential term nor fractional term and is easy to be calculated. A corresponding filled function algorithm is esta...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Applied mathematics and computation Ročník 217; číslo 12; s. 5853 - 5859
Hlavní autoři:	He, Suxiang, Chen, Weilai, Wang, Hui
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier Inc 15.02.2011 Elsevier
Témata:	Adjustable parameter Algorithms Coercive force Computation Constrained global optimization problems Constraints Exact sciences and technology Filled function algorithm Mathematical analysis Mathematical models Mathematics Minimizer Numerical analysis Numerical analysis. Scientific computation Numerical results Optimization Sciences and techniques of general use Special functions Minimizer Filled function algorithm Constrained global optimization problems Numerical results Adjustable parameter Optimization method Algorithm Exponential function Constrained optimization Numerical analysis Algorithm performance Applied mathematics Problem solving Algorithm analysis
ISSN:	0096-3003, 1873-5649
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!