Algorithms for the spatial median
Özet
The spatial median can be defined as the unique minimum of a strictly convex objective function. Hence, its computation through an iterative algorithm ought to be straightforward. The simplest algorithm is the steepest descent Weiszfeld algorithm, as modified by Ostresh and by Vardi and Zhang. Another natural algorithm is Newton-Raphson. Unfortunately, all these algorithms can have problems near data points; indeed, Newton-Raphson can converge to a nonoptimal data point, even if a line search is included! However, by combining these algorithms, a reliable and efficient “hybrid” algorithm can be developed
Kaynak
Modern Nonparametric, Robust and Multivariate Methods: Festschrift in Honour of Hannu OjaKoleksiyonlar
İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
Conversion of rate based flow control algorithms to window based algorithms
Yelbasi, O; İftar, Altuğ (IEEE, 2004)The conversion of rate based flow control algorithms used in high-speed data communication networks to window (credit) based algorithms is considered. A rate based robust flow controller, designed using the H-infinity ... -
Comparison of Shape Optimization Techniques Coupled with Genetic Algorithm for a Wind Turbine Airfoil
Orman, Erkan; Durmus, Gökhan (IEEE, 2016)Airfoil optimization is an important subject for wind turbines in order to increase the flow efficiency along the blade sections. The first important subject for airfoil shape optimization is the mathematical description ... -
Circular Traffic Sign Recognition empowered by Circle Detection Algorithm
Gündüz, Hüseyin; Kaplan, Selcan; Günal, Serkan; Akınlar, Cüneyt (IEEE, 2013)Automatic traffic sign detection and recognition is one of the most important components of advanced driver assistance systems. In this paper, a novel method utilizing histograms of oriented gradients based features together ...