Pages that link to "Item:Q2369067"

The following pages link to An efficient algorithm for the smallest enclosing ball problem in high dimensions (Q2369067):

Displaying 12 items.

• Fitting enclosing cylinders to data in \(\mathbb R^n\) (Q861741) (← links)
• A smoothing trust-region Newton-CG method for minimax problem (Q928081) (← links)
• Efficient algorithms for the smallest enclosing ball problem (Q1774576) (← 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)
• Complexity and approximation of the smallest \(k\)-enclosing ball problem (Q2346580) (← links)
• An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions (Q2630834) (← 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)
• Probabilistic smallest enclosing ball in high dimensions via subgradient sampling (Q5088979) (← links)
• (Q5688513) (← links)
• Algorithms - ESA 2003 (Q5897282) (← links)