On the Triality Theory in Global Optimization

نویسندگان

  • David Yang Gao
  • Changzhi Wu
چکیده

Triality theory is proved for a general unconstrained global optimization problem. The method adopted is simple but mathematically rigorous. Results show that if the primal problem and its canonical dual have the same dimension, the triality theory holds strongly in the tri-duality form as it was originally proposed. Otherwise, both the canonical min-max duality and the double-max duality still hold strongly, but the double-min duality holds weakly in a super-symmetrical form as it was expected. Additionally, a complementary weak saddle min-max duality theorem is discovered. Therefore, an open problem on this statement left in 2003 is solved completely. This theory can be used to identify not only the global minimum, but also the largest local minimum, maximum, and saddle points. Application is illustrated. Some fundamental concepts in optimization and remaining challenging problems in canonical duality theory are discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Canonical Duality Theory: Connections between nonconvex mechanics and global optimization

This paper presents a comprehensive review and some new developments on canonical duality theory for nonconvex systems. Based on a tri-canonical form for quadratic minimization problems, an insightful relation between canonical dual transformations and nonlinear (or extended) Lagrange multiplier methods is presented. Connections between complementary variational principles in nonconvex mechanic...

متن کامل

Canonical Dual Transformation Method and Generalized Triality Theory in Nonsmooth Global Optimization

This paper presents, within a unified framework, a potentially powerful canonical dual transformation method and associated generalized duality theory in nonsmooth global optimization. It is shown that by the use of this method, many nonsmooth/nonconvex constrained primal problems in Rn can be reformulated into certain smooth/convex unconstrained dual problems in Rm with m 6 n and without duali...

متن کامل

Global optimal solutions to nonconvex optimisation problems with a sum of double-well and log-sum-exp functions

This paper presents a canonical dual approach for solving a nonconvex global optimisation problem with a sum of double-well and log-sum-exp functions. Such a problem arises extensively in mechanics, robot designing, information theory and network communication systems. It includes fourth-order polynomial minimisation problems and minimax problems. Based on the canonical duality theory, this non...

متن کامل

Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory

Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...

متن کامل

Solutions and optimality criteria for nonconvex quadratic-exponential minimization problem

This paper presents a set of complete solutions and optimality conditions for a nonconvex quadratic-exponential optimization problem. By using the canonical duality theory developed by the first author, the nonconvex primal problem in n-dimensional space can be converted into an one-dimensional canonical dual problem with zero duality gap, which can be solved easily to obtain all dual solutions...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1104.2970  شماره 

صفحات  -

تاریخ انتشار 2011