Approximation algorithms for homogeneous polynomial optimization with quadratic constraints

Mathematical Programming

Volumn 125, Issue 2, 2010, Pages 353-383

  He, Simai ^a   Li, Zhening ^b   Zhang, Shuzhong ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Approximation algorithm; Multi linear tensor form; Polynomial function optimization

Indexed keywords

APPROXIMATION PERFORMANCE; CARTESIAN PRODUCTS; CONSTRAINT SET; HOMOGENEOUS POLYNOMIALS; LINEAR TENSOR; NP-HARD; NUMERICAL RESULTS; OPTIMIZATION MODELS; POLYNOMIAL FUNCTION OPTIMIZATION; POLYNOMIAL FUNCTIONS; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS; PORTFOLIO SELECTION; QUADRATIC CONSTRAINT; WORST-CASE PERFORMANCE RATIO;

FUNCTIONS; MAGNETIC RESONANCE IMAGING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; RESONANCE; SIGNAL PROCESSING; TENSORS;

APPROXIMATION ALGORITHMS;

EID: 77958088475     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-010-0409-z     Document Type: Conference Paper

References (52)

1. Barmpoutis, A., Jian, B., Vemuri, B.C., Shepherd, T.M.: Symmetric positive 4th order tensors and their estimation from diffusion weighted MRI. In: Karssemijer, N., Lelieveldt, B. (eds.) IPMI 2007, LNCS 4584, pp. 308-319 (2007)
2. Ben-Tal A., Nemirovski A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. MPS-SIAM Series on Optimization, Philadelphia (2001)
3. G. Dahl J.M. Leinaas J. Myrheim E. Ovrum 2007 A tensor product matrix approximation problem in quantum physics Linear. Algebra. Appl. 420 711 725 1118.15027 10.1016/j.laa.2006.08.026 2278245 (Pubitemid 44751797)
4. De Athayde G.M., Flôres R.G. Jr.: Incorporating skewness and kurtosis in portfolio optimization: a multidimensional efficient set, 10. In: Satchell, S., Scowcroft, A. (eds) Advances in Portfolio Construction and Implementation, pp. 243-257. Butterworth-Heinemann, UK (2003)
5. E. De Klerk 2008 The complexity of optimizing over a simplex, hypercube or sphere: a short survey Central Eur J. Oper. Res. 16 111 125 1152.90607 10.1007/s10100-007-0052-9 2407041
6. E. De Klerk M. Laurent P.A. Parrilo 2006 A PTAS for the minimization of polynomials of fixed degree over the simplex Theor. Comput. Sci. 261 210 225 10.1016/j.tcs.2006.05.011 2252579 (Pubitemid 44189105)
7. Fujisawa, K., Kojima, M., Nakata, K., Yamashita, M.: SDPA (SemiDefinite Programming Algorithm) User's Manual-version 6.2.0, Research Report B-308, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Japan (1995)
8. Ghosh, A., Tsigaridas, E., Descoteaux, M., Comon, P., Mourrain, B., Deriche, R.: A polynomial based approach to extract the maxima of an antipodally symmetric spherical function and its application to extract fiber directions from the orientation distribution function in diffusion MRI. Computational Diffusion MRI Workshop (CDMRI'08), New York (2008)
9. M.X. Goemans D.P. Williamson 1995 Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming J. ACM 42 1115 1145 0885.68088 10.1145/227683.227684 1412228
10. Grant, M., Boyd, S.: CVX: Matlab Software for Disciplined Convex Programming, version 1.2. http://cvxr.com/cvx (2010)
11. Gurvits, L.: Classical deterministic complexity of Edmonds' problem and quantum entanglement. In: Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing, pp. 10-19, ACM, New York (2003)
12. S. He Z.Q. Luo J. Nie S. Zhang 2008 Semidefinite relaxation bounds for indefinite homogeneous quadratic optimization SIAM J. Optim. 19 503 523 1180.90218 10.1137/070679041 2425027
13. D. Henrion J.B. Lasserre 2003 GloptiPoly: global optimization over polynomials with Matlab and SeDuMi ACM Tran. Math. Soft 29 165 194 1070.65549 10.1145/779359.779363 2000881 (Pubitemid 40001449)
14. D. Henrion J.B. Lasserre J. Loefberg 2009 GloptiPoly 3: moments, optimization and semidefinite programming Optim. Methods Softw. 24 761 779 1178.90277 10.1080/10556780802699201 2554910
15. E. Jondeau M. Rockinger 2006 Optimal portfolio allocation under higher moments Eur. Financ. Manage. 12 29 55 10.1111/j.1354-7798.2006.00309.x
16. E. Kofidis Ph. Regalia 2002 On the best rank-1 approximation of higher order supersymmetric tensors SIAM J. Matrix Anal. App. 23 863 884 1001.65035 10.1137/S0895479801387413 1896822
17. A. Kroó J. Szabados 2008 Joackson-type theorems in homogeneous approximation J. Appr. Theory 152 1 19 1142.41003 10.1016/j.jat.2007.08.005
18. J.B. Lasserre 2001 Global optimization with polynomials and the problem of moments SIAM J. Optim. 11 796 817 1010.90061 10.1137/S1052623400366802 1814045
19. J.B. Lasserre 2001 Polynomials nonnegative on a grid and discrete representations Trans. Am. Math. Soc. 354 631 649 10.1090/S0002-9947-01-02898-7 1862561
20. Laurent M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds) Emerging Applications of Algebraic Geometry, Series: The IMA Volumes in Mathematics and its Applications, vol. 149, Springer, Berlin (2009)
21. C. Ling J. Nie L. Qi Y. Ye 2009 Biquadratic optimization over unit spheres and semidefinite programming relaxations SIAM J. Optim. 20 1286 1310 05779378 10.1137/080729104 2546345
22. Z.Q. Luo N.D. Sidiropoulos P. Tseng S. Zhang 2007 Approximation bounds for quadratic optimization with homogeneous quadratic constraints SIAM J. Optim. 18 1 28 1156.90011 2299671
23. Z.Q. Luo J.F. Sturm S. Zhang 2004 Multivariate nonnegative quadratic mappings SIAM J. Optim. 14 1140 1162 1069.15019 10.1137/S1052623403421498 2112968
24. Z.Q. Luo S. Zhang 2010 A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints SIAM J. Optim. 20 1716 1736 10.1137/090772952 2600236
25. Mandelbrot B., Hudson R.L.: The (Mis)Behavior of Markets. Basic Books, New York (2004)
26. B. Maricic Z.Q. Luo T.N. Davidson 2003 Blind constant modulus equalization via convex optimization IEEE Trans. Signal Process. 51 805 818 10.1109/TSP.2002.808112 1963878
27. D. Maringer P. Parpas 2009 Global optimization of higher order moments in portfolio selection J. Glob. Optim. 43 219 230 1169.90454 10.1007/s10898-007- 9224-3 2471883
28. C.A. Micchelli P. Olsen 2000 Penalized maximum-likelihood estimation, the Baum-Welch algorithm, diagonal balancing of symmetric matrices and applications to training acoustic data J. Comput. Appl. Math. 119 301 331 0962.65008 10.1016/S0377-0427(00)00385-X 1774224
29. A. Nemirovski C. Roos T. Terlaky 1999 On maximization of quadratic form over intersection of ellipsoids with common center Math. Prog. A 86 463 473 0944.90056 10.1007/s101070050100 1733748
30. Yu. Nesterov 1998 Semidefinite relaxation and nonconvex quadratic optimization Optim. Methods Softw. 9 141 160 0904.90136 10.1080/ 10556789808805690 1618100
31. Nesterov Yu. et al.: Squared functional systems and optimization problems. In: Frenk, J.B.G. (ed.) High Performance Optimization, pp. 405-440. Kluwer Academic Press, Dordrecht (2000)
32. Nesterov, Yu.: Random walk in a simplex and quadratic optimization over convex polytopes. CORE Discussion Paper. UCL, Louvain-la-Neuve, Belgium (2003)
33. Q. Ni L. Qi F. Wang 2008 An eigenvalue method for testing positive definiteness of a multivariate form IEEE Trans. Automat. Contr. 53 1096 1107 10.1109/TAC.2008.923679 2445667
34. Parpas, P., Rustem, B.: Global optimization of the scenario generation and portfolio selection problems. ICCSA 2006, LNCS 3982, pp. 908-917 (2006)
35. Parrilo, P.A.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD Dissertation, California Institute of Technology, CA (2000)
36. P.A. Parrilo 2003 Semidefinite programming relaxations for semialgebraic problems Math. Prog. B 96 293 320 1043.14018 10.1007/s10107-003-0387-5 1993050 (Pubitemid 44757842)
37. A.J. Prakash C.H. Chang T.E. Pactwa 2003 Selecting a portfolio with skewness: recent evidence from US, European, and Latin American equity markets J Banking Financ. 27 1375 1390 10.1016/S0378-4266(02)00261-3 (Pubitemid 36649721)
38. L. Qi 2004 Extrema of a real polynomial J. Glob. Optim. 30 405 433 1082.90091 10.1007/s10898-004-6875-1 (Pubitemid 40308455)
39. L. Qi 2005 Eigenvalues of a real supersymmetric tensor J. Symbolic Comput. 40 1302 1324 1125.15014 10.1016/j.jsc.2005.05.007 2178089 (Pubitemid 41600816)
40. L. Qi 2007 Eigenvalues and invariants of tensors J. Math. Anal. Appl. 325 1363 1377 1113.15020 10.1016/j.jmaa.2006.02.071 2270090 (Pubitemid 44615844)
41. L. Qi K.L. Teo 2003 Multivariate polynomial minimization and its applications in signal processing J. Glob. Optim. 26 419 433 1023.90064 10.1023/A:1024778309049 1989748
42. L. Qi Z. Wan Y.F. Yang 2004 Global minimization of normal quadratic polynomials based on global descent directions SIAM J. Optim. 15 275 302 1077.90066 10.1137/S1052623403420857 2112986
43. A.M.C. So Y. Ye J. Zhang 2008 A unified theorem on SDP rank reduction Math. Oper. Res. 33 910 920 10.1287/moor.1080.0326 2464650
44. S. Soare J.W. Yoon O. Cazacu 2008 On the use of homogeneous polynomials to develop anisotropic yield functions with applications to sheet forming Int. J. Plast. 24 915 944 05274405 10.1016/j.ijplas.2007.07.016 (Pubitemid 351400625)
45. J.F. Sturm 1999 SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones Optim. Methods Softw. 11&12 625 653 10.1080/ 10556789908805766 1778433
46. K.C. Toh M.J. Todd R.H. Tutuncu 1999 SDPT3-a Matlab software package for semidefinite programming Optim. Methods Softw. 11 545 581 10.1080/ 10556789908805762 1778429
47. P.P. Varjú 2007 Approximation by homogeneous polynomials Const. Appr. 26 317 337 1126.41004 10.1007/s00365-006-0639-2
48. Y. Ye 1999 Approximating quadratic programming with bound and quadratic constraints Math. Prog. 84 219 226 0971.90056
49. Y. Ye 1999 Approximating global quadratic optimization with convex quadratic constraints J. Glob. Optim. 15 1 17 0953.90040 10.1023/A:1008370723217
50. S. Zhang 2000 Quadratic maximization and semidefinite relaxation Math. Prog. A 87 453 465 1009.90080 10.1007/s101070050006
51. S. Zhang Y. Huang 2006 Complex quadratic optimization and semidefinite programming SIAM J. Optim. 16 871 890 1113.90115 10.1137/04061341X 2197560 (Pubitemid 44231153)
52. Zhang X., Qi L., Ye Y.: The cubic spherical optimization problems, Working Paper. The Hong Kong Polytechnic University, Hong Kong (2009)