Pages that link to "Item:Q3395020"

The following pages link to Two Algorithms for the Minimum Enclosing Ball Problem (Q3395020):

Displaying 25 items.

• The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems (Q274096) (← links)
• On the hardness of the consensus string problem (Q396596) (← links)
• A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training (Q508681) (← links)
• On approximating the Riemannian 1-center (Q714906) (← links)
• Two-string consensus problem under non-overlapping inversion and transposition distance (Q1679911) (← 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)
• Uncertainty quantification of the 4th kind; optimal posterior accuracy-uncertainty tradeoff with the minimum enclosing ball (Q2088318) (← links)
• A branch-and-bound method for the minimum \(k\)-enclosing ball problem (Q2157894) (← links)
• Frank-Wolfe and friends: a journey into projection-free first-order optimization methods (Q2240671) (← links)
• Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem (Q2301135) (← links)
• Solving \(k\)-center problems involving sets based on optimization techniques (Q2301186) (← links)
• Fast algorithms for the minimum volume estimator (Q2349524) (← links)
• Polynomial time approximation schemes for all 1-center problems on metric rational set similarities (Q2663710) (← links)
• A reformulation-linearization based algorithm for the smallest enclosing circle problem (Q2666744) (← links)
• On the elimination of inessential points in the smallest enclosing ball problem (Q4622883) (← links)
• (Q4633010) (← links)
• Chebyshev centres, Jung constants, and their applications (Q5220255) (← links)
• Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries (Q5883715) (← links)
• A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (Q5919060) (← links)
• A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach (Q5963815) (← links)
• Minimizing the size of the uncertainty regions for centers of moving entities (Q6547939) (← links)
• Approximating fair \(k\)-min-sum-radii in Euclidean space (Q6574937) (← links)
• PolyCD: optimization via cycling through the vertices of a polytope (Q6633143) (← links)
• The MDM algorithm and the Sylvester problem (Q6634590) (← links)