Pages that link to "Item:Q4684830"
From MaRDI portal
The following pages link to Efficient algorithms for discrepancy minimization in convex sets (Q4684830):
Displaying 12 items.
- Semidefinite optimization in discrepancy theory (Q715251) (← links)
- Hierarchical design of fast minimum disagreement algorithms (Q1704562) (← links)
- Gaussian discrepancy: a probabilistic relaxation of vector balancing (Q2081474) (← links)
- Constructive Discrepancy Minimization for Convex Sets (Q2968153) (← links)
- Discrepancy Without Partial Colorings (Q2969622) (← links)
- ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS (Q4596997) (← links)
- An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound (Q4634029) (← links)
- (Q5159430) (← links)
- The discrepancy of random rectangular matrices (Q6074695) (← links)
- Vector balancing in Lebesgue spaces (Q6074880) (← links)
- Discrepancy theory and related algorithms (Q6200209) (← links)
- Searching for (sharp) thresholds in random structures: where are we now? (Q6658193) (← links)