摘要
Inordertoovercomethedifficultiescausedbysingularoptima,inthepresentpaper,anewmethodforthesolutionsofstructuraltopologyoptimizationproblemsisproposed.Thedistinctivefeatureofthismethodisthatinsteadofsolv-ingtheoriginaloptimizationproblemdirectly,weturntoseekingthesolutionsofasequenceofapproximatedproblemswhichareformulatedbyrelaxingtheconstraintsoftheoriginalproblemtosomeextent.Theapproximatedproblemcanbesolvedefficientlybyemployingthealgorithmsdevelopedforsizingoptimizationproblemsbecauseitssolutionisnotsingular.Itcanalsobeprovedthatwhentherelaxationparameteristendingtozero,thesolutionoftheapproximatedproblemwillconvergetothesolutionoftheoriginalproblemuniformly.Numericalexamplesillustratetheeffectivenessandvalidityofthepresentapproach.Resultsarealsocomparedwiththoseobtainedbytraditionalmethods.
出版日期
1997年02月12日（中国Betway体育网页登陆平台首次上网日期，不代表论文的发表时间）
