Adjacency Criterion For Gradient Flow With Multiple Local Maxima
نویسنده
چکیده
In this paper, we investigate the geometry of a general class of gradient flows with multiple local maxima. we decompose the underlying space into disjoint regions of attraction and establish the adjacency criterion. The criterion states a necessary and sufficient condition for two regions of attraction of stable equilibria to be adjacent. We then apply this criterion on a specific type of gradient flow which has as many as n! local maxima. In particular, we characterize the set of equilibria, compute the index of each critical manifold and moreover, find all pairs of adjacent neighbors. As an application of the adjacency criterion, we introduce a stochastic version of the double bracket flow and set up a Markov model to approximate the sample path behavior. The study of this specific prototype with its special structure provides insight into many other difficult problems involving simulated annealing.
منابع مشابه
Topographic Wetness Index Computed Using Multiple Flow Direction Algorithm and Local Maximum Downslope Gradient
Topographic wetness index (TWI) can quantify the control of local topography on hydrological processes and indicate the spatial distribution of soil moisture and surface saturation. The formulation is TWI=ln(a/tanβ), where a is the upslope contributing area per unit contour length and β is the local gradient. Many of the existing flow-direction algorithms for computing a use global partition ex...
متن کاملLocal gradient pattern - A novel feature representation for facial expression recognition
Many researchers adopt Local Binary Pattern for pattern analysis. However, the long histogram created by Local Binary Pattern is not suitable for large-scale facial database. This paper presents a simple facial pattern descriptor for facial expression recognition. Local pattern is computed based on local gradient flow from one side to another side through the center pixel in a 3x3 pixels region...
متن کاملA New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
A new nonlinear conjugate gradient method and an associated implementation, based on an inexact line search, are proposed and analyzed. With exact line search, our method reduces to a nonlinear version of the Hestenes–Stiefel conjugate gradient scheme. For any (inexact) line search, our scheme satisfies the descent condition gT kdk ≤ − 7 8 ‖gk‖. Moreover, a global convergence result is establis...
متن کاملHigh Dynamic Velocity Range Particle Image Velocimetry Using Multiple Pulse Separation Imaging
The dynamic velocity range of particle image velocimetry (PIV) is determined by the maximum and minimum resolvable particle displacement. Various techniques have extended the dynamic range, however flows with a wide velocity range (e.g., impinging jets) still challenge PIV algorithms. A new technique is presented to increase the dynamic velocity range by over an order of magnitude. The multiple...
متن کاملFeedback Capacity over Networks
In this paper, we investigate the fundamental limitations of feedback mechanism in dealing with uncertainties for network systems. The study of maximum capability of feedback control was pioneered in Xie and Guo (2000) for scalar systems with nonparametric nonlinear uncertainty. In a network setting, nodes with unknown and nonlinear dynamics are interconnected through a directed interaction gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1412.6731 شماره
صفحات -
تاریخ انتشار 2014