求解全局優(yōu)化的填充法函數(shù)方法.pdf

1、上海大學(xué)碩士學(xué)位論文求解全局優(yōu)化的填充法函數(shù)方法姓名：徐勤亞申請學(xué)位級別：碩士專業(yè)：運籌學(xué)與控制論指導(dǎo)教師：張連生20030101AbstractTheglobaloptimizationproblemcanbestatedasfollows：Givenanonempty，compactsetDcR“andacontinuousdifferentiablefunction，：ARwhereAcR“isasuitablesetcontai

2、ningDfindatleastonepoint茁∈Dsuchthatf(x’)≤，(z)，forallz∈D，ieglobminxED，(z)orweconsiderthemoregenerallycasesasfollows：glDb墨一inf(z)whereS=z19：(z)≤0，i=1，2，，risaconstrainedsetinR“9。(z)，i=1，2continuousdi黯rentiabtefunctionsThere

3、areman)“applicationsofnonlinearglobaloptimizationinthefieldofmilitariness：scienceandtechnologyoptimaldesignofengineering，automaticcontrol，economicmanagementandSOonUnfortunately，thetheoryandalgorithmofglobaloptimizationis

4、nowherenearasmatureasthatofthelocaloptimization，SOfar，fornon—convexfuaction，therelacksofthecriterionforglobaloptimizationThepaperisorganizedasfoilows：Inchapter1，abriefintroductionisgiventothesignificanceandthepopularmeth

5、odstotheglobaloptimizationproblemsInchapter2，weintroducesomemainideaandsomeworkonthefilledfunctionmethodInchapter3，wegiveanewfilledfunctiononthebaseoftheworkthathasbeendonealreadyInchapter4weconstructanimplementablealgor