zbMATH — the first resource for mathematics

Exploiting group symmetry in truss topology optimization. (English) Zbl 1400.90242
Summary: We consider semidefinite programming (SDP) formulations of certain truss topology optimization problems, where a lower bound is imposed on the fundamental frequency of vibration of the truss structure. These SDP formulations were introduced in [M. Ohsaki et al., Comput. Methods Appl. Mech. Eng. 180, No. 1-2, 203–217 (1999; Zbl 0943.90060)]. We show how one may automatically obtain symmetric designs, by eliminating the ‘redundant’ symmetry in the SDP problem formulation. This has the advantage that the original SDP problem is substantially reduced in size for trusses with large symmetry groups.

90C22 Semidefinite programming
74D10 Nonlinear constitutive equations for materials with memory
90C90 Applications of mathematical programming
Full Text: DOI
[1] Bannai E, Ito T (1984) Algebraic combinatorics I: association schemes. Benjamin/Cummings, Redwood · Zbl 0555.05019
[2] de Klerk E, Maharry J, Pasechnik DV, Richter B, Salazar G (2006) Improved bounds for the crossing numbers of K m,n and K n . SIAM J Discr Math 20:189–202 · Zbl 1111.05029 · doi:10.1137/S0895480104442741
[3] de Klerk E, Pasechnik DV, Schrijver A (2007) Reduction of symmetric semidefinite programs using the regular *-representation. Math Program B 109(2–3):613–624 · Zbl 1200.90136 · doi:10.1007/s10107-006-0039-7
[4] Gatermann K, Parrilo PA (2004) Symmetry groups, semidefinite programs, and sum of squares. J Pure Applies Algebra 192:95–128 · Zbl 1108.13021 · doi:10.1016/j.jpaa.2003.12.011
[5] Graham A (1981) Kronecker products and matrix calculus with applications. Ellis Horwood, Chichester · Zbl 0497.26005
[6] Kanno Y, Ohsaki M, Murota K, Katoh N (2001) Group symmetry in interior-point methods for semidefinite program. Optim Eng 2(3):293–320 · Zbl 1035.90056 · doi:10.1023/A:1015366416311
[7] Miller W (1972) Symmetry, groups and their applications. Academic Press, San Diego · Zbl 0306.22001
[8] Murota K, Ikeda K (1991) Computational use of group theory in bifurcation analysis of symmetric structures. SIAM J Sci Stat Comput 12:273–297 · Zbl 0721.65029 · doi:10.1137/0912016
[9] Ohsaki M (2000) Optimization of geometrically non-linear symmetric systems with coincident critical points. Int J Numer Methods Eng 48:1345–1357 · Zbl 0985.74053 · doi:10.1002/1097-0207(20000730)48:9<1345::AID-NME951>3.0.CO;2-O
[10] Ohsaki M, Fujisawa K, Katoh N, Kanno Y (1999) Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints. Comp Methods Appl Mech Eng 180:203–217 · Zbl 0943.90060 · doi:10.1016/S0045-7825(99)00056-0
[11] Schrijver A (1979) A comparison of the Delsarte and Lovász bounds. IEEE Trans Inf Theory 25:425–429 · Zbl 0444.94009 · doi:10.1109/TIT.1979.1056072
[12] Schrijver A (2005) New code upper bounds from the Terwilliger algebra. IEEE Trans Inf Theory 51:2859–2866 · Zbl 1298.94152 · doi:10.1109/TIT.2005.851748
[13] Serre J-P (1977) Linear representations of finite groups. Graduate texts in mathematics, vol 42. Springer, New York
[14] Wedderburn JHM (1907) On hypercomplex numbers. Proc Lond Math Soc 6(2):77–118 · JFM 38.0135.02 · doi:10.1112/plms/s2-6.1.77
[15] Wedderburn JHM (1934) Lectures on matrices. AMS colloquium publications, vol 17, AMS publishers · Zbl 0010.09904
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.