Jiaqi Wu

Jiaqi Wu

Auto-generated profile, based on publicly available information

Jiaqi Wu

School of Artificial Intelligence, Guangzhou Huashang College, Guangzhou 511300, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

8 January 2025 in Journal of Computational and Applied Mathematics
Verified
Journal Article
Closed access
DLDandan Li
Dandan Li
SWSonghua Wang
Songhua Wang
YLYong Li
Yong Li
JWJiaqi Wu
Jiaqi Wu

1 January 2026 in AIMS Mathematics
Verified
Journal Article
Open access
PDF file
DLDandan Li
Dandan Li
SWSonghua Wang
Songhua Wang
JWJiaqi Wu
Jiaqi Wu
This paper presents a globally convergent inertial-relaxed hybrid conjugate gradient projection (IRHCGP) method for solving constrained nonlinear equations. The proposed method integrates an inertial-relaxed extrapolation strategy into a hybrid conjugate gradient projection framework. A new hybrid conjugate parameter is constructed to generate an effective search direction, which is proved to satisfy both the sufficient descent condition and a trust-region-type bound. These properties provide the theoretical foundation for establishing the global convergence of the proposed method under mild assumptions. Extensive numerical experiments are conducted on large-scale constrained nonlinear equations with various dimensions and initial points, and the proposed method is further applied to impulse noise image restoration. The results demonstrate that the proposed method is competitive and superior to several existing methods in terms of running time, number of function evaluations, and number of iterations.

3 February 2023 in Research Square
Verified
Preprint
Open access
PDF file
DLDandan Li
Dandan Li
SWSonghua Wang
Songhua Wang
YLYong Li
Yong Li
JWJiaqi Wu
Jiaqi Wu
In this paper, we propose a projection-based hybrid spectral gradient algorithm for nonlinear equations with convex constraints, which is based on a certain line search strategy. Convex combination technique is used to design a novel spectral parameter that is inspired by some classical spectral gradient methods. The search direction also meets the sufficient descent condition and trust region feature. The global convergence of the proposed algorithm has been established under reasonable assumptions. The results of the experiment demonstrates the proposed algorithm is both more promising and robust than some similar methods and it is also capable of handling large-scale optimization problems. Furthermore, we apply it to problems involving sparse signal recovery and blurred image restoration. Mathematic Subject Classification: 65K05 65H10 90C30 90C56