Pages that link to "Item:Q4739662"

The following pages link to On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid (Q4739662):

Displaying 10 items.

• The ellipsoid algorithm using parallel cuts (Q1315450) (← links)
• Using two successive subgradients in the ellipsoid method for nonlinear programming (Q1337226) (← links)
• On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
• The ellipsoid method and its implications (Q1835842) (← links)
• On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (Q2381536) (← links)
• The Fast Cauchy Transform and Faster Robust Linear Regression (Q2812147) (← links)
• A class of rank-two ellipsoid algorithms for convex programming (Q3325476) (← links)
• Variable metric relaxation methods, part II: The ellipsoid method (Q3683896) (← links)
• Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies (Q5200559) (← links)
• Some results on centers of polytopes (Q5312753) (← links)