Abstract and Applied Analysis
- Abstr. Appl. Anal.
- Volume 2014 (2014), Article ID 386030, 6 pages.
A Globally Convergent Matrix-Free Method for Constrained Equations and Its Linear Convergence Rate
A matrix-free method for constrained equations is proposed, which is a combination of the well-known PRP (Polak-Ribière-Polyak) conjugate gradient method and the famous hyperplane projection method. The new method is not only derivative-free, but also completely matrix-free, and consequently, it can be applied to solve large-scale constrained equations. We obtain global convergence of the new method without any differentiability requirement on the constrained equations. Compared with the existing gradient methods for solving such problem, the new method possesses linear convergence rate under standard conditions, and a relax factor is attached in the update step to accelerate convergence. Preliminary numerical results show that it is promising in practice.
Abstr. Appl. Anal., Volume 2014 (2014), Article ID 386030, 6 pages.
First available in Project Euclid: 2 October 2014
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Sun, Min; Liu, Jing. A Globally Convergent Matrix-Free Method for Constrained Equations and Its Linear Convergence Rate. Abstr. Appl. Anal. 2014 (2014), Article ID 386030, 6 pages. doi:10.1155/2014/386030. https://projecteuclid.org/euclid.aaa/1412277002