A projection method for convex constrained monotone nonlinear equations with applications

In this paper, we present a projection method to solve monotone nonlinear equations with convex constraints. This method can be viewed as an extension of CG_DESCENT method which is one of the most effective conjugate gradient methods for solving unconstrained optimization problems. Because of deriva...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & mathematics with applications (1987) 2015-11, Vol.70 (10), p.2442-2453
Hauptverfasser: Liu, J.K., Li, S.J.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we present a projection method to solve monotone nonlinear equations with convex constraints. This method can be viewed as an extension of CG_DESCENT method which is one of the most effective conjugate gradient methods for solving unconstrained optimization problems. Because of derivative-free and low storage, the proposed method can be used to solve large-scale nonsmooth monotone nonlinear equations. Its global convergence is established under some appropriate conditions. Preliminary numerical results show that the proposed method is effective and promising. Moreover, we also successfully use the proposed method to solve the sparse signal reconstruction in compressive sensing.
ISSN:0898-1221
1873-7668
DOI:10.1016/j.camwa.2015.09.014