Abstract
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 Ohsaki et al. (Comp. Meth. Appl. Mech. Eng. 180:203–217, 1999). 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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bannai E, Ito T (1984) Algebraic combinatorics I: association schemes. Benjamin/Cummings, Redwood
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
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
Gatermann K, Parrilo PA (2004) Symmetry groups, semidefinite programs, and sum of squares. J Pure Applies Algebra 192:95–128
Graham A (1981) Kronecker products and matrix calculus with applications. Ellis Horwood, Chichester
Kanno Y, Ohsaki M, Murota K, Katoh N (2001) Group symmetry in interior-point methods for semidefinite program. Optim Eng 2(3):293–320
Miller W (1972) Symmetry, groups and their applications. Academic Press, San Diego
Murota K, Ikeda K (1991) Computational use of group theory in bifurcation analysis of symmetric structures. SIAM J Sci Stat Comput 12:273–297
Ohsaki M (2000) Optimization of geometrically non-linear symmetric systems with coincident critical points. Int J Numer Methods Eng 48:1345–1357
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
Schrijver A (1979) A comparison of the Delsarte and Lovász bounds. IEEE Trans Inf Theory 25:425–429
Schrijver A (2005) New code upper bounds from the Terwilliger algebra. IEEE Trans Inf Theory 51:2859–2866
Serre J-P (1977) Linear representations of finite groups. Graduate texts in mathematics, vol 42. Springer, New York
Wedderburn JHM (1907) On hypercomplex numbers. Proc Lond Math Soc 6(2):77–118
Wedderburn JHM (1934) Lectures on matrices. AMS colloquium publications, vol 17, AMS publishers
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Bai, Y., de Klerk, E., Pasechnik, D. et al. Exploiting group symmetry in truss topology optimization. Optim Eng 10, 331–349 (2009). https://doi.org/10.1007/s11081-008-9050-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11081-008-9050-6