zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Performance of some SQP algorithms on structural design problems. (English) Zbl 0599.73090

This paper describes the basic ideas of sequential quadratic programming (SQP) algorithms for design optimization. There are two fundamental differences between the various algorithms: (i) the definition of the QP subproblem solved at each iteration, and (ii) the descent function used during step size determination. The performances of the algorithms can change dramatically depending on how the two steps are executed. Numerical implementation details of various computational steps are discussed.

Three programs based on SQP algorithms are used to solve 17 structural design problems having 7 to 96 design variables and 10 to 1051 performance constraints besides design variable bounds. Based on the performance of these programs, efficient procedures to execute various steps of the SQP methods are determined. It is concluded that the potential constraint strategy, where only a subset of the constraints is used to define the QP subproblem, is essential for large scale engineering design applications. With this strategy the SQP methods are quite robust and have great potential for routine application in engineering design.

MSC:
74P99Optimization in solid mechanics
74S30Other numerical methods in solid mechanics
65K05Mathematical programming (numerical methods)
74-04Machine computation, programs (mechanics of deformable solids)