A dynamic penalty function method for the solution of structural optimization problems
type: Item
instance of: scholarly article
title: A dynamic penalty function method for the solution of structural optimization problems
zbMATH Open document ID: 0807.73046
DOI: 10.1016/0307-904X(94)90307-7
author: Nielen Stander
author: W. J. Roux
author: Johannes Arnoldus Snyman
published in: Applied Mathematical Modelling
publication date: 1994-10-30T00:00:00Z
review text: This paper presents an adaptation of an existing dynamic trajectory method for unconstrained minimization to handle constrained optimization problems. This is done by the application of a dynamic penalty parameter procedure to allow for the constraints. The method is applied to structural optimization problems that involve the determination of minimum weight structures of trusses and frames, subject to stress, displacement, and frequency constraints, under various prescribed load conditions. We use the successive application of the trajectory method to approximate quadratic subproblems that can be solved economically. The comprehensive new approach is called the DYNAMIC-\(Q\) method. The method is successfully applied to a number of truss and frame problems and is found to be both reliable and easy to use.
Mathematics Subject Classification ID: 74P99
Mathematics Subject Classification ID: 74S30
zbMATH DE Number: 679970
zbMATH Keywords: dynamic trajectory method
zbMATH Keywords: constrained optimization
zbMATH Keywords: minimum weight structures
zbMATH Keywords: successive application
zbMATH Keywords: quadratic subproblems
zbMATH Keywords: DYNAMIC-\(Q\) method
describes a project that uses: NAG
describes a project that uses: nag
MaRDI profile type: Publication
cites work: A new and dynamic method for unconstrained minimization
cites work: An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
cites work: UNCONSTRAINED MINIMIZATION BY COMBINING THE DYNAMIC AND CONJUGATE GRADIENT METHODS
cites work: A multi-start global minimization algorithm with dynamic search trajectories
cites work: A convergent dynamic method for large minimization problems
cites work: Penalty function solutions to optimal control problems with general constraints via a dynamic optimisation method
cites work: Q4739659
cites work: A study of mathematical programmingmethods for structural optimization. Part II: Numerical results
description: scientific article; zbMATH DE number 679970