Pages that link to "Item:Q689144"
From MaRDI portal
The following pages link to A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio (Q689144):
Displaying 11 items.
- Exact primitives for smallest enclosing ellipses (Q293400) (← links)
- Minimum-volume enclosing ellipsoids and core sets (Q813369) (← links)
- Provably fast training algorithms for support vector machines (Q927401) (← links)
- Some randomized algorithms for convex quadratic programming (Q1282154) (← links)
- Enumerating a subset of the integer points inside a Minkowski sum (Q1602946) (← links)
- Random sampling with removal (Q2207595) (← links)
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (Q2381536) (← links)
- The geometry of differential privacy: the small database and approximate cases (Q2805515) (← links)
- A Randomized Algorithm to Optimize Over Certain Convex Sets (Q4864870) (← links)
- On Solving Large-Scale Polynomial Convex Problems by Randomized First-Order Algorithms (Q5252231) (← links)
- Rounding of convex sets and efficient gradient methods for linear programming problems (Q5459820) (← links)
