Optimality conditions and optimization methods for quartic polynomial optimization problems with mixed variables

Multivariate quartic polynomial optimization problems, as a special case of the general polynomial optimization, have a lot of practical applications in real world and are proved to be NP-hard. In this paper, some necessary local optimality conditions and some necessary global optimality conditions for quartic polynomial optimization problems with mixed variables are established. Then some local optimization methods, including weakly local optimization methods for general problems with mixed variables and strongly local optimization methods for quartic polynomial optimization problems with mixed variables, are proposed by exploiting these necessary local optimality conditions and necessary global optimality conditions. A global optimization method is proposed for quartic polynomial optimization problems by combining these local optimization methods together with some auxiliary functions. Some numerical examples are also given to illustrate that these approaches are very efficient.

[1]  Jiawang Nie,et al.  Sum of squares method for sensor network localization , 2006, Comput. Optim. Appl..

[2]  Zhi-You Wu,et al.  Sufficient Global Optimality Conditions for Non-convex Quadratic Minimization Problems With Box Constraints , 2006, J. Glob. Optim..

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  G. Q. Li,et al.  A new local and global optimization method for mixed integer quadratic programming problems , 2010, Appl. Math. Comput..

[5]  Zhiyou Wu,et al.  Global optimality conditions for mixed nonconvex quadratic programs , 2009 .

[6]  Zhong Wan,et al.  New approach to global minimization of normal multivariate polynomial based on tensor , 2008 .

[7]  Yanjun Wang,et al.  Global optimality conditions for cubic minimization problem with box or binary constraints , 2010, J. Glob. Optim..

[8]  Zhi-You Wu,et al.  Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions , 2007, Math. Program..

[9]  Katta G. Murty,et al.  Nonlinear Programming Theory and Algorithms , 2007, Technometrics.

[10]  Zhi-Quan Luo,et al.  Blind constant modulus equalization via convex optimization , 2003, IEEE Trans. Signal Process..

[11]  G. Q. Li,et al.  Necessary Optimality Conditions and New Optimization Methods for Cubic Polynomial Optimization Problems with Mixed Variables , 2012, J. Optim. Theory Appl..

[12]  Martin L. Hazelton,et al.  SOME COMMENTS ON ORIGIN-DESTINATION MATRIX ESTIMATION , 2003 .

[13]  Zhong Wan,et al.  Global Minimization of Normal Quartic Polynomials Based on Global Descent Directions , 2004, SIAM J. Optim..

[14]  Yinyu Ye,et al.  Semidefinite programming based algorithms for sensor network localization , 2006, TOSN.

[15]  Julien Ugon,et al.  Optimality conditions and optimization methods for quartic polynomial optimization , 2014, Appl. Math. Comput..

[16]  Zhi-Quan Luo,et al.  A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints , 2010, SIAM J. Optim..

[18]  M. Pinar,et al.  Sufficient Global Optimality Conditions for Bivalent Quadratic Optimization , 2004 .

[19]  H. Wu,et al.  Robust Tracking and Model Following Control with Zero Tracking Error for Uncertain Dynamical Systems , 2000 .

[20]  Vaithilingam Jeyakumar,et al.  Necessary global optimality conditions for nonlinear programming problems with polynomial constraints , 2011, Math. Program..