In this paper, we study the unconstrained optimization problems, and the two modified DY conjugate gradient methods (DDY1 method and DDY2 method) are proposed under the DY conjugate gradient method. By using the
In this paper, inexact projected gradient methods for solving smooth constrained vector optimization problems on variable ordered spaces are presented. It is shown that every accumulation point of the generated sequences satisfies the first-order necessary optimality condition. Moreover, under suitable ...
Jiang, X.Z., Jian, J.B.: A sufficient decent Dai–Yuan type nonlinear conjugate gradient method for unconstrained optimization problems. Nonlinear Dyn. 72, 101–112 (2013) CrossRef Dai, Z.F.: Two modified HS type conjugate gradient methods for unconstrained optimization problems. Nolinear An...
Two modified HS type conjugate gradient methods for unconstrained optimization problems Nonliner Anal. (2011) Z.J. Shi et al. A new family of conjugate gradient methods J. Comput. Appl. Math. (2009) Z.J. Shi et al. The convergence of conjugate gradient method with nonmonotone line search ...
Wu, C.Y. The Conjugate Gradient Method for Solving Nonlinear Complementarity Problems; Inner Mongolia University: Hohhot, China, 2012. [Google Scholar] Qi, L.; Sun, D. Nonsmooth and smoothing methods for nonlinear complementarity problems and variational inequalities. Encycl. Optim. 2009, 1, 2671...
By iteratively updating variables using gradient steps and proximal operators, proximal gradient methods can efficiently solve composite optimization problems. For example, Sahu et al. [8] proposed first-order methods such as proximal gradient, which use forward–backward splitting techniques. In addition...
Received 8 August 2015Received in revised form 26 March 2016MSC:90C3090C25Keywords:Unconstrained optimizationConjugate gradient methodLine searchSufficient descent propertyGlobal convergencea b s t r a c tConjugategradientmethodsarehighlyusefulforsolvinglargescaleoptimizationproblemsbecause they do not require ...
Conjugate gradient methods have been widely used as schemes to solve large-scale unconstrained optimization problems. The search directions for the conventional methods are defined by using the gradient of the objective function. This paper proposes two nonlinear conjugate gradient methods which take into...
when applied to general nonlinear functions often the parameter bk is computed using some other formulae which do not satisfy the conjugacy condition.For example,considering as usual,yk=gk+1Àgk, then the well known conjugate gra-dient methods by Fletcher and Reeves [18] (bFR ¼gTþ1gk...
Conjugate Gradient Type Methods for Ill-Posed Problems (Martin Hanke) 最速上升,最速下降和梯度法Steepest Ascent Steepest Descent and Gradient Methods Gradient Descent and Subgradient Methods - KTH:梯度下降法和梯度的方法- k 相关搜索 cross gradient zemax gradient gradient gel gradient diff gradient mome...