Sciweavers

207 search results - page 8 / 42
» Convexity of the Proximal Average
Sort
View
CORR
2008
Springer
93views Education» more  CORR 2008»
13 years 7 months ago
An optimization problem on the sphere
We prove existence and uniqueness of the minimizer for the average geodesic distance to the points of a geodesically convex set on the sphere. This implies a corresponding existen...
Andreas Maurer
JPDC
2007
84views more  JPDC 2007»
13 years 7 months ago
Distributed average consensus with least-mean-square deviation
We consider a stochastic model for distributed average consensus, which arises in applications such as load balancing for parallel processors, distributed coordination of mobile a...
Lin Xiao, Stephen P. Boyd, Seung-Jean Kim
SIAMJO
2010
127views more  SIAMJO 2010»
13 years 2 months ago
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning
We consider a recently proposed optimization formulation of multi-task learning based on trace norm regularized least squares. While this problem may be formulated as a semidefini...
Ting Kei Pong, Paul Tseng, Shuiwang Ji, Jieping Ye
SIAMMA
2010
90views more  SIAMMA 2010»
13 years 2 months ago
A General Proximity Analysis of Nonlinear Subdivision Schemes
In recent work nonlinear subdivision schemes which operate on manifold-valued data have been successfully analyzed with the aid of so-called proximity conditions bounding the diffe...
Philipp Grohs
CCCG
2006
13 years 9 months ago
An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
Asish Mukhopadhyay, Robert L. Scot Drysdale