Advertisement

Journal of Global Optimization

, Volume 35, Issue 1, pp 131–143 | Cite as

Complete Solutions and Extremality Criteria to Polynomial Optimization Problems

  • David Yang Gao
Article

Abstract

This paper presents a set of complete solutions to a class of polynomial optimization problems. By using the so-called sequential canonical dual transformation developed in the author’s recent book [Gao, D.Y. (2000), Duality Principles in Nonconvex Systems: Theory, Method and Applications, Kluwer Academic Publishers, Dordrecht/Boston/London, xviii + 454 pp], the nonconvex polynomials in \(\mathbb{R}^n\) can be converted into an one-dimensional canonical dual optimization problem, which can be solved completely. Therefore, a set of complete solutions to the original problem is obtained. Both global minimizer and local extrema of certain special polynomials can be indentified by Gao-Strang’s gap function and triality theory. For general nonconvex polynomial minimization problems, a sufficient condition is proposed to identify global minimizer. Applications are illustrated by several examples.

Keywords

critical point theory duality global optimization nonlinear programming NP-hard problem polynomial minimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Demmel, J.W., Nie, J. and Sturmfels, B. (2005), Minimizing polynomials via sum of squares over the gradient ideal. Preprint.Google Scholar
  2. 2.
    Gao, D.Y. (1997), Dual extremum principles in finite deformation theory with applications in post-buckling analysis of nonlinear beam model, Applied Mechanics Reviews, ASME 50(11), November, S64–S71.Google Scholar
  3. 3.
    Gao, D.Y. 1998Duality, triality and complementary extremum principles in nonconvex parametric variational problems with applicationsIMA Journal of Applied Mathematics61199235CrossRefGoogle Scholar
  4. 4.
    Gao, D.Y. 1999Duality-mathematicsWiley Encyclopedia of Electronical and Electronical Engineering66877Google Scholar
  5. 5.
    Gao D.Y. (2000) Duality Principles in Nonconvex Systems: Theory, Methods and Applications, Kluwer Academic Publishers, Dordrecht/Boston/London, xviii+454 pp.Google Scholar
  6. 6.
    Gao, D.Y. 2000Analytic solution and triality theory for nonconvex and nonsmooth variational problems with applicationsNonlinear Analysis4211611193CrossRefGoogle Scholar
  7. 7.
    Gao, D.Y. 2000Finite deformation beam models and triality theory in dynamical post-buckling analysisInternational Journal Non-Linear Mechanics35103131CrossRefGoogle Scholar
  8. 8.
    Gao, D.Y. 2000Canonical dual transformation method and generalized triality theory in nonsmooth global optimizationJournal of Global Optimization17127160CrossRefGoogle Scholar
  9. 9.
    Gao, D.Y. 2001Tri-duality in global optimizationFloudas, C.A.Pardalos, P.D. eds. Encyclopedia of Optimization Vol 1Kluwer Academic PublishersDordrecht/Boston/London485491Google Scholar
  10. 10.
    Gao, D.Y. 2003Perfect duality theory and complete set of, solutions to a class of global optimizationOptimization52467493CrossRefGoogle Scholar
  11. 11.
    Gao, D.Y. (2004), Complete solutions to constrained quadratic optimization problems, Journal of Global Optimisation, special issue on Duality, edited by D.Y. Gao and K.L. Teo. 29, 377–399.Google Scholar
  12. 12.
    Gao, D.Y., Strang, G. 1989Geometric nonlinearity: potential energy, complementary energy, and the gap functionQuarterly of Applied Mathmatics47487504Google Scholar
  13. 13.
    Horst, R., Pardalos, P.M. and Van Thoai, N. (2000), Introduction to Global Optimization, Kluwer Academic Publishers.Google Scholar
  14. 14.
    Nesterov, Y. (2000), Squared functional systems and optimization problems, In: Frenk, H. et al. (eds.) High Performance Optimization, Kluwer Academic Publishers, pp. 405–440.Google Scholar
  15. 15.
    Lasserre, J. 2001Global optimization with polynomials and the problem of momentsSIAM Journal of Optimization11796817CrossRefGoogle Scholar
  16. 16.
    Parrilo, P. and Sturmfels, B. (2001), Minimizing polynomial functions, In: Basu, S. and Gonzalez-Vega, L. (eds.), Proceedings of DIMACS Workshop on Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science, American Mathematical Society, 2003, pp. 83–100.Google Scholar

Copyright information

© Springer 2006

Authors and Affiliations

  1. 1.Department of MathematicsVirginia Polytechnic Institute & State UniversityBlacksburgUSA

Personalised recommendations