#### Abstract

We present a global optimization algorithm for solving generalized quadratic programming (GQP), that is, nonconvex quadratic programming with nonconvex quadratic constraints. By utilizing a new linearizing technique, the initial nonconvex programming problem (GQP) is reduced to a sequence of relaxation linear programming problems. To improve the computational efficiency of the algorithm, a range reduction technique is employed in the branch and bound procedure. The proposed algorithm is convergent to the global minimum of the (GQP) by means of the subsequent solutions of a series of relaxation linear programming problems. Finally, numerical results show the robustness and effectiveness of the proposed algorithm.

#### 1. Introduction

In this paper, we consider the following generalized quadratic programming problem: where () are all symmetric matrices, , , ; , .

Generalized quadratic programming problems are worthy of study, and it is not only because they have broad applications in heat exchanger network design engineering, financial management, statistics, optimal controllers, and so on [1, 2], but also because many other nonlinear problems can be transformed into this form [3, 4], and we often approximate nonlinear programming via solution of a series of quadratic programming problems. In addition, from a research point of view, these problems exist as significant theoretical and computational challenges. This is mainly because these problems are global optimization problem; that is, they are known to generally possess multiple local optimal solutions that are not globally optimal. So it is necessary to establish good solution algorithm for generalized quadratic programming problem (GQP).

In the last decades, many solution methods have been developed for globally solving special form and general form of the (GQP). For examples, when constraint condition is a box constraint, a branch-and-cut algorithm [5] has been proposed by Vandenbussche and Nemhauser; when each function () is a linear function, that is, GQP is an indefinite quadratic programming with linear constraints, then two efficient algorithms [6, 7] have been available; when each function () is a convex function, that is, GQP is one nonconvex quadratic programming with convex constraints, then two feasible algorithms [8, 9] have been presented for globally solving the GQP; by utilizing lagrangian underestimates and the interval newton method, Voorhis [10] has proposed a global optimization algorithm for generalized quadratic programming; by applying a reformulation linearization technique, Sherali and Tuncbilek [11] have presented a feasible method for polynomial programming problems. In addition, Qu et al. [12] Shen and Liu [13] have proposed two different branch and bound algorithms for generalized quadratic programming problem using linearizing method, respectively.

In this paper, we will present a global optimization algorithm for solving the (GQP) by combining branch and bound operation with a range reduction technique. The main features of our algorithm are as follows. A new linearizing technique is presented; utilize the technique to systematically convert the GQP problem into a series of relaxation linear programming problems, and the solutions of these converted problems can infinitely approximate the global optimum of the original GQP problem by a successive refinement process. The proposed linearization techniques for generating relaxation linear programming problems are embedded within a branch and bound scheme without increasing new variables and constraints. The proposed relaxation linear programming for the GQP can be easily solved, which is more convenient in computation than the relaxation convex programming; thus, any effective linear programming algorithm can be used to solve this problem. To accelerate the convergent speed of the proposed algorithm, a range reduction technique is applied in the proposed branch and bound procedure, which provides a theoretical possibility to delete a large part of the currently investigated region where there exists no global optimal solution of the (GQP). Combing the new linearizing technique, branch and bound scheme, and range reduction technique, a branch-reduction-bound algorithm is presented. Finally, numerical results show that the proposed method can globally solve all test problems in obtaining global optimal solutions within a given tolerance error.

The remainder of this paper is organized as follows. The next section describes the linearizing method and the relaxation linear programming of the original problem is established. Section 3 states the branch-reduction-bound algorithm and its convergence. In Section 4 numerical experimental results are given. Finally, the conclusions are presented.

#### 2. Relaxation Linear Programming

The principal structure in the development of a solution procedure for solving the (GQP) is the construction of lower bounds for this problem, as well as for its partitioned subproblems. A lower bound on the solution of the (GQP) and its partitioned subproblems can be obtained by solving a relaxation linear programming of the (GQP). In order to generate the relaxation linear programming, the proposed strategy is that underestimates each quadratic function () with a linear function.

In the following, we assume that with , . Let be the minimum eigenvalues of the matrix . Select such that where is a small positive number.

For convenience, for any , for each , define the function

Theorem 1. *For each , for all , by the definition of and , we have the following conclusions:*(i)*;
*(ii)* as .*

*Proof. * For each , by the mean value theorem, for the function over the interval , we have
where .

From the definition of the function and the equivalent deformation of the function , we can get that
That is,

By the definition of the function and the proof of conclusion (i), we have
Since
we have
The proof is complete.

By Theorem 1, we can construct the corresponding approximation relaxation linear programming (RLP) of the (GQP) in as follows: where

