Gradient algorithm of Geoffrion can solve problems related to linear and non-linear optimizations, provided that decision maker can determine its utility function out of “n” existent goals. However, this diagnosis of utility function doesn’t need...

Minimizing two different upper bounds of the matrix w hich generates search directions of the nonlinear

conjugate gradient method proposed by Dai and Liao, two modified conjugate gradient methods are pro-posed. Under ...

Following Andrei’s approach, a modified scaled memoryless BFGS preconditioned conjugate gradient method is proposed based on the modified secant equation suggested by Li and Fukushima. It is shown that the method is globally ...

Based on an eigenvalue study, a descent class of Dai–Liao conjugate gradient methods is proposed. An interesting feature of the proposed class is its inclusion of the efficient nonlinear conjugate gradient methods proposed ...

Based on the insight gained from the three-term conjugate gradient methods suggested by Zhang et al. (Optim Methods Softw 22:697–711,2007) two nonlinear conjugate gradient methods are proposed, making modifications on the ...

Abstract: The analysis of flow in water-distribution networks with several pumps by the Content Model may be turned into a non-convex optimization uncertain problem with multiple solutions. Newton-based methods such as GGA ...

In order to take advantage of the attractive features of the Hestenes–Stiefel

and Dai–Yuan conjugate gradient (CG) methods, we suggest two

hybridizations of these methods based on Andrei’s approach of ...