Numerical block diagonalization of matrix-algebras with application to semidefinite programming

Mathematical Programming

Volumn 129, Issue 1, 2011, Pages 91-111

  De Klerk, Etienne ^a   Dobre, Cristian ^a   Pasechnik, Dmitrii V ^b  

^a TILBURG UNIVERSITY   (Netherlands)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Algebraic symmetry; Interior point methods; Pre processing; Semidefinite programming

Indexed keywords

ACTIVE AREA; ALGEBRAIC SYMMETRY; BLOCK DIAGONALIZATION; COMPUTATIONAL RESULTS; INTERIOR POINT ALGORITHM; INTERIOR POINT METHODS; PRE-PROCESSING; SEMI-DEFINITE PROGRAMMING;

ALGEBRA;

MATHEMATICAL PROGRAMMING;

EID: 80052570511     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-011-0461-3     Document Type: Article

References (31)

1. Alizadeh, F.: Combinatorial optimization with interior point methods and semi-definite matrices. PhD thesis, University of Minnesota, Minneapolis, USA (1991)
2. C. Bachoc F. Vallentin 2008 New upper bounds for kissing numbers from semidefinite programming J. AMS 21 909 924 2393433 05759143
3. Y.-Q. Bai E. de Klerk D.V. Pasechnik R. Sotirov 2009 Exploiting group symmetry in truss topology optimization Optim. Eng. 10 3 331 349 2539339 05641516 10.1007/s11081-008-9050-6
4. Cameron P.J.: Coherent configurations, association schemes, and permutation groups. In: Ivanov, A.A., Liebeck, M.W., Saxl, J. (eds) Groups, Combinatorics and Geometry, pp. 55-71. World Scientific, Singapore (2003)
5. W. Eberly M. Giesbrecht 2004 Efficient decomposition of separable algebras J. Symb. Comput. 37 1 35 81 2025853 1059.16018 10.1016/S0747-7171(03) 00071-3 (Pubitemid 38023750)
6. GAP-Groups, Algorithms, and Programming, Version 4.4.12, The GAP Group (2008). http://www.gap-system.org
7. K. Gatermann P.A. Parrilo 2004 Symmetry groups, semidefinite programs, and sums of squares J. Pure Appl. Algebra 192 95 128 2067190 1108.13021 10.1016/j.jpaa.2003.12.011 (Pubitemid 38773555)
8. Gijswijt, D.: Matrix Algebras and Semidefinite Programming Techniques for Codes. PhD thesis, University of Amsterdam, The Netherlands (2005). http://staff.science.uva.nl/~gijswijt/promotie/thesis.pdf
9. D. Gijswijt A. Schrijver H. Tanaka 2006 New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming J. Comb. Theory Ser. A 113 1719 1731 2269550 1105.94027 10.1016/j.jcta.2006.03.010 (Pubitemid 44340529)
10. Y. Kanno M. Ohsaki K. Murota N. Katoh 2001 Group symmetry in interior-point methods for semidefinite program Optim. Eng. 2 3 293 320 1980276 1035.90056 10.1023/A:1015366416311
11. E. de Klerk 2010 Exploiting special structure in semidefinite programming: a survey of theory and applications Eur. J. Oper. Res. 201 1 1 10 1177.90315 10.1016/j.ejor.2009.01.025
12. n SIAM J. Discret. Math. 20 189 202 1111.05029 10.1137/S0895480104442741 (Pubitemid 46352095)
13. E. de Klerk D.V. Pasechnik A. Schrijver 2007 Reduction of symmetric semidefinite programs using the regular-representation Math. Program. B 109 2-3 613 624 1200.90136 10.1007/s10107-006-0039-7 (Pubitemid 46197869)
14. E. Klerk R. Sotirov 2010 Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem Math. Program. Ser. A 122 2 225 246 1184.90120 10.1007/s10107-008-0246-5
15. E. de Klerk M.W. Newman D.V. Pasechnik R. Sotirov 2009 On the Lovász -number of almost regular graphs with application to Erdös-Rényi graphs Eur. J. Comb. 31 879 888 10.1016/j.ejc.2008.07. 022
16. Kojima, M., Kojima, S., Hara, S.: Linear algebra for semidefinite programming, Research Report B-290, pp. 1-23. Tokyo Institute of Technology. October 1994; also in RIMS Kokyuroku 1004, Kyoto University (1997)
17. M. Laurent 2007 Strengthened semidefinite bounds for codes Math. Program. 109 2-3 239 261 2295143 1147.90034 10.1007/s10107-006-0030-3 (Pubitemid 46197856)
18. L. Lovász 1979 On the Shannon capacity of a graph IEEE Trans. Inf. Theory 25 1 7 0395.94021 10.1109/TIT.1979.1055985
19. Maehara, T., Murota, K.: A numerical algorithm for block-diagonal decomposition of matrix-algebras, Part II: general algorithm, May 2009, submitted for publication. (Original version: A numerical algorithm for block-diagonal decomposition of matrix-algebras with general irreducible components, METR 2008-26, University of Tokyo, May 2008)
20. R.J. McEliece E.R. Rodemich H.C. Rumsey 1978 The Lovász bound and some generalizations J. Comb. Inf. Syst. Sci. 3 134 152 505587 0408.05031
21. Murota, K., Kanno, Y., Kojima, M., Kojima, S.: A Numerical Algorithm for Block-Diagonal Decomposition of Matrix-Algebras, Technical report B-445. Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, September 2007 (Revised June 2008)
22. Nesterov, Y.E., Nemirovski, A.S.: Interior Point Polynomial Algorithms in Convex Programming. SIAM Studies in Applied Mathematics, vol. 13. SIAM, Philadelphia, USA (1994)
23. A. Schrijver 1979 A comparison of the Delsarte and Lovász bounds IEEE Trans. Inf. Theory 25 425 429 536232 0444.94009 10.1109/TIT.1979.1056072
24. A. Schrijver 2005 New code upper bounds from the Terwilliger algebra IEEE Trans. Inf. Theory 51 2859 2866 2236252 10.1109/TIT.2005.851748 (Pubitemid 41158604)
25. Soicher, L.H.: GRAPE: GRaph Algorithms using PErmutation groups-A GAP package, Version number 4.3 (2006). http://www.maths.qmul.ac.uk/~leonard/grape/
26. M.J. Todd 2001 Semidefinite optimization Acta Numerica 10 515 560 2009698 1105.65334 10.1017/S0962492901000071 (Pubitemid 33305815)
27. K.C. Toh M.J. Todd R.H. Tütüncü 1999 SDPT3-a MATLAB software package for semidefinite programming, version 1.3 Optim. Methods Softw. 11/12 1-4 545 581 10.1080/10556789908805762
28. Vallentin, F.: Symmetry in semidefinite programs. Linear Algebra Appl. Preprint version: arXiv:0706.4233 (to appear)
29. L. Vandenberghe S. Boyd 1996 Semidefinite programming SIAM Rev. 38 49 95 1379041 0845.65023 10.1137/1038003 (Pubitemid 126610912)
30. J.H.M. Wedderburn 1907 On hypercomplex numbers Proc. London Math. Soc. 6 2 77 118
31. Weisfeiler, B. (ed.): On construction and identification of graphs. Lecture Notes in Mathematics, vol. 558, Springer (1976)