Based on the relaxation linear programming, every feasible point of the (GQP) in subdomain is feasible to the (RLP); and the objective function value of the (RLP) is less than or equal to that of (GQP) over the partitioned set . Thus, the RLP() provides a valid lower bound for the solution of the GQP().

#### 3. Algorithm and Its Convergence

In this section, a branch-reduction-bound algorithm is proposed for globally solving the (GQP). To find a global optimal solution, the main computation is to solve a sequence of relaxation linear programming problems over partitioned subsets of . Furthermore, in order to improve the computational efficiency of the proposed algorithm, a range reduction technique is employed to enhance the solution procedure.

The proposed algorithm is based on partitioning the set into subhyperrectangles, and each subhyperrectangle is associated with a node of the branch and bound tree, and each node is associated with a relaxation linear programming problem in corresponding subhyperrectangle. Therefore, at any stage of the algorithm, assume that we obtain a collection of active nodes denoted by , say, each is associated with a hyperrectangle , for all . For each such node , compute a corresponding lower bound of the GQP by solving the RLP, so that the lower bound of optimal value for the (GQP) over the at iteration is updated by . Until the solution of the (RLP) turns out to be feasible to the (GQP), we renew the upper bound if necessary. Then, the set of the active nodes will satisfy , for all , for each iteration . We now select an active node to partition its associated hyperrectangle into two subhyperrectangles according to the following branching rule, and calculate the lower bounds for each new node as before. Upon fathoming any nonimproving nodes, we get a set of active nodes for the next iteration, and this process is repeated until termination condition is satisfied.

The critical factor in guaranteeing convergence to a global optimum is the choice of a suitable branching rule. In this paper, we will choose a simple and standard bisection rule. This rule is sufficient to ensure convergence since it drives all the intervals to zero for all variables. This branching rule is stated as follows. Consider any node subproblem identified by the rectangle . Let , and partition into two subrectangles and by bisection the interval into the subintervals and .

##### 3.1. Range Reduction Technique

To improve computational efficiency of the proposed algorithm, a range reduction technique proposed in [13, 14] is applied in the algorithm, which is reformulated as the following Theorems 2 and 3. In iteration , we will check whether or not there exists global optimal solution of the GQP() over . The proposed technique aims at reducing the rectangle without deleting any global optimal solution of the GQP() over . For convenience, for all with and . Without loss of generality, we rewrite the as the following form: where

Let be a known upper bound of the optimal value of the GQP(), and set

Theorem 2. *For any subrectangle , the following conclusions hold.*(i)*If , then there exists no global optimal solution of the GQP() over .*(ii)*If , then, for each , if , then there does not exist global optimal solution of the GQP() over ; if , there is no global optimal solution of the GQP() over , where
*

*Proof. *(i) If , then for all , ; that is,
Therefore, there exists no global optimal solution of the GQP() over .

(ii) If , then, for each , if , for all , we have ; that is,
Therefore, we get that
Thus, we have
Therefore, there does not exist global optimal solution of the GQP() over .

Similarly, if , there is no global optimal solution of problem GQP() over .

Theorem 3. *For any subrectangle , for all , the following conclusions hold.*(i)*If for some , then there exists no global optimal solution of the GQP() over .*(ii)*If for each , then, for each , if , then there is no global optimal solution of the GQP() over ; if , there does not exist global optimal solution of the GQP() over , where
*

*Proof. * If for some , then for all , we have
Therefore, there exists no global optimal solution of the GQP() over .

If for each , then, for each , if , for all , we have ; that is,
Therefore, we get that
Thus, we have
Hence, there does not exist global optimal solution of the GQP() over .

Similarly, if , there is no global optimal solution of the GQP() over .

By Theorems 2 and 3, we can give a range reduction technique to reject some regions where there does not exist the global optimal solution of the GQP(). Let with () be any subrectangle of .

*Range Reduction Technique*

*Reduction Rule (i).* Calculate .

If , then let ; otherwise, calculate and ().

If and for some , then let and with ().

If and for some , then let and with ().

*Reduction Rule (ii).* For each , calculate .

If for some , let ; otherwise, calculate and ().

If and for some and , then let and with ().

If and for some and , then let and with ().

##### 3.2. Branch-Reduction-Bound Algorithm

Let refer to the optimal value of the (RLP) over the subhyperrectangles and let refer to an element of corresponding argmin. Combining the former relaxation linear programming problem, branching operation, and range reduction technique together, the basic steps of the proposed algorithm for globally solving the (GQP) may be stated as follows.

*Algorithm 4. **Step *0 (initialization)*.* Let the iteration counter , the set of all active nodes , and the convergence tolerance . Let the initial upper bound , and the set of feasible points .

