ISSN:
0029-5981
Schlagwort(e):
dynamic response optimization
;
max-value cost function
;
ALM method
;
approximate optimization
;
Engineering
;
Numerical Methods and Modeling
Quelle:
Wiley InterScience Backfile Collection 1832-2000
Thema:
Mathematik
,
Technik allgemein
Notizen:
A globally convergent and efficient algorithm for min-max dynamic response optimization using the ALM method is presented. This algorithm employs an approximate augmented Lagrangian for line searches, and an exact augmented Lagrangian for finding search directions. This approximate augmented Lagrangian is composed of the linearized cost and constraint functions projected on the search direction. It is noted that an approximate penalty term has the same approximate Hessian as that of the Gauss-Newton method. This makes the approximate augmented Lagrangian to have almost second-order accuracy near the optimum. In the unconstrained optimization process of the proposed method, some modifications are also suggested to remove the possible distortion of optimization trajectory when the side constraints on design variables are separately handled. Also, the efficiencies of two treatments for handling a max-value cost function are discussed in the context of the proposed method. The numerical performance of the proposed method is investigated by solving three min-max dynamic response optimization problems and comparing the results with those in the literature. This comparison shows that the suggested algorithm is more efficient than those in the literature. Especially, it is found that the direct treatment for a max-value cost function is more efficient than the transformation treatment for all the design cases. © 1998 John Wiley & Sons, Ltd.
Zusätzliches Material:
6 Ill.
Materialart:
Digitale Medien
Permalink
