# American Institute of Mathematical Sciences

• Previous Article
Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces
• JIMO Home
• This Issue
• Next Article
Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming
July  2013, 9(3): 689-701. doi: 10.3934/jimo.2013.9.689

## Convex hull of the orthogonal similarity set with applications in quadratic assignment problems

 1 State Key Laboratory of Software Development Environment, LMIB of the Ministry of Education, School of Mathematics and System Sciences, Beihang University, Beijing, 100191, China

Received  August 2012 Revised  November 2012 Published  April 2013

In this paper, we study thoroughly the convex hull of the orthogonal similarity set and give a new representation. When applied in quadratic assignment problems, it motivates two new lower bounds. The first is equivalent to the projected eigenvalue bound, while the second highly outperforms several well-known lower bounds in literature.
Citation: Yong Xia. Convex hull of the orthogonal similarity set with applications in quadratic assignment problems. Journal of Industrial & Management Optimization, 2013, 9 (3) : 689-701. doi: 10.3934/jimo.2013.9.689
##### References:
 [1] K. M. Anstreicher and H. Wolkowicz, On lagrangian relaxation of quadratic matrix constraints,, SIAM J. Matrix Anal. Appl., 22 (2000), 41. doi: 10.1137/S0895479898340299. Google Scholar [2] K. M. Anstreicher, Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem,, SIAM Journal on Optimization, 11 (2001), 254. doi: 10.1137/S1052623499354904. Google Scholar [3] K. M. Anstreicher and N. W. Brixius, A new bound for the quadratic assignment problem based on convex quadratic programming,, Mathematical Programming Ser. A, 89 (2001), 341. doi: 10.1007/PL00011402. Google Scholar [4] K. M. Anstreicher, Recent advances in the solution of quadratic assignment Problems,, Mathematical Programming Ser. B, 97 (2003), 24. Google Scholar [5] R. E. Burkard, Locations with spatial interactions: The quadratic assignment problem,, in, (1991), 387. Google Scholar [6] R. E. Burkard, E. Çela, P. M. Pardalos and L. S. Pitsoulis, The quadratic assignment Problem,, in, 3 (1998), 241. Google Scholar [7] E. Çela, "The Quadratic Assignment Problem: Theory and Algorithms,", Kluwer Academic Publishers, (1998). Google Scholar [8] Y. Ding and H. Wolkowicz, A low-dimensional semidefinite relaxation for the quadratic assignment problem,, Mathematics of Operations Research, 34 (2009), 1008. doi: 10.1287/moor.1090.0419. Google Scholar [9] C. S. Edwards, The derivation of a greedy approximator for the Koopmans-Beckmann quadratic assignment problem,, Proceedings of the 77-th Combinatorial Programming Conference (CP77) (1977), (1977), 55. Google Scholar [10] C. S. Edwards, A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem,, Mathematical Programming Study, 13 (1980), 35. Google Scholar [11] P. A. Fillmore and J. P. Williams, Some convexity theorems for matrices,, Glasgow Math. J., 12 (1971), 110. doi: 10.1017/S0017089500001221. Google Scholar [12] G. Finke, R. E. Burkard and F. Rendl, Quadratic assignment problems,, Ann. Discrete Math., 31 (1987), 61. doi: 10.1016/S0304-0208(08)73232-8. Google Scholar [13] M. Grant and S. Boyd, "{CVX}: {Matlab} Software for Disciplined Convex Programming,", , (2010). Google Scholar [14] S. W. Hadley, F. Rendl and H. Wolkowicz, A new lower bound via projection for the quadratic assignment problem,, Math. Oper. Res., 17 (1992), 727. doi: 10.1287/moor.17.3.727. Google Scholar [15] G. G. Hardy, J. E. Littlewood and G. Pólya, "Inequalities,", Cambridge University Press, (1952). Google Scholar [16] E. M. Loiola, N. M. M. Abreu, P. O. Boaventura-Netto, P. Hahn and T. Querido, A survey for the quadratic assignment problem,, European Journal of Operational Research, 176 (2007), 657. doi: 10.1016/j.ejor.2005.09.032. Google Scholar [17] A. W. Marshall and I. Olkin, "Inequalities: Theory of Majorization and its Application,", Academic Press, (1979). Google Scholar [18] M. L. Overton and R. S. Womersley, On the sum of the largest eigenvalues of a symmetric matrix,, SIAM J. Matrix Anal. Appl., 13 (1992), 41. doi: 10.1137/0613006. Google Scholar [19] P. M. Pardalos, F. Rendl and H. Wolkowicz, The Quadratic Assignment Problem: A Survey and Recent Developments,, in, 16 (1994), 1. Google Scholar [20] S. Sahni and T. Gonzalez, P-complete approximation problems,, Journal of the Association of Computing Machinery, 23 (1976), 555. doi: 10.1145/321958.321975. Google Scholar [21] Y. Xia, Second order cone programming relaxation for quadratic assignment problems,, Optimization Methods $&$ Software, 23 (2008), 441. doi: 10.1080/10556780701843405. Google Scholar [22] Y. Xia, New sufficient global optimality conditions for linearly constrained bivalent quadratic optimization problem,, Journal of Industrial and Management Optimization, 5 (2009), 881. doi: 10.3934/jimo.2009.5.881. Google Scholar [23] Y. Xia, Convex hull presentation of a quadratically constrained set and its application in solving quadratic programming problems,, Asia-Pacific Journal of Operational Research, 26 (2009), 769. doi: 10.1142/S0217595909002468. Google Scholar

