Abstract
To solve the monotone equations with convex constraints, a novel multiparameterized conjugate gradient method (MPCGM) is designed and analyzed. This kind of conjugate gradient method is derivative-free and can be viewed as a modified version of the famous Fletcher–Reeves (FR) conjugate gradient method. Under approximate conditions, we show that the proposed method has global convergence property. Furthermore, we generalize the MPCGM to solve unconstrained optimization problem and offer another novel conjugate gradient method (NCGM), which satisfies the sufficient descent property without any line search. Global convergence of the NCGM is also proved. Finally, we report some numerical results to show the efficiency of two novel methods. Specifically, their practical applications in compressive sensing and motion control of robot manipulator are also investigated.
Funding Information
  • National Natural Science Foundation of China (11671228, 11601475, ZR2016AL05)
  • Government of Shandong Province (11671228, 11601475, ZR2016AL05)
  • Government of Shandong Province (11671228, 11601475, ZR2016AL05)
  • Government of Shandong Province (11671228, 11601475, ZR2016AL05)
  • Zaozhuang University (11671228, 11601475, ZR2016AL05)

This publication has 33 references indexed in Scilit: