نتایج جستجو برای: sufficient descent condition
تعداد نتایج: 490700 فیلتر نتایج به سال:
In this paper, by linearly combining the numerator and denominator terms of Dai-Liao (DL) Bamigbola-Ali-Nwaeze (BAN) conjugate gradient methods (CGMs), a general form DL-BAN method has been proposed. From form, new hybrid CGM, which was found to possess sufficient descent property is generated. Numerical experiment carried out on CGM in comparison with four existing CGMs, using some set large s...
In this paper, a new hybrid conjugate gradient algorithm is proposed for solving unconstrained optimization problems. This new method can generate sufficient descent directions unrelated to any line search. Moreover, the global convergence of the proposed method is proved under the Wolfe line search. Numerical experiments are also presented to show the efficiency of the proposed algorithm, espe...
In this paper, a new nonlinear conjugate gradient method is proposed for large-scale unconstrained optimization. The sufficient descent property holds without any line searches. We use some steplength technique which ensures the Zoutendijk condition to be held, this method is proved to be globally convergent. Finally, we improve it, and do further analysis.
A linear transformation on a finite-dimensional complex linear space has the property that all of its invariant subspaces are hyperinvariant if and only if its lattice of invariant subspaces is distributive [1]. It is shown that an operator on a complex Hilbert space has this property if its lattice of invariant subspaces satisfies a certain distributivity condition. 1. Preliminaries. Throughou...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید