Pages that link to "Item:Q2883636"
From MaRDI portal
The following pages link to Submodularity and randomized rounding techniques for optimal experimental design (Q2883636):
Displaying 14 items.
- Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming (Q629098) (← links)
- Ascent with quadratic assistance for the construction of exact experimental designs (Q782649) (← links)
- Competitive online algorithms for resource allocation over the positive semidefinite cone (Q1650777) (← links)
- Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs (Q1759885) (← links)
- A branch-and-bound algorithm for the exact optimal experimental design problem (Q2058883) (← links)
- Multidimensional sum-up rounding for integer programming in optimal experimental design (Q2220654) (← links)
- Near-optimal discrete optimization for experimental design: a regret minimization approach (Q2227544) (← links)
- Una caracterizacion de diseños de experimentos optimos por subgradientes (Q3357389) (← links)
- Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback (Q3386400) (← links)
- Approximation Algorithms for <i>D</i>-optimal Design (Q3387934) (← links)
- Randomized Parallel Algorithm for Maximizing Nonsubmodular Function Subject to Cardinality Constraint (Q5024901) (← links)
- Gaussian Process Landmarking on Manifolds (Q5025781) (← links)
- Parallelized maximization of nonsubmodular function subject to a cardinality constraint (Q5918257) (← links)
- Parallelized maximization of nonsubmodular function subject to a cardinality constraint (Q5925506) (← links)
