An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints
- 70 Downloads
In this paper, based on the hyperplane projection technique, we propose a three-term conjugate gradient method for solving nonlinear monotone equations with convex constraints. Due to the derivative-free feature and lower storage requirement, the proposed method can be applied to the solution of large-scale non-smooth nonlinear monotone equations. Under some mild assumptions, the global convergence is proved when the line search fulfils the backtracking line search condition. Moreover, we prove that the proposed method is R-linearly convergent. Numerical results show that our method is competitive and efficient for solving large-scale nonlinear monotone equations with convex constraints.
KeywordsConjugate gradient method Convex constraints Large-scale problems Nonlinear equations
Mathematics Subject Classification65F10 90C52 65K05
The authors gratefully acknowledge the helpful comments and suggestions of the anonymous reviewers.
- 1.Wood, A.J., Wollenberg, B.F.: Power Generations, Operations, and Control. Wiley, New York (1996)Google Scholar
- 4.El-Hawary, M.E.: Optimal Power Flower: Solution Techniques, Requirement, and Challenges. IEEE Service Center, Piscataway (1996)Google Scholar
- 8.Dennis, J.E., Schnabel, R.B.: Numerical methods for unconstrained optimization and nonlinear equations, Prentice-Hall, Englewood Cliffs, NJ(1983)Google Scholar
- 21.Beale, E.M.L.: A derivation of conjugate gradients. In: Lootsma, F.A. (ed.) Numerical Methods for Nonlinear Optimization, pp. 39–43. Academic Press, London (1972)Google Scholar