JOURNAL BROWSE
Search
Advanced SearchSearch Tips
A NEW PROJECTION ALGORITHM FOR SOLVING A SYSTEM OF NONLINEAR EQUATIONS WITH CONVEX CONSTRAINTS
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
A NEW PROJECTION ALGORITHM FOR SOLVING A SYSTEM OF NONLINEAR EQUATIONS WITH CONVEX CONSTRAINTS
Zheng, Lian;
  PDF(new window)
 Abstract
We present a new algorithm for solving a system of nonlinear equations with convex constraints which combines proximal point and projection methodologies. Compared with the existing projection methods for solving the problem, we use a different system of linear equations to obtain the proximal point; and moreover, at the step of getting next iterate, our projection way and projection region are also different. Based on the Armijo-type line search procedure, a new hyperplane is introduced. Using the separate property of hyperplane, the new algorithm is proved to be globally convergent under much weaker assumptions than monotone or more generally pseudomonotone. We study the convergence rate of the iterative sequence under very mild error bound conditions.
 Keywords
nonlinear equations;projection algorithm;global convergence;convergence rate;
 Language
English
 Cited by
1.
A modified Hestenes–Stiefel projection method for constrained nonlinear equations and its linear convergence rate, Journal of Applied Mathematics and Computing, 2015, 49, 1-2, 145  crossref(new windwow)
2.
A Globally Convergent Matrix-Free Method for Constrained Equations and Its Linear Convergence Rate, Abstract and Applied Analysis, 2014, 2014, 1  crossref(new windwow)
3.
Wei–Yao–Liu conjugate gradient projection algorithm for nonlinear monotone equations with convex constraints, International Journal of Computer Mathematics, 2015, 92, 11, 2261  crossref(new windwow)
4.
A family of conjugate gradient methods for large-scale nonlinear equations, Journal of Inequalities and Applications, 2017, 2017, 1  crossref(new windwow)
5.
Two spectral gradient projection methods for constrained equations and their linear convergence rate, Journal of Inequalities and Applications, 2015, 2015, 1  crossref(new windwow)
6.
Three derivative-free projection methods for nonlinear equations with convex constraints, Journal of Applied Mathematics and Computing, 2015, 47, 1-2, 265  crossref(new windwow)
 References
1.
S. P. Dirkse and M. C. Ferris, MCPLIB: A collection of nonlinear mixed complementarity problems, Optim. Methods Software 5 (1995), 319-345. crossref(new window)

2.
M. E. EL-Hawary, Optimal Power Flow: Solution Techniques, Requirement and Challenges, IEEE Service Center, Piscataway, NJ, 1996.

3.
J. Y. Fan, Convergence rate of the trust region method for nonlinear equations under local error bound condition, Comput. Optim. Appl. 34 (2006), no. 2, 215-227. crossref(new window)

4.
J. Y. Fan and J. Y. Pan, An improved trust region algorithm for nonlinear equations, Comput. Optim. Appl. 48 (2011), no. 1, 59-70. crossref(new window)

5.
J. Y. Fan and Y. X. Yuan, On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption, Computing 74 (2005), no. 1, 23-39. crossref(new window)

6.
D. R. Han, A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems, Comput. Math. Appl. 55 (2008), no. 1, 101-115. crossref(new window)

7.
Y. R. He, A new double projection algorithm for variational inequalities, J. Comput. Appl. Math. 185 (2006), no. 1, 166-173. crossref(new window)

8.
S. Karamardian, Complementarity problems over cones with monotone and pseudomonotone maps, J. Optim. Theory Appl. 18 (1976), no. 4, 445-454. crossref(new window)

9.
F. M. Ma and C.W.Wang, Modified projection method for solving a system of monotone equations with convex constraints, J. Appl. Math. Comput. 34 (2010), no. 1-2, 47-56. crossref(new window)

10.
K. Meintjes and A. P. Morgan, A methodology for solving chemical equilibrium system, Appl. Math. Comput. 22 (1987), no. 4, 333-361. crossref(new window)

11.
B. T. Polyak, Introduction to Optimization, Optimization Software Inc., Publications Division, New York, 1987(Translated from Russian, with a foreword by Dimitri P. Bertsekas).

12.
M. V. Solodov and B. F. Svaiter, A globally convergent inexact Newton method for systems of monotone equations, In: Fukushima M., Qi L. (eds) Reformulation: piecewise smooth, semismooth and smoothing methods. Kluwer, Holanda (1998), 355-369.

13.
X. J. Tong and L. Qi, On the convergence of a trust-region method for solving constrained nonlinear equations with degenerate solution, J. Optim. Theory Appl. 123 (2004), no. 1, 187-211. crossref(new window)

14.
C. W. Wang and Y. J. Wang, A superlinearly convergent projection method for constrained systems of nonlinear equations, J. Global Optim. 44 (2009), no. 2, 283-296. crossref(new window)

15.
C. W. Wang, Y. J. Wang, and C. L. Xu, A projection method for a system of nonlinear monotone equations with convex constraints, Math. Methods Oper. Res. 66 (2007), no. 1, 33-46. crossref(new window)

16.
A. J. Wood and B. F. Wollenberg, Power Generations, Operations, and Control, Wiley, New York, 1996.

17.
N. Xiu and J. Zhang, Some recent advances in projection-type methods for variational inequalities, J. Comput. Appl. Math. 152 (2003), no. 1-2, 559-585. crossref(new window)

18.
E. H. Zarantonello, Projections on Convex Sets in Hilbert Spaces and Spectral Theory, Academic Press, New York, 1971.

19.
J. L. Zhang and Y. Wang, A new trust region method for nonlinear equations, Math. Methods Oper. Res. 58 (2003), no. 2, 283-298. crossref(new window)