show all references

##### References:
 [1] K. M. Anstreicher and H. Wolkowicz, On lagrangian relaxation of quadratic matrix constraints,, SIAM J. Matrix Anal. Appl., 22 (2000), 41. doi: 10.1137/S0895479898340299. Google Scholar [2] K. M. Anstreicher, Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem,, SIAM Journal on Optimization, 11 (2001), 254. doi: 10.1137/S1052623499354904. Google Scholar [3] K. M. Anstreicher and N. W. Brixius, A new bound for the quadratic assignment problem based on convex quadratic programming,, Mathematical Programming Ser. A, 89 (2001), 341. doi: 10.1007/PL00011402. Google Scholar [4] K. M. Anstreicher, Recent advances in the solution of quadratic assignment Problems,, Mathematical Programming Ser. B, 97 (2003), 24. Google Scholar [5] R. E. Burkard, Locations with spatial interactions: The quadratic assignment problem,, in, (1991), 387. Google Scholar [6] R. E. Burkard, E. Çela, P. M. Pardalos and L. S. Pitsoulis, The quadratic assignment Problem,, in, 3 (1998), 241. Google Scholar [7] E. Çela, "The Quadratic Assignment Problem: Theory and Algorithms,", Kluwer Academic Publishers, (1998). Google Scholar [8] Y. Ding and H. Wolkowicz, A low-dimensional semidefinite relaxation for the quadratic assignment problem,, Mathematics of Operations Research, 34 (2009), 1008. doi: 10.1287/moor.1090.0419. Google Scholar [9] C. S. Edwards, The derivation of a greedy approximator for the Koopmans-Beckmann quadratic assignment problem,, Proceedings of the 77-th Combinatorial Programming Conference (CP77) (1977), (1977), 55. Google Scholar [10] C. S. Edwards, A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem,, Mathematical Programming Study, 13 (1980), 35. Google Scholar [11] P. A. Fillmore and J. P. Williams, Some convexity theorems for matrices,, Glasgow Math. J., 12 (1971), 110. doi: 10.1017/S0017089500001221. Google Scholar [12] G. Finke, R. E. Burkard and F. Rendl, Quadratic assignment problems,, Ann. Discrete Math., 31 (1987), 61. doi: 10.1016/S0304-0208(08)73232-8. Google Scholar [13] M. Grant and S. Boyd, "{CVX}: {Matlab} Software for Disciplined Convex Programming,", , (2010). Google Scholar [14] S. W. Hadley, F. Rendl and H. Wolkowicz, A new lower bound via projection for the quadratic assignment problem,, Math. Oper. Res., 17 (1992), 727. doi: 10.1287/moor.17.3.727. Google Scholar [15] G. G. Hardy, J. E. Littlewood and G. Pólya, "Inequalities,", Cambridge University Press, (1952). Google Scholar [16] E. M. Loiola, N. M. M. Abreu, P. O. Boaventura-Netto, P. Hahn and T. Querido, A survey for the quadratic assignment problem,, European Journal of Operational Research, 176 (2007), 657. doi: 10.1016/j.ejor.2005.09.032. Google Scholar [17] A. W. Marshall and I. Olkin, "Inequalities: Theory of Majorization and its Application,", Academic Press, (1979). Google Scholar [18] M. L. Overton and R. S. Womersley, On the sum of the largest eigenvalues of a symmetric matrix,, SIAM J. Matrix Anal. Appl., 13 (1992), 41. doi: 10.1137/0613006. Google Scholar [19] P. M. Pardalos, F. Rendl and H. Wolkowicz, The Quadratic Assignment Problem: A Survey and Recent Developments,, in, 16 (1994), 1. Google Scholar [20] S. Sahni and T. Gonzalez, P-complete approximation problems,, Journal of the Association of Computing Machinery, 23 (1976), 555. doi: 10.1145/321958.321975. Google Scholar [21] Y. Xia, Second order cone programming relaxation for quadratic assignment problems,, Optimization Methods $&$ Software, 23 (2008), 441. doi: 10.1080/10556780701843405. Google Scholar [22] Y. Xia, New sufficient global optimality conditions for linearly constrained bivalent quadratic optimization problem,, Journal of Industrial and Management Optimization, 5 (2009), 881. doi: 10.3934/jimo.2009.5.881. Google Scholar [23] Y. Xia, Convex hull presentation of a quadratically constrained set and its application in solving quadratic programming problems,, Asia-Pacific Journal of Operational Research, 26 (2009), 769. doi: 10.1142/S0217595909002468. Google Scholar
 [1] Paul B. Hermanns, Nguyen Van Thoai. Global optimization algorithm for solving bilevel programming problems with quadratic lower levels. Journal of Industrial & Management Optimization, 2010, 6 (1) : 177-196. doi: 10.3934/jimo.2010.6.177 [2] R. N. Gasimov, O. Ustun. Solving the quadratic assignment problem using F-MSG algorithm. Journal of Industrial & Management Optimization, 2007, 3 (2) : 173-191. doi: 10.3934/jimo.2007.3.173 [3] Kien Ming Ng, Trung Hieu Tran. A parallel water flow algorithm with local search for solving the quadratic assignment problem. Journal of Industrial & Management Optimization, 2019, 15 (1) : 235-259. doi: 10.3934/jimo.2018041 [4] Qinghong Zhang, Gang Chen, Ting Zhang. Duality formulations in semidefinite programming. Journal of Industrial & Management Optimization, 2010, 6 (4) : 881-893. doi: 10.3934/jimo.2010.6.881 [5] Alessandro Ferriero, Nicola Fusco. A note on the convex hull of sets of finite perimeter in the plane. Discrete & Continuous Dynamical Systems - B, 2009, 11 (1) : 103-108. doi: 10.3934/dcdsb.2009.11.103 [6] Gisella Croce. An elliptic problem with degenerate coercivity and a singular quadratic gradient lower order term. Discrete & Continuous Dynamical Systems - S, 2012, 5 (3) : 507-530. doi: 10.3934/dcdss.2012.5.507 [7] Chenchen Wu, Dachuan Xu, Xin-Yuan Zhao. An improved approximation algorithm for the $2$-catalog segmentation problem using semidefinite programming relaxation. Journal of Industrial & Management Optimization, 2012, 8 (1) : 117-126. doi: 10.3934/jimo.2012.8.117 [8] Zhi-Bin Deng, Ye Tian, Cheng Lu, Wen-Xun Xing. Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming. Journal of Industrial & Management Optimization, 2018, 14 (2) : 625-636. doi: 10.3934/jimo.2017064 [9] Bettina Klaus, Frédéric Payot. Paths to stability in the assignment problem. Journal of Dynamics & Games, 2015, 2 (3&4) : 257-287. doi: 10.3934/jdg.2015004 [10] Shouhong Yang. Semidefinite programming via image space analysis. Journal of Industrial & Management Optimization, 2016, 12 (4) : 1187-1197. doi: 10.3934/jimo.2016.12.1187 [11] Christine Bachoc, Alberto Passuello, Frank Vallentin. Bounds for projective codes from semidefinite programming. Advances in Mathematics of Communications, 2013, 7 (2) : 127-145. doi: 10.3934/amc.2013.7.127 [12] Jiani Wang, Liwei Zhang. Statistical inference of semidefinite programming with multiple parameters. Journal of Industrial & Management Optimization, 2017, 13 (5) : 1-12. doi: 10.3934/jimo.2019015 [13] Wan Nor Ashikin Wan Ahmad Fatthi, Adibah Shuib, Rosma Mohd Dom. A mixed integer programming model for solving real-time truck-to-door assignment and scheduling problem at cross docking warehouse. Journal of Industrial & Management Optimization, 2016, 12 (2) : 431-447. doi: 10.3934/jimo.2016.12.431 [14] Xiaoni Chi, Zhongping Wan, Zijun Hao. Second order sufficient conditions for a class of bilevel programs with lower level second-order cone programming problem. Journal of Industrial & Management Optimization, 2015, 11 (4) : 1111-1125. doi: 10.3934/jimo.2015.11.1111 [15] Srimanta Bhattacharya, Sushmita Ruj, Bimal Roy. Combinatorial batch codes: A lower bound and optimal constructions. Advances in Mathematics of Communications, 2012, 6 (2) : 165-174. doi: 10.3934/amc.2012.6.165 [16] Yi Xu, Wenyu Sun. A filter successive linear programming method for nonlinear semidefinite programming problems. Numerical Algebra, Control & Optimization, 2012, 2 (1) : 193-206. doi: 10.3934/naco.2012.2.193 [17] Lidan Li, Hongwei Zhang, Liwei Zhang. Inverse quadratic programming problem with $l_1$ norm measure. Journal of Industrial & Management Optimization, 2017, 13 (5) : 1-13. doi: 10.3934/jimo.2019061 [18] Cristian Dobre. Mathematical properties of the regular *-representation of matrix $*$-algebras with applications to semidefinite programming. Numerical Algebra, Control & Optimization, 2013, 3 (2) : 367-378. doi: 10.3934/naco.2013.3.367 [19] Yong Xia, Yu-Jun Gong, Sheng-Nan Han. A new semidefinite relaxation for $L_{1}$-constrained quadratic optimization and extensions. Numerical Algebra, Control & Optimization, 2015, 5 (2) : 185-195. doi: 10.3934/naco.2015.5.185 [20] Florent Foucaud, Tero Laihonen, Aline Parreau. An improved lower bound for $(1,\leq 2)$-identifying codes in the king grid. Advances in Mathematics of Communications, 2014, 8 (1) : 35-52. doi: 10.3934/amc.2014.8.35

2018 Impact Factor: 1.025