Pages that link to "Item:Q3647614"

The following pages link to APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING (Q3647614):

Displaying 13 items.

• The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems (Q274096) (← links)
• Geometrical analysis of physically allowed quantum cloning transformations for quantum cryptography (Q508673) (← links)
• Minimal time functions and the smallest intersecting ball problem with unbounded dynamics (Q1937003) (← links)
• On a minimum enclosing ball of a collection of linear subspaces (Q2032259) (← links)
• A dual simplex-type algorithm for the smallest enclosing ball of balls (Q2044498) (← links)
• A branch-and-bound method for the minimum \(k\)-enclosing ball problem (Q2157894) (← links)
• Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls (Q2251551) (← links)
• Solving \(k\)-center problems involving sets based on optimization techniques (Q2301186) (← links)
• The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions (Q2377209) (← links)
• A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality (Q2423797) (← links)
• An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions (Q2630834) (← links)
• A hybrid algorithm for the minimum bounding sphere problem (Q2670492) (← links)
• Averaging Symmetric Positive-Definite Matrices (Q3300555) (← links)