CG_DESCENT is a state-of-the-art algorithm to solve large-scale unconstrained
minimization problems. However, research activities on CG_DESCENT in some other …

A limited conjugate gradient method is proposed to improve the robustness and efficiency of
the first-order reliability method (FORM). A new search direction vector is developed for …

In this paper, a self-adjust conjugate gradient method is proposed for solving unconstrained
problems, which can generate sufficient descent directions at each iteration. Different from …

We consider a new hybrid conjugate gradient algorithm, which is obtained from the
algorithm of Fletcher-Reeves, and the algorithm of Polak-Ribière-Polyak. Numerical …

Nonlinear conjugate gradient method is very popular in solving large-scale unconstrained
minimization problems due to its simple iterative form and lower storage requirement. In the …

We propose a modified projected Polak–Ribière–Polyak (PRP) conjugate gradient method,
where a modified conjugacy condition and a method which generates sufficient descent …

提出了一种新的给水管网水力计算方法. 该方法对给水管网系统的节点流量连续性方程进行重新
构造, 用改进的cholesky 分解方法对重新构造的矩阵进行三角分解, 然后使用预处理共轭梯度法 …

对于无约束优化问题, 本文对搜索方向进行调整, 提出了一类混合HS-PRP 共轭梯度法,
该方法在每步迭代中都能不依赖于任何搜索而自行产生充分下降方向. 在精确搜索下 …

For solving large-scale unconstrained minimization problems, the nonlinear conjugate
gradient method is welcome due to its simplicity, low storage, efficiency and nice …

Cette thèse est centrée autour de l'utilisation de la structure partiellement séparable pour
l'optimisation sans contraintes, notamment pour les méthodes quasi-Newton et …