نتایج جستجو برای: gradient

تعداد نتایج: 126426  

Journal: :bulletin of the iranian mathematical society 2014
saman babaie-kafaki

‎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‎.

Journal: :international journal of civil engineering 0
ali pak azadi ave., tehran zahra zahmatkesh azadi ave., tehran

geotextiles are one of the most widely used synthetic materials in filtration and drainage applications. since in real applications, geotextiles are subjected to various hydraulic gradients and confining stresses, hydraulic behavior of geotextiles under different circumstances is of great practical importance. in this study filtration and drainage properties of several nonwoven needle-punched g...

2017
Qiang Liu

Stein variational gradient descent (SVGD) is a deterministic sampling algorithm that iteratively transports a set of particles to approximate given distributions, based on a gradient-based update that guarantees to optimally decrease the KL divergence within a function space. This paper develops the first theoretical analysis on SVGD. We establish that the empirical measures of the SVGD samples...

In this paper we address the issue of recognizing Farsi handwritten words. Two types of gradient features are extracted from a sliding vertical stripe which sweeps across a word image. These are directional and intensity gradient features. The feature vector extracted from each stripe is then coded using the Self Organizing Map (SOM). In this method each word is modeled using the discrete Hidde...

Journal: :SIAM Journal on Optimization 2000
Dimitri P. Bertsekas John N. Tsitsiklis

We consider the gradient method xt+1 = xt + γt(st + wt), where st is a descent direction of a function f : �n → � and wt is a deterministic or stochastic error. We assume that ∇f is Lipschitz continuous, that the stepsize γt diminishes to 0, and that st and wt satisfy standard conditions. We show that either f(xt) → −∞ or f(xt) converges to a finite value and ∇f(xt) → 0 (with probability 1 in t...

Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...

Journal: :Bulletin of the American Mathematical Society 1953

Journal: :The Journal of the Acoustical Society of America 1973

Journal: :journal of ai and data mining 2016
z. imani z. ahmadyfard a. zohrevand

in this paper we address the issue of recognizing farsi handwritten words. two types of gradient features are extracted from a sliding vertical stripe which sweeps across a word image. these are directional and intensity gradient features. the feature vector extracted from each stripe is then coded using the self organizing map (som). in this method each word is modeled using the discrete hidde...

2016
Zhi Zeng Xiaoyan Li Dongsheng Xu Lei Lu Huajian Gao Ting Zhu

Gradient nano-grained (GNG) metals are a unique class of materials with spatial gradients in grain size, typically from the surface to the bulk. Here the gradient mechanical behavior inGNG copper is studied by a crystal plasticity finite elementmodel that accounts for grainsize-dependent yield strengths. The associated finite element simulations reveal both the gradient stress and gradient plas...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید