Mathematical Problems in Engineering

Volume 2010 (2010), Article ID 310391, 9 pages

http://dx.doi.org/10.1155/2010/310391

## A Filled Function Approach for Nonsmooth Constrained Global Optimization

^{1}Department of Mathematics, Shanghai Second Polytechnic University, Shanghai 201209, China^{2}Department of Mathematics, Henan University of Science and Technology, Luoyang 471003, China^{3}Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China

Received 28 April 2010; Revised 4 October 2010; Accepted 8 October 2010

Academic Editor: Jyh Horng Chou

Copyright © 2010 Weixiang Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

A novel filled function is given in this paper to find a global minima for a nonsmooth constrained optimization problem. First, a modified concept of the filled function for nonsmooth constrained global optimization is introduced, and a filled function, which makes use of the idea of the filled function for unconstrained optimization and penalty function for constrained optimization, is proposed. Then, a solution algorithm based on the proposed filled function is developed. At last, some preliminary numerical results are reported. The results show that the proposed approach is promising.

#### 1. Introduction

Recently, since more accurate precisions demanded by real-world problems, studies on global optimization have become a hot topic. Many theories and algorithms for global optimization have been proposed. Among these methods, filled function method is a particularly popular one. The filled function method was originally introduced in [1, 2] for smooth unconstrained global optimization. Its idea is to construct a filled function via it the objective function leaves the current local minimum to find a better one. The filled function method consists of two phase: local minimization and filling. The two phases are performed repeatedly until no better minimizer could be located. The filled function method was further developed in literature [3–9]. It should be noted that these filled function methods deal only with smooth unconstrained or box constrained optimization problem. However, many practical problems could only be modelled as nonsmooth constrained global optimization problems. To address this situation, in this paper, we generalize the filled function proposed in [10] and establish a novel filled function approach for nonsmooth constrained global optimization. The key idea of this approach is to combine the concept of filled function for unconstrained global optimization with the penalty function for constrained optimization.

In general, there are two difficulties in global optimization: the first is how to leave the current local minimizer of to go to a better one; the second is how to check whether the current minimizer is a global solution of the problem. Just like other GO methods, the filled function method has some weaknesses discussed in [11]. In particular, the filled function method cannot solve the second issue, so our paper focuses on the former issue.

The rest of this paper is organized as follows. In Section 2, some preliminaries about nonsmooth optimization and filled function are listed. In Section 3, the concept of modified filled function for nonsmooth constrained global optimization is introduced, a novel filled function is given, and its properties are investigated. In Section 4, an efficient algorithm based on the proposed filled function is developed for solving nonsmooth constrained global optimization problem. Section 5 presents some numerical results. Last, in Section 6, the conclusion is given.

#### 2. Nonsmooth Preliminaries

Consider the following problem () where , , and is a box set.

In this section, we first list some definitions and lemmas from [12], then we make some assumptions on , and finally we define filled function for problem ()

*Definition 2.1. * Letting be Lipschitz with constant at the point the generalized gradient of at is defined as
where is the generalized directional derivative of in the direction at

Lemma 2.2. *Let be Lipschitz with constant at the point then *(a)* is finite, sublinear and satisfies ;*(b)*for all , , and to any , one has ;*(c)*, for all *

Considering problem () throughout the paper, we need the following assumptions: and , , are Lipschitz continuous with a common constant the number of the different value of local minimizer of is finite;, where denotes the interior of denotes the closure of

Now, we give the definition of filled function for problem () below.

*Definition 2.3. *A function is called a filled function of at if all the following conditions are met:(1) is a strict local maximizer of on (2) has no stationary points in the set that is, ;(3)If is not a global minimizer of problem (), then there exists a point such that is a local minimizer of on with

#### 3. A New Filled Function and Its Properties

Define where is a parameter, is a differentiable function such that and for any and indicates the Euclidean vector norm.

Next, we will prove that is a filled function, where is the current local minimizer of problem ()

Theorem 3.1. * is a strict local maximizer of on *

*Proof. * Since is a local minimizer of () there exists a neighborhood of with such that for any We consider the following two cases.*Case 1 ( and ). * In this case, note that
then
*Case 2 (). * In this case, ; moreover, there exists at least one index such that It follows that
Therefore, is a strict local maximizer of

Theorem 3.2. * For any one has *

*Proof. *For any similar to the proof of Theorem 3.1, we have
Since it follows that
Therefore, we have that
So, to any , one has . Then

Theorem 3.3. *Suppose that Assumptions (1)–(3.8) are satisfied. If is not a global minimizer, and is appropriately large, then there exists a point such that is a minimizer of *

*Proof. *Since is not a global minimizer, there exists another local minimizer of () such that By Assumption (3.1), there exists one point such that Thus, we have
On the other hand, to any where denotes the boundary of the set there exists at least one index such that , which yields
Let To any if is chosen to be appropriately large such that
then, we have that

Denotes Then, if is appropriately large such that (3.10) is met, one has
Note that is an open bounded set, thus and for Moreover, we can easily prove that In fact, if it is not true, then
which contradicts with (3.12).

Therefore, one has This completes the proof.

#### 4. Solution Algorithm

In the previous section, several properties of the proposed filled function are discussed. Now a solution algorithm based on these properties is described as follows.

*Initialization Step*

(1)Choose a disturbance constant ; for example, set .(2)Choose an upper bound of such that ; for example, set .(3)Choose a constant ; for example, .(4)Choose direction with integer , where is the number of variable.(5)Set .

*Main Step*

