نتایج جستجو برای: normalizedsteepest descent
تعداد نتایج: 22332 فیلتر نتایج به سال:
For strongly convex objectives that are smooth, the classical theory of gradient descent ensures linear convergence relative to number evaluations. An analogous nonsmooth is challenging. Even when objective smooth at every iterate, corresponding local models unstable, and cutting planes invoked by traditional remedies difficult bound, leading guarantees sublinear cumulative We instead propose a...
lunar and mars landing is a crucial part of any exploration mission. its importance is manifested by the considerable interest in the past couple of decades. solution of lunar descent can be either numerical or analytical. numerical solutions are iterative and computationally demanding and some of them might not be suitable for on-board implementation. on the other hand, analytical solutions ar...
This paper concerns asynchrony in iterative processes, focusing on gradient descent and tatonnement, a fundamental price dynamic. Gradient descent is an important class of iterative algorithms for minimizing convex functions. Classically, gradient descent has been a sequential and synchronous process, although distributed and asynchronous variants have been studied since the 1980s. Coordinate d...
We describe a simplified categorical approach to Galois descent theory. It is well known that Galois descent is a special case of Grothendieck descent, and that under mild additional conditions the category of Grothendieck descent data coincides with the Eilenberg-Moore category of algebras over a suitable monad. This also suggests using monads directly, and our monadic approach to Galois desce...
Based on an eigenvalue analysis, a new proof for the sufficient descent property of the modified Polak-Ribière-Polyak conjugate gradient method proposed by Yu et al. is presented.
We describe a simplified categorical approach to Galois descent theory. It is well known that Galois descent is a special case of Grothendieck descent, and that under mild additional conditions the category of Grothendieck descent data coincides with the Eilenberg-Moore category of algebras over a suitable monad. This also suggests using monads directly, and our monadic approach to Galois desce...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید