In the survey of the continuous nonlinear resource allocation problem, Patriksson pointed out that Newton-type algorithms have not been proposed for solving the problem of search theory in the theoretical perspective. In this paper, we propose a Newton-type algorithm to solve the problem. We prove that the proposed algorithm has global and superlinear convergence. Some numerical results indicate that the proposed algorithm is promising. 1. Introduction We consider the problem where , , , and is the vector of ones. The problem described by (1) is called the theory of search by Koopman  and Patriksson . It has the following interpretation: an object is inside box with probability , and is proportional to the difficulty of searching inside the box. If the searcher spends time units looking inside box , then he/she will find the object with probability . The problem described by (1) represents the optimum search strategy if the available time is limited to time units. Such problems in the form of (1) arise, for example, in searching for a lost object, in distribution of destructive effort such as a weapons allocation problem , in drilling for oil, and so forth . Patriksson  surveyed the history and applications as well as algorithms of Problem (1); see [2, Sections 2.1.4, 2.1.5, and 3.1.2]. Patriksson pointed out that Newton-type algorithms have not been theoretically analyzed for the problem described by (1) in the references listed in . Recently, related problems and methods were considered in many articles, for example, [4–6]. For example, a projected pegging algorithm was proposed in  for solving convex quadratic minimization. However, the question proposed by Patriksson  was not answered in the literature. In this paper, we design a Newton-type algorithm to solve the problem described by (1). We show that the proposed algorithm has global and superlinear convergence. According to the Fischer-Burmeister function , the problem described by (1) can be transformed to a semismooth equation. Based on the framework of the algorithms in [8, 9], a smoothing Newton-type algorithm is proposed to solve the semismooth equation. It is shown that the proposed algorithm can generate a bounded iteration sequence. Moreover, the iteration sequence superlinearly converges to an accumulation point which is a solution to the problem described by (1). Numerical results indicate that the proposed algorithm has good performance even for . The rest of this paper is organized as follows. The Newton-type algorithm is proposed in Section 2. The global
L. Qi, “Regular pseudo-smooth NCP and BVIP functions and globally and quadratically convergent generalized Newton methods for complementarity and variational inequality problems,” Mathematics of Operations Research, vol. 24, no. 2, pp. 440–471, 1999.
X. Chen, L. Qi, and D. Sun, “Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities,” Mathematics of Computation, vol. 67, no. 222, pp. 519–540, 1998.
C. Wilkinson and S. K. Gupta, “Allocation promotional effort to competing activities: a dynamic programming approach,” in Proceedings of the International Federation of Operational Research Societies Conference (IFORS '69), pp. 419–432, Venice, Italy, 1969.