Global optimum shape design

被引：3

作者：

Pan, XC ^{[1
]}

Zheng, QA

机构：

[1] China Text Univ, Shanghai 200051, Peoples R China

[2] Brock Univ, Dept Math, St Catharines, ON L2S 3A1, Canada

[3] Shanghai Univ, Shanghai 201800, Peoples R China

来源：

COMPUTERS & MATHEMATICS WITH APPLICATIONS | 1999年 / 37卷 / 4-5期

关键词：

mathematical programming; random number generation; testing; choice of initial values;

D O I：

10.1016/S0898-1221(99)00066-8

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

An optimum shape design problem can be formulated as a minimization problem of a functional subject to certain constraints. Usually, it is nonlinear and nonconvex. Conventional optimization techniques are gradient-based, they highly depend on the initial design, and are difficult to be applied to find a global solution. Integral global optimization algorithm is proposed to solve optimum shape design problems. Three design examples are given to illustrate the effectiveness of the algorithm. (C) 1999 Elsevier Science Ltd. All rights reserved.

引用

页码：151 / 162

页数：12

共 12 条

[1]

Brebbia CA., 1980, Boundary element techniques in engineering

[2]

CHEN D, 1989, COMPUTATIONAL STRUCT, V6, P67

[3]

CHEW SH, 1988, LECT NOTES EC MATH S, V298

[4]

DIPILLO G, 1989, SIAM J CONTROL OPTIM, V27, P1333, DOI DOI 10.1137/0327068

[5]

Fiacco A.V., 1990, Nonlinear Programming Sequential Unconstrained Minimization Techniques

[6]

FLUGGE W, 1952, 2612 NASA TN

[7] SET-VALUED ROBUST MAPPINGS AND APPROXIMATABLE MAPPINGS [J].

SHI, SZ ;

ZHENG, Q ;

ZHUANG, DM .

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1994, 183 (03) :706-726

[8] Discontinuous robust mappings are approximatable [J].

Shi, SZ ;

Zheng, QA ;

Zhuang, DM .

TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1995, 347 (12) :4943-4957

[9]

YING K, 1987, ENG MECH, V2, P125

[10]

Zheng Q., 1992, RECENT ADV GLOBAL OP, P298

← 1 2 →