A conjugate gradient projection method for solving equations with convex constraints

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS

卷:375

Article

Zheng, Li¹  Yang, Lei¹  Liang, Yong¹ 

[1] Macau Univ Sci & Technol, Fac Informat Technol, Macau, Peoples R China

关键词: Nonlinear equations;    Derivative-free method;    Conjugate gradient method;    Global convergence;   

DOI  :  10.1016/j.cam.2020.112781

来源: Elsevier

【 摘 要 】

In this paper, we propose a derivative-free iterative method for a class of equations with convex constraints appearing in a variety of the practical problems such as compressing sensing, fluid mechanics, plasma physics, nonlinear optics and solid state. In the iteration, our search direction can be viewed as an extension of a modified three-term CG method. By an appropriate line search and the projection step, our method is convergent to the solution. Our method inherits the advantages of CG method and projection method, and thus is suitable for solving large-scale non-smooth problem. Under the assumption that F is Lipschitz continuous and satisfies a weaker condition of monotonicity, our method is globally convergent. Numerical results show the efficiency of the proposed method. (C) 2020 Elsevier B.V. All rights reserved.

【 授权许可】

Free