() Start from an initial point , minimize the primal problem () by implementing a nonsmooth local search procedure, and obtain the first local minimizer of .() Let () Construct the filled function: ()**If** , ** then** go to (7). **Else** set as an initial point, minimize the filled function problem by implementing a nonsmooth local search procedure, and obtain a local minimizer denoted .()**If** , **then** set , go to (). **Else** go to next step.()**If** satisfies , ** then** set and , start from as a new initial point, minimize the primal problem () by implementing a local search procedure, and obtain another local minimizer of such that , set , go to (). **Else** go to next step.() Increase by setting .()**If** , **then** set , go to (). **Else** the algorithm is incapable of finding a better local minimizer. The algorithm stops and is taken as a global minimizer.

The motivation and mechanism behind the algorithm are explained as below.

A set of initial points is chosen in Step of the Initialization step to minimize the filled function. We set the initial points symmetric about the current local minimizer. For example, when the initial points are: For example, when , the directions can be chosen as

In Step and Step of the Main step, we minimize the primal problem () by nonsmooth constrained local optimization algorithms such as penalty function method, bundle method, quasi-newton method and composite optimal method. In Step of the Main step, we minimize the filled function problem by nonsmooth unconstrained local optimization algorithms such as cutting-planes method, powell method, and Hooke-Jeeve method. They are all effective methods.

Recall from Theorem 3.3 that the value of should be selected large enough. Otherwise, there could be no minimizer of in set Thus, is increased successively in Step of the solution process if no better solution is found when minimizing the filled function. If all the initial points have been used and reaches its upper bound , but no better solution is found, then the current local minimizer is taken as a global one.

The proposed filled function method can also apply to smooth constrained global optimization.

#### 5. Numerical Experiment

In this section, we perform a numerical test to give an initial feeling of the potential application of the proposed function approach in real-world problems. In our programs, the filled function is of the form The proposed algorithm is programmed in Fortran 95. The composite optimal method is used to find local minimizers of the original constrained problem, and the Hooke-Jeeve method is used to search for local minimizers of the filled function problems.

The main iterative results of Algorithm NFFA applying on four test examples are listed in Tables 1–4. The symbols used in the tables are given as follows::the iteration number in finding the th local minimize;:the parameter to find the th local minimize;:the th initial point to find the th local minimize;:the th local minimize;:the function value of the th initial point;:the function value of the th local minimizer.

*Problem 1. *
We have

Algorithm NFFA succeeds in finding a global minimizer with . The numerical results are listed in Table 1.

*Problem 2. *
We have

Algorithm NFFA successfully finds an approximate global solution with . Table 2 records the numerical results of Problem 2.

*Problem 3. *
We have
where

Algorithm NFFA successfully finds a global solution with . The computational results are listed in Table 3.

*Problem 4. *
We have

The proposed algorithm successfully finds a global solution with . The main iterative results are listed in Table 4.

#### 6. Conclusions

In this paper, we extend the concept of the filled function for unconstrained global optimization to nonsmooth constrained global optimization. Firstly, we give the definition of the filled function for constrained optimization and construct a new filled function with one parameter. Then, we design a solution algorithm based on this filled function. Finally, we perform some numerical experiments. The preliminary numerical results show that the new algorithm is promising.

#### Acknowledgment

The paper was supported by the National Natural Science Foundation of China under Grant nos. 10971053, 11001248.

#### References

- R. P. Ge, “A filled function method for finding a global minimizer of a function of several variables,”
*Mathematical Programming*, vol. 46, no. 2, pp. 191–204, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - R. P. Ge and Y. F. Qin, “A class of filled functions for finding global minimizers of a function of several variables,”
*Journal of Optimization Theory and Applications*, vol. 54, no. 2, pp. 241–252, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - R. Horst, P. M. Pardalos, and N. V. Thoai,
*Introduction to Global Optimization*, vol. 3 of*Nonconvex Optimization and Its Applications*, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1995. - Z. Xu, H.-X. Huang, P. M. Pardalos, and C.-X. Xu, “Filled functions for unconstrained global optimization,”
*Journal of Global Optimization*, vol. 20, no. 1, pp. 49–65, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - X. Liu and W. Xu, “A new filled function applied to global optimization,”
*Computers & Operations Research*, vol. 31, no. 1, pp. 61–80, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - W. Wang, Y. Shang, and L. Zhang, “A filled function method with one parameter for box constrained global optimization,”
*Applied Mathematics and Computation*, vol. 194, no. 1, pp. 54–66, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - L.-S. Zhang, C.-K. Ng, D. Li, and W.-W. Tian, “A new filled function method for global optimization,”
*Journal of Global Optimization*, vol. 28, no. 1, pp. 17–43, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - W. Wang and Y. Xu, “Simple transformation functions for finding better minima,”
*Applied Mathematics Letters*, vol. 21, no. 5, pp. 502–509, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - Y.-l. Shang, D.-g. Pu, and A.-p. Jiang, “Finding global minimizer with one-parameter filled function on unconstrained global optimization,”
*Applied Mathematics and Computation*, vol. 191, no. 1, pp. 176–182, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - W. Wang, Y. Shang, and Y. Zhang, “Finding global minima with a filled function approach for non-smooth global optimization,”
*Discrete Dynamics in Nature and Society*, vol. 2010, Article ID 843609, 10 pages, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - A. Törn and A. Žilinskas,
*Global Optimization*, vol. 350 of*Lecture Notes in Computer Science*, Springer, Berlin, Germany, 1989. - F. H. Clarke,
*Optimization and Nonsmooth Analysis*, Canadian Mathematical Society Series of Monographs and Advanced Texts, John Wiley & Sons, New York, NY, USA, 1983.