zbMATH — the first resource for mathematics

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.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
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)
The expansion of functions under transformation and its application to optimization. (English) Zbl 0847.73076
Summary: This paper proposes the expansion of functions under transformation, which represents infinite kinds of extensions of Taylor’s expansion. Based on this, Duffin’s condensation formula is developed as a condensation formula of high order. Furthermore, a theorem on efficiently solving mathematical programming by using the expansion of functions is proposed. According to the condensation formula of high order, two kinds of second order primal algorithms are proposed for solving generalized geometric programming with rapid and stable convergence, which could be applied to a wide range of structural optimization problems. Finally, an efficient fully stressed design method under the function transformation is proposed using these expansions of functions.

74S30Other numerical methods in solid mechanics
74P99Optimization in solid mechanics
Full Text: DOI
[1] Sui, Yun-Kang; Geng, Shu-Sen: Extension of Taylor’s expansion and its application in solving mathematical programming. J. engrg. Math. 2, No. 1, 173-176 (1985)
[2] Rijckaert, M. J.; Martens, X. M.: Comparison of generalized geometric programming algorithms. Advances in geometric programming, 283-320 (1980) · Zbl 0444.49028
[3] Avriel, M.; Dembo, R. S.; Passy, U.: Solution of generalized geometric programming. Internat. J. Numer. methods engrg. 9, 149-168 (1975) · Zbl 0299.65035
[4] Morris, A. J.: Structural optimization by geometric programming. Internat. J. Solid structures 8, 847-864 (1972) · Zbl 0255.73086
[5] Ragsdell, K. M.; Phillips, D. T.: Optimal design of class of welded structurs using geometric programming. J. engrg. Ind., trans. ASME, series B 98, 1021-1025 (1976)