Complete Solutions to General Box-Constrained Global Optimization Problems

Abstract EN

This paper presents a global optimization method for solving general nonlinear programming problems subjected to box constraints.

Regardless of convexity or nonconvexity, by introducing a differential flow on the dual feasible space, a set of complete solutions to the original problem is obtained, and criteria for global optimality and existence of solutions are given.

Our theorems improve and generalize recent known results in the canonical duality theory.

Applications to a class of constrained optimal control problems are discussed.

Particularly, an analytical form of the optimal control is expressed.

Some examples are included to illustrate this new approach.