Abstract
Multivariate cubic polynomial optimization problems, as a special case of the general polynomial optimization, have a lot of practical applications in real world. In this paper, some necessary local optimality conditions and some necessary global optimality conditions for cubic 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 cubic 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 cubic 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.
Similar content being viewed by others
References
Henin, C., Doutriaux, J.: A specialization of the convex simplex method to cubic programming. Decis. Econ. Finance 3(2), 61–72 (1980)
Hanoch, G., Levy, H.: Efficient portfolio with quadratic and cubic utility. J. Bus. 43, 101 (1970)
Levy, H., Sarnat, M.: Investment and Portfolio Analysis. Wiley, New York (1972)
Schaible, S.: Quasi concavity and pseudo concavity of cubic functions. Math. Program. 5, 243–247 (1973)
Schaible, S.: Beitrage zur Quasi-konvexen Programmierung. Dissertation K61n (1971)
Beck, A., Teboulle, M.: Global optimality conditions for quadratic optimization problems with binary constraints. SIAM J. Optim. 11, 179–188 (2000)
Jeyakumar, V., Rubinov, A.M., Wu, Z.Y.: Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints. J. Glob. Optim. 36, 471–481 (2006)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796–817 (2000)
Lasserre, J.B.: Convexity in semialgebraic geometry and polynomial optimization. SIAM J. Optim. 19, 1995–2014 (2008)
Luo, Z.Q., Zhang, S.: A semidefenite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints. SIAM J. Optim. 20, 1716–1736 (2010)
Nie, J.: Regularization methods for sum of squares relaxations in large scale polynomial optimization. Technical report, Department of Mathematics, University of California, 9500 Gilman Drive, La Jolla, CA 92093 (2009)
Bertsimas, D., Freund, R.M., Sun, X.A.: An accelerated first-order method for solving unconstrained polynomial optimization problems. http://web.mit.edu/rfreund/www/optimal-methods-for-polynomial-optimization.pdf (2011)
Kojima, M., Kim, S., Waki, H.: A general framework for convex relaxation of polynomial optimization problems over cones. J. Oper. Res. Soc. Jpn. 46(2), 125–144 (2003)
Bector, C.R., Kanpur: Indefinite cubic programming with standard errors in objective function. Math. Methods Oper. Res. 12(1), 113–120 (1968)
Jeyakumar, V., Li, G.: Necessary global optimality conditions for nonlinear program-ming problems with polynomial constraints. Math. Program., Ser. A 126(2), 393–399 (2011)
Li, G.Q., Wu, Z.Y., Quan, J.: A new local and global optimization method for mixed integer quadratic programming problems. Appl. Math. Comput. 217, 2501–2512 (2010)
Wang, Y.J., Liang, Z.A.: Global optimality conditions for cubic minimization problem with box or binary constraints. J. Glob. Optim. 47, 583–595 (2010)
Wu, Z.Y., Bai, F.S.: Global optimality conditions for mixed nonconvex quadratic programs. Optimization 58(1), 39–47 (2009)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Xiaoqi Yang.
Rights and permissions
About this article
Cite this article
Wu, Z.Y., Quan, J., Li, G.Q. et al. Necessary Optimality Conditions and New Optimization Methods for Cubic Polynomial Optimization Problems with Mixed Variables. J Optim Theory Appl 153, 408–435 (2012). https://doi.org/10.1007/s10957-011-9961-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-011-9961-9