ویراساینس.
سند علمی

A Conjugate Gradient Method for Unconstrained Optimization Problems

Gonglin Yuan

چکیده

A hybrid method combining the FR conjugate gradient method and the WYL conjugate gradient method is proposed for unconstrained optimization problems. The presented method possesses the sufficient descent property under the strong Wolfe-Powell SWP line search rule relaxing the parameter σ < 1. Under the suitable conditions, the global convergence with the SWP line search rule and the weak Wolfe-Powell WWP line search rule is established for nonconvex function. Numerical results show that this method is better than the FR method and the WYL method.

اسناد مشابه

  • A hybrid conjugate gradient method for optimization problems

    سند علمی۲۰۱۴Xiangrong Li, Xupei Zhao

    A hybrid method of the Polak-Ribière-Polyak (PRP) method and the Wei-Yao-Liu (WYL) method is proposed for unconstrained optimization problems, which possesses the following properties: i) This method inherits an important property of the well known PRP method: the tendency to tur

  • A hybrid conjugate gradient method for optimization problems

    مقاله‌ی دسترسی آزاد۲۰۱۱Natural ScienceXiangrongLi, XupeiZhao

  • The conjugate gradient method for optimal control problems with bounded control variables

    سند علمی۱۹۶۸AutomaticaBernard Pagurek, C. Murray Woodside

    Absfract-This paper extends the conjugate gradient minimization method of Fletcher and Reeves to optimal control problems. The technique is directly applicable only to unconstrained problems; if terminal conditions and inequality constraints are present, the problem must be conve

  • Preconditioned Conjugate Gradient Method for Optimal Control Problems with Control and State Constraints

    سند علمی۲۰۱۰SIAM J. Matrix Analysis ApplicationsRoland Herzog, Ekkehard W. Sachs

    Optimality systems and their linearizations arising in optimal control of partial differential equations with pointwise control and (regularized) state constraints are considered. The preconditioned conjugate gradient (pcg) method in a non-standard inner product is employed for t

  • A New Formula for Conjugate Gradient in Unconstrained Optimization

    مقاله‌ی دسترسی آزاد۲۰۲۲Ma?alla? Tikr?t li-l-?ul?m al-?irfa?['Isam H. Hali', 'Khalil K. Abbo', 'Hassan H. Ebrahim', '']

    The method of Conjugate Gradient (CG) is a key component optimization methods that aren't bound by local convergence characteristics. In this study, we created KHI3, novel search direction in the Algorithm. approach satisfies regression criterion. overall proposed technique has a

  • New scaled algorithm for non-linear conjugate gradients in unconstrained optimization

    مقاله‌ی دسترسی آزاد۲۰۲۱Indonesian Journal of Electrical Engineering and Computer Science['Ghada M. Al-Naemi', 'Ahmed Hussien Sheekoo', '']

    &lt;p&gt;A new scaled conjugate gradient (SCG) method is proposed throughout this paper, the SCG technique may be a special important generalization (CG) method, and it an efficient numerical for solving nonlinear large scale unconstrained optimization. As result, we with strong