Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
- 31 Downloads
Abstract
We consider approximation algorithms for nonnegative polynomial optimization problems over unit spheres. These optimization problems have wide applications e.g., in signal and image processing, high order statistics, and computer vision. Since these problems are NP-hard, we are interested in studying on approximation algorithms. In particular, we propose some polynomial-time approximation algorithms with new approximation bounds. In addition, based on these approximation algorithms, some efficient algorithms are presented and numerical results are reported to show the efficiency of our proposed algorithms.
Keywords
Approximation algorithm polynomial optimization approximation boundMSC
65K10 90C25 90C30Preview
Unable to display preview. Download preview PDF.
Notes
Acknowledgements
The authors would like to thank the reviewers for their insightful comments which help to improve the presentation of the paper. The first author’s work was supported by the National Natural Science Foundation of China (Grant No. 11471242) and the work of the second author was supported by the National Natural Science Foundation of China (Grant No. 11601261).
References
- 1.Chen B, He S, Li Z, Zhang S. Maximum block improvement and polynomial optimization. SIAM J Optim, 2012, 22: 87–107MathSciNetCrossRefMATHGoogle Scholar
- 2.He S, Li Z, Zhang S. Approximation algorithms for homogeneous polynomial optimization with quadratic constraints. Math Program, 2010, 125: 353–383MathSciNetCrossRefMATHGoogle Scholar
- 3.He S, Luo Z, Nie J, Zhang S. Semidefinite relaxation bounds for indefinite homogeneous quadratic optimization. SIAM J Optim, 2008, 19: 503–523MathSciNetCrossRefMATHGoogle Scholar
- 4.Henrion D, Lasserre J B, Loefberg J. GloptiPoly 3: Moments, optimization and semidefinite programming. Optim Methods Softw, 2009, 24: 761–779MathSciNetCrossRefMATHGoogle Scholar
- 5.Hu S, Li G, Qi L. A tensor analogy of Yuan’s alternative theorem and polynomial optimization with sign structure. J Optim Theory Appl, 2016, 168: 446–474MathSciNetCrossRefMATHGoogle Scholar
- 6.Hu S, Li G, Qi L, Song Y. Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming. J Optim Theory Appl, 2013, 158: 717–738MathSciNetCrossRefMATHGoogle Scholar
- 7.Jiang B, Ma S, Zhang S. Alternating direction method of multipliers for real and complex polynomial optimization models. Optimization, 2014, 63: 883–898MathSciNetCrossRefMATHGoogle Scholar
- 8.Kolda T G, Mayo J R. Shifted power method for computing tensor eigenvalues. SIAM J Matrix Anal Appl, 2012, 32: 1095–1124CrossRefMATHGoogle Scholar
- 9.Lasserre J B. Global optimization with polynomials and the problem of moments. SIAM J Optim, 2001, 11: 796–817MathSciNetCrossRefMATHGoogle Scholar
- 10.Laurent M. Sum of squares, moment matrices and optimization over polynomials. In: Putinar M, Sullivant S, eds. Emerging Applications of Algebra Geometry. IMA Volumes in Mathematics and its Applications, Vol 149. Berlin: Springer, 2009, 157–270Google Scholar
- 11.Ling C, Nie J, Qi L, Ye Y. Bi-quadratic optimization over unit spheres and semidefinite programming relaxations. SIAM J Optim, 2009, 20: 1286–1310MathSciNetCrossRefMATHGoogle Scholar
- 12.Nie J. Sum of squares methods for minimizing polynomial functions over spheres and hypersurfaces. Front Math China, 2012, 7: 321–346MathSciNetCrossRefMATHGoogle Scholar
- 13.Qi L. Eigenvalues of a real supersymmetric tensor. J Symbolic Comput, 2005, 40: 1302–1324MathSciNetCrossRefMATHGoogle Scholar
- 14.Qi L, Teo K L. Multivariate polynomial minimization and its applications in signal processing. J Global Optim, 2003, 26: 419–433MathSciNetCrossRefMATHGoogle Scholar
- 15.So A M-C. Deterministic approximation algorithms for sphere contained homogeneous polynomial optimization problems. Mathe Program, 2011, 129: 357–382CrossRefMATHGoogle Scholar
- 16.Wang Y, Caccetta L, Zhou G. Convergence analysis of a block improvement method for polynomial optimization over unit spheres. Numer Linear Algebra Appl, 2015, 22: 1059–1076MathSciNetCrossRefMATHGoogle Scholar
- 17.Zhang L, Qi L. Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor. Numer Linear Algebra Appl, 2012, 19: 830–841MathSciNetCrossRefMATHGoogle Scholar
- 18.Zhang L, Qi L, Xu Y. Finding the largest eigenvalue of an irreducible nonnegative tensor and linear convergence for weakly positive tensors. J Comput Math, 2012, 30: 24–33MathSciNetCrossRefGoogle Scholar
- 19.Zhang X, Ling C, Qi L. Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints. J Global Optim, 2010, 49: 293–311MathSciNetCrossRefMATHGoogle Scholar
- 20.Zhang X, Ling C, Qi L. The best rank-1 approximation of a symmetric tensor and related spherical optimization problems. SIAM J Matrix Anal Appl, 2012, 33: 806–821MathSciNetCrossRefMATHGoogle Scholar
- 21.Zhang X, Ling C, Qi L, Wu E X. The measure of diffusion skewness and kurtosis in magnetic resonance imaging. Pac J Optim, 2010, 6: 391–404MathSciNetMATHGoogle Scholar
- 22.Zhang X, Qi L, Ye Y. The cubic spherical optimization problems. Math Comp, 2012, 81: 1513–1525MathSciNetCrossRefMATHGoogle Scholar
- 23.Zhou G, Caccetta L, Teo K, Wu S-Y. Nonnegative polynomial optimization over unit spheres and convex programming relaxations. SIAM J Optim, 2012, 22: 987–1008MathSciNetCrossRefMATHGoogle Scholar