Abstract
Many problems in real world are reduced to systems of nonsmooth equations and hence many researchers study numerical methods for solving systems of nonsmooth equations. As numerical methods for solving systems of nonsmooth equations, Newton-like methods are known as efficient numerical methods. However, these methods are not necessarily applied directly to large-scale problems, because these methods need to store matrices. In this paper, we propose a smoothing method which is based on the nonlinear conjugate gradient method and does not store any matrices for solving systems of nonsmooth equations. In addition, we prove the global convergence property of the proposed method under standard assumptions. Finally, we give some preliminary numerical results.
| Original language | English |
|---|---|
| Pages (from-to) | 8646-8655 |
| Number of pages | 10 |
| Journal | Applied Mathematics and Computation |
| Volume | 219 |
| Issue number | 16 |
| DOIs | |
| Publication status | Published - 2013 |
| Externally published | Yes |
Keywords
- Conjugate gradient method
- Global convergence
- Smoothing method
- Systems of nonsmooth equations
ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'A smoothing conjugate gradient method for solving systems of nonsmooth equations'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS