Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CORR
2008
Springer

favoriteEmaildiscussreport

93views Education» more CORR 2008»

An optimization problem on the sphere

13 years 4 months ago

An optimization problem on the sphere

Download www.andreas-maurer.eu

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 existence and uniqueness result for an optimal algorithm for halfspace learning, when data and target functions are drawn from the uniform distribution.

Andreas Maurer

Real-time Traffic

Average Geodesic Distance | Convex Set | CORR 2008 | Education | Uniqueness |

claim paper

Related Content

» Minimum Enclosing Spheres Formulations for Support Vector Ordinal Regression

» Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subs...

» Active Learning by Spherical Subdivision

» Integer least squares sphere decoding and the LLL algorithm

» Computing the minimum enclosing sphere of freeform hypersurfaces in arbitrary dimensions

» On the construction of lowpass filters on the unit sphere

» New formulations for the Kissing Number Problem

» Robust Mapping of Brain Surface Meshes onto a Unit Sphere

» Two adaptive mutation operators for optima tracking in dynamic optimization problems with ...

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Andreas Maurer

Comments (0)