| Home  | About ScienceAsia  | Publication charge  | Advertise with us  | Subscription for printed version  | Contact us  
Editorial Board
Journal Policy
Instructions for Authors
Online submission
Author Login
Reviewer Login
Volume 49 Number 5
Volume 49 Number 4
Volume 49 Number 3
Volume 49 Number 2
Volume 49 Number 1
Volume 48 Number 6
Earlier issues
Volume 43 Number 2 Volume 43 Number 3 Volume 43 Number 4

previous article next article 8534

Research articles

ScienceAsia 43 (2017): 195-200 |doi: 10.2306/scienceasia1513-1874.2017.43.195

A derivative-free projection method for solving convex constrained monotone equations

Na Yuan

ABSTRACT:     The CG_DESCENT (CGD) method is one of the most efficient conjugate gradient methods for solving unconstrained optimization problems. However, its applications in some other scenarios are relatively few. In this paper, inspired by one spectral PRP projection method, we extend the CGD method, and establish a derivative-free spectral CGD type projection method to solve large-scale nonlinear monotone equations with convex constraints. Due to it inheriting some nice properties of the conjugate gradient method such as the low memory requirement, the proposed method is very suitable to solve large-scale nonlinear monotone equations. Under appropriate conditions, we prove that the proposed method is globally convergent. Preliminary numerical results show that the proposed method works well.

Download PDF

118 Downloads 1640 Views

College of General Education, Chongqing College of Electronic Engineering, Chongqing 401331 China

* Corresponding author, E-mail: yuanna_math@126.com

Received 9 Dec 2016, Accepted 5 Jun 2017