This paper presents a canonical duality theory for general box constrained nonconvex and nonsmooth optimization problems. The theory is illustrated perfectly by showing mainly a canonical dual transformation and a triality theory. It is proved that the general box constrained nonconvex and nonsmooth optimization problems can be changed into the perfect dual problems, which can be solved easily. The perfect dual transformation is developed for eliminating the duality gap,while the triality theorem studies global and local extreme conditions. Applications and examples are illustrated.
The general box constrained nonconvex and nonsmooth optimization problem is proposed as a primal problem given as follows:
where
is a nonconvex and nonsmooth function and , and are all positive constants , is a given arbitrary constant, is a matrix and is a symmetrix matrix, is a vector of parameter and and are non-zero vectors, denotes the Euclidean norm.
The nonconvex and nonsmooth optimization problem appears frequently in many applications [1, 2, 3, 4, 5, 6, 7, 9, 13, 14, 15]. while, it is usually difficult to find out the optimal solutions of the nonconvex and nonsmooth function with box constrained by traditional methods. Luckly, the elegant duality theorem are studied and used successfully for showing this problem by Gao and strang [8, 10].
As indicated in [6], the key idea of the perfect dual transformation method is to introduce a geometric operator to make the nonconvex function and the general box constrains written in the elegant form [8]. To study the general box constrained nonconvex and nonsmooth optimization problem, it is necessary to reformulate the constraints in canonical form with a geometric operator , the primal problem can be denoted as , where is a scale, and for . Let be the domain of and denote
The effective domain of is , then a canonical function on can be written as
where
We denote
which is a canonical function on in sense that its derivative .
Is one-to-one onto mapping. Thus, the primal problem Eq. (1) can be written in the following unconstrained perfect form
where the notation stands for finding all stationary points of the problem stated in Eq. (3).
Let be a dual variable of . then the Fenchel canonical conjugate of can be defined by
and its effective domain , then by convex analysis, we have the following equivalent relations [5] hold:
and the extended canonical duality relations Eq. (4) can be written the following forms
By the canonical dual transformation developed in [6], the canonical dual function of is defined by
where is the is the so-called -canonical dual transformation [8] defined by
where and . The matrix is invertible, where represents a diagonal matrix with as its diagonal entries and the dual variable is also a vector in .
In the case of , the canonical conjugate function of can be written as
The dual feasible spaces are three subsets of :
Thus, the canonical dual problem () is formulated as
In the case of , the elegant conjugate function of can be given as
Similarly, we get dual feasible subsets in :
Then, the canonical dual problem () is formulated as
Theorem 1 (Canonical duality theorem). The problem () is canonically dual to the primal problem () means that if is a KKT point of the canonical dual problem (P), then the vector defined by
is a KKT point of () and
Proof Without loss of generality, we suppose that is a KKT point of (), then the criticality condition (where stands for the derivative of at ) leads to the following equation
On the other hand, the criticality condition leads to the KKT condition
where stands for the -th component of the vector . Thus, is also a KKT point of the primal problem (). By Eq. (7), we get . Thus, by and
we have
This proves the theorem.
The Theorem 1 implies that there is no duality gap between the () and (). It was apparent to all that the KKT conditions are only necessary for nonconvex quadratic programming problem, we will show the global and local extreme conditions of the primal problem () next.
Global and local extreme conditions
To identify the global and local extreme conditions of the nonconvex and nonsmooth problem (), we had better introduce two useful feasible subsets of are respectively defined by
Theorem 2 (Triality Theorem). Suppose that the vector is a solution of and .
If , then is a global maximizer of on , while is a global minimizer of on and
If , then on the neighborhoods of , we get that either
or
holds.
Proof Without loss of generality, suppose that . The extended Lagrangian related to () can be written as
By Theorem 1, we have that the vector is a KKT point of if and only if is a KKT point of (), and .
If , the matrix is definite, the extended Lagrangian is convex on and concave in both and , i.e. it is a saddle function on . Thus, we obtain that
with the fact that
If , the matrix is indefinite, In this case, the function is a so-called super-Lagrangian [8], and it is locally concave in both and . Thus, by the triality theory developed in [8], we get either
or
This proves the Triality theorem.
The Theorem 2 reveals an important fact that the nonconvex and nonsmooth problem () can be converted into a concave maximization dual problem . And the condition provides local extremal conditions for the problem (), while the condition provides global extremal conditions for the general box constrained nonconvex and nonsmooth minimization problem ().
Application and examples
The canonical duality theory can be applied to many applications especially in engineering and science applications. Now we show examples to illustrate the theory presented in this paper in the case of and respectively.
Examples. In the case of , the nonconvex and nonsmooth function
where
and
If , the canonical dual function of is
If , the canonical dual function of is
Thus, if we choose , and then , the function :
and its canonical dual function :
(a) Graph of the nonconvex and nonsmooth function with box constrained Normal distribution and real Frequency; (b) Graph of the function .
In the canonical dual function has one root:
In the canonical dual function has no any roots. In the canonical dual function has one real root:
By Theorem 1, we have
Since and , , , by Theorem 2, we know that is a local maximizer of and is a local maximizer of , while, is a global minimizer of and (see Fig. 1).
In the case of , the nonconvex and nonsmooth function
where
is a nonconvex and nonsmooth function and , is an arbitrary constant.
If , the canonical dual function of is
If , the canonical dual function of is
Graph of the nonconvex and nonsmooth function with general box constrained.
Thus, if we choose , and then . In the effective domain is inversible, the canonical dual function has one real root:
In the effective domain is inversible, and The effective domain is inversible, , the canonical dual function has no any roots in either or .
The canonical dual transformation can be used to easily obtain the complete solutions and global or local extreme of by converting a high dimensional () box constrained nonconvex and non smoooth problem into a one-dimensional canonical dual problem. And we can check the fact that the canonical dual function is concave on the dual feasible space , when is non-empty, its dual problem has one KKT point in at least. Thus, we can easily find all critical points and extremal by well-developed deterministic optimization methods.
Footnotes
Acknowledgments
The authors acknowledge the support from Natural Science Foundation of China under Grant No. 71671064 and Fundamental Research Funds for the Central Universities under Grant no. 2018ZD14 and no. 2016XS70.
References
1.
BenjaminC. and SachinS., Reliable estimates of error in self-diffusivity from molecular simulations using statistical bootstrap, Journal of Computational Methods in Sciences and Engineering (2018), 1–19.
2.
FalkF., Elastic phase transitions and nonconvex energy functions, Free Boundary Problem: Theory and ApplicationsI (1990), 45–59.
3.
Genetha GrayA.Herbert LeeK.H. and GuentherJ., Simultaneous optimization and uncertainty quantification, Journal of Computational Methods in Sciences and Engineering12(12) (2012), 99–110.
4.
GaoD.Y., Solutions and optimality criteria to box constrained nonconvex minimization problems, Journal of Industrial and Management Optimization3(2) (2017), 293–304.
5.
GaoD.Y.WatsonL.EasterlingD.ThackerW. and BillupsS., Solving the canonical dual of box-and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm, Optimization Methods and Software28(2) (2013), 313–326.
6.
GaoD.Y. and SheraliH.D., Canonical duality theory: Connection between nonconvex mechanics and global optimization, Advances in Mechanics and MathematicsIII Springer (2006).
7.
GaoD.Y., Nonconvex semi-linear problems and canonical duality solutions, Advances in Mechanics and MathematicsII (2003), 261–312.
8.
GaoD.Y., Duality principles in nonconvex systems: Theory, methods and applications, Kluwer Academic Publishers, Dordrecht/Boston/LondonIII (2000).
9.
GaoD.Y., Dual extremum principles in finite deformation theory with applications in post-buckling analysis of nonlinear beam model, Applied Mechanics Review, ASME50 (1997), 64–71.
10.
GaoD.Y. and StrangG., Geometric nonlinearity: Potential energy, complementary energy, and the gap function, Quarterly of Applied Mathematics47(3) (1989), 487–504.
11.
LiuJ. and LiuH., Canonical duality for box constrained nonconvex and nonsmooth optimization problems, Mathematical Problems in Engineering3 (2015), 1–9.
12.
LiuJ.GaoD.Y. and GaoY., Canonical duality theory for solving nonconvex and nonsmooth optimization problem, Optim Eng10 (2009), 153–165.
13.
LiuJ.GaoD.Y. and GaoY., Perfect duality theory and solutions to a class of unconstrained nonconvex and nonsmooth optimization, Optimization and Engineering108(3) (2009), 158–167.
14.
LatorreV. and GaoD.Y., Canonical duality for solving general nonconvex constrained problems, Optimization Letters10(8) (2016), 1763–1779.
15.
RuanN.GaoD.Y. and GaoD.Y., Canonical duality approach for non-linear dynamical systems, Ima Journal of Applied Mathematics79(2) (2014), 313–325.