Solve the RLP, obtain optimal solution and optimal value for the RLP, and let . If is feasible to the GQP(), let and . If , then stop with as the global optimal solution for the GQP(). Otherwise, proceed to Step 1. *Step *1 (branching). Using the proposed branching rule to partition into two new subhyperrectangles, and denote the set of new partition rectangles by . *Step *2 (reduction). For each subhyperrectangle , utilize the proposed range reduction technique to reject a part of the region or the whole region , and still denote the remaining region by , and still denote the remaining partition set by . *Step *3 (updating the upper bound). If , solve the RLP to obtain and for each . For each , if , set ; otherwise, select the midpoint of ; if is feasible to the GQP(), then let , and if is feasible to the GQP(), then let .

If , update the upper bound , and denote the best known feasible point by . *Step *4 (updating the lower bound). The partition set remaining is now , and update the lower bound . *Step *5 (convergence checking). Set . If , then stop with as the global optimal value of the (GQP) and as the global optimal solution. Otherwise, select an active node such that , . Set , and return to Step 1.

##### 3.3. Convergence Analysis

In this subsection, the global convergence properties of the proposed algorithm are presented. If the algorithm does not terminate finitely, then the branching rule guarantees all the intervals shrinking to a singleton for all the variables. On the other hand, Theorem 1 guarantees that as the relaxation linear programming problem RLP() approaches GQP(). So it is not surprising that the algorithm is shown to be the convergent to the global optimal solution.

Theorem 5. *The proposed algorithm either terminates finitely with the global -optimal solution of problem GQP() or generates an infinite sequence of iteration such that along any infinite branch of the branch and bound tree, any accumulation point of the sequence will be the global solution of problem GQP().*

*Proof. *If the algorithm is finite, suppose that it terminates in iteration , . Upon termination, we have
By Steps 0 and 3 in Algorithm 4, we can find a feasible solution for the problem GQP() such that , which implies
Set denotes the optimal value of problem GQP(); then, by computational method of lower bound, we have
Since is a feasible solution of problem GQP(), we have
By inequalities (26)–(28), we can get that
That is,
Therefore, is a global -optimal solution of the problem GQP().

If the algorithm is infinite, by the proposed algorithm, we know that the lower bound sequence is nondecreasing and bounded by the upper bound ; therefore, there exists limitation such that
Since , where is a bounded close set, there exists a convergent subsequence and assume . Then by the proposed algorithm, there exists a decreasing subsequence where with , and . By Theorem 1 and the continuity of the function , we can follow that

Then all remaining is to demonstrate that is feasible to the GQP().

Firstly, since is bounded and closed set, obviously we have .

Secondly, we will prove that , .

By contradiction, assume for some . Since is a continuous function and by Theorem 1, the sequence is convergent to ; that is, there exists a such that
Hence, for any , we have , which shows that the LRP() is infeasible and violates the assumption that . This will bring about a contradiction; thus, the proof is competed.

#### 4. Numerical Experiments

To compare the proposed algorithm with the known methods in computational efficiency and solution quality, some test examples in recent literature are implemented on microcomputer, the algorithm procedure is coded in C++, and each relaxation linear programming is solved by using simplex method, and the convergence tolerance is set to in Examples 6–13 and in Example 14, respectively. These test examples and numerical results compared with the known algorithms are given in Tables 1 and 2.

*Example 6 (see [15]). *Consider

*Example 7 (see [13, 16]). *Consider

*Example 8 (see [13, 16, 17]). *Consider

*Example 9 (see [18]). *Consider

*Example 10 (see [19]). *Consider

*Example 11 (see [14]). *Consider

*Example 12 (see [14]). *Consider

*Example 13 (see [20]). *Consider

*Example 14 (see [21]). *Consider

The numerical results for Example 14 compared with [21] are given in Table 3.

The numerical results for test Examples 6–14 show that the proposed algorithm is robust and can be used to globally solve generalized quadratic programming (GQP).

#### 5. Concluding Remarks

In this paper, a global optimization algorithm based on a new linearizing method and a range reduction technique is presented for solving the (GQP). The relaxation linear programming of the original problem (GQP) is established by underestimating the objective and constraint functions with linear functions. By making full use of the currently known upper bound and relaxation linear programming of the (GQP), a range reduction technique is presented. The algorithm is convergent to the global minimum through the successive refinement of a linear relaxation of the feasible region and/or of the objective function and the subsequent solution of a series of relaxation linear programming problems. Numerical results show effectiveness and robustness of the proposed algorithm.

#### Acknowledgments

This paper is supported by the National Natural Science Foundation of China (11171094), the Foundation for University Key Teacher by the Ministry of Education of Henan Province (2010GGJS-140), and the Natural Science Foundation of Henan Educational Committee (2010B110010). The authors acknowledged the help of Yingfeng Zhao while preparing the paper.