A superlinearly convergent hybrid algorithm for systems of nonlinear equations
We propose a new algorithm for solving systems of nonlinear equations with convex constraints which combines elements of Newton, the proximal point, and the projection method. The convergence of the whole sequence is established under weaker conditions than the ones used in existing projection-type methods. We study the superlinear convergence rate of the new method if in addition a certain error bound condition holds. Preliminary numerical experiments show that our method is efficient.
MSC: 90C25, 90C30.
Keywordsnonlinear equationsprojection methodglobal convergencesuperlinear convergence
The property (1.2) holds if F is monotone or more generally pseudomonotone on C in the sense of Karamardian .
Nonlinear equations have wide applications in reality. For example, many problems arising from chemical technology, economy, and communications can be transformed into nonlinear equations; see [2–5]. In recent years, many numerical methods for problem (1.1) with smooth mapping F have been proposed. These methods include the Newton method, quasi-Newton method, Levenberg-Marquardt method, trust region method, and their variants; see [6–14].
Recently, the literature  proposed a hybrid method for solving problem (1.1), which combines the Newton, proximal point, and projection methodologies. The method possesses a very nice globally convergent property if F is monotone and continuous. Under the assumptions of differentiability and nonsingularity, locally superlinear convergence of the method is proved. However, the condition of nonsingularity is too strong. Relaxing the nonsingularity assumption, the literature  proposed a modified version for the method by changing the projection way, and showed that under the local error bound condition which is weaker than nonsingularity, the proposed method converges superlinearly to the solution of problem (1.1). The numerical performances given in  show that the method is really efficient. However, the literatures [15, 16] need the mapping F to be monotone, which seems too stringent a requirement for the purpose of ensuring global convergence property and locally superlinear convergence of the hybrid method.
To further relax the assumption of monotonicity of F, in this paper, we propose a new hybrid algorithm for problem (1.1) which covers one in . The global convergence of our method needs only to assume that F satisfies the property (1.2), which is much weaker than monotone or more generally pseudomonotone. We also discuss the superlinear convergence of our method under mild conditions. Preliminary numerical experiments show that our method is efficient.
2 Preliminaries and algorithms
We have the following property on the projection operator; see .
Algorithm 2.1 Choose , parameters , λ, , , , , , and set .
Stop if . Otherwise,
Let and return to Step 1.
Remark 2.1 When we take parameters , , and the search direction , our algorithm degrades into one in . At this step of getting the next iterate, our projection way and projection region are also different from the one in .
Now we analyze the feasibility of Algorithm 2.1. It is obvious that satisfying conditions (2.1) and (2.2) exists. In fact, when we take , satisfies (2.1) and (2.2). Next, we need only to show the feasibility of (2.3).
Lemma 2.2For all nonnegative integerk, there exists a nonnegative integersatisfying (2.3).
Proof If , then it follows from (2.1) and (2.2) that , which means Algorithm 2.1 terminates with being a solution of problem (1.1).
Which, together with (2.5), , and , we conclude that , which contradicts . This completes the proof. □
3 Convergence analysis
In this section, we first prove two lemmas, and then analyze the global convergence of Algorithm 2.1.
Lemma 3.1If the sequencesandare generated by Algorithm 2.1, is bounded andFis continuous, thenis also bounded.
From the boundedness of and the continuity of F, we conclude that is bounded, and hence so is . This completes the proof. □
In particular, if, then.
where the inequality follows from condition (1.2) and the definition of .
If , then because . The proof is completed. □
strictly separates the current iterate from the solution set of problem (1.1).
where the first inequality follows from condition (1.2), the second one follows from (2.3), and the last one follows , which shows that is a descent direction of the function at the point .
We next prove our main result. Certainly, if Algorithm 2.1 terminates at Step k, then is a solution of problem (1.1). Therefore, in the following analysis, we assume that Algorithm 2.1 always generates an infinite sequence.
Theorem 3.1IfFis continuous onC, condition (1.2) holds and, then the sequencegenerated by Algorithm 2.1 globally converges to a solution of (1.1).
Now, we consider the following two possible cases:
This shows that is a solution of problem (1.1). Replacing by in the preceding argument, we obtain that the sequence is nonincreasing, and hence converges. Since is an accumulation point of , some subsequence of converges to zero, which implies that the whole sequence converges to zero, and hence .
From (2.5) and (3.5), we conclude that , which contradicts . Hence, the case of is not possible. This completes the proof. □
4 Convergence rate
In this section, we provide a result on the convergence rate of the iterative sequence generated by Algorithm 2.1. To establish this result, we need the following conditions (4.1) and (4.2).
In 1998, the literature  showed that their proposed method converged superlinearly when the underlying function F is monotone, differentiable with being nonsingular, and ∇F is locally Lipschitz continuous. It is known that the local error bound condition given in (4.1) is weaker than the nonsingular. Recently, under conditions (4.1), (4.2), and the underlying function F being monotone and continuous, the literature  obtained the locally superlinear rate of convergence of the proposed method.
Next, we analyze the superlinear convergence rate of the iterative sequence under a weaker condition. In the rest of section, we assume that , , where .
Lemma 4.1Letbe a positive semidefinite matrix and. Then
Proof See . □
Lemma 4.2Suppose thatFis continuous and satisfies conditions (1.2), (4.1), and (4.2). If there exists a positive constantNsuch thatfor allk, then for allksufficiently large,
(2) , where, andare all positive constants.
We obtain that the left-hand side of (1) by setting .
We obtain the right-hand side part by setting .
By setting , we obtain the desired result. □
where the last inequality follows from .
which implies that (2.3) holds with for all k sufficiently large, i.e., . This completes the proof. □
From now on, we assume that k is large enough so that .
where . This completes the proof. □
Now, we turn our attention to local rate of convergence analysis.
Theorem 4.1Suppose that the assumptions in Lemma 4.2 hold. Then the sequenceQ-superlinearly converges to 0.
which implies that the order of superlinear convergence is at least 1.5. This completes the proof. □
5 Numerical experiments
In this section, we present some numerical experiments results to show the efficiency of our method. The MATLAB codes are run on a notebook computer with CPU2.10GHZ under MATLAB Version 7.0. Just as done in , we take and use the left division operation in MATLAB to solve the system of linear equations (2.1) at each iteration. We choose , , , , and . ‘Iter.’ denotes the number of iteration and ‘CPU’ denotes the CPU time in seconds. We choose as the stop criterion. The example is tested in .
Numerical results of Example with
1.07 × 10−8
1.62 × 10−9
2.46 × 10−9
9.92 × 10−10
5.66 × 10−10
Numerical results of Example with
1.07 × 10−8
1.62 × 10−9
1.17 × 10−9
1.44 × 10−9
7.88 × 10−9
The author wish to thank the anonymous referees for their suggestions and comments. This work is also supported by the Educational Science Foundation of Chongqing, Chongqing of China (Grant No. KJ111309).
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.