Pages that link to "Item:Q1864187"
From MaRDI portal
The following pages link to Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\) (Q1864187):
Displaying 11 items.
- Nearly optimal minimax estimator for high-dimensional sparse linear regression (Q385791) (← links)
- Efficient subspace approximation algorithms (Q664540) (← links)
- Deciding uniqueness in norm maximazation (Q687086) (← links)
- Computational complexity of norm-maximization (Q757258) (← links)
- Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope (Q845815) (← links)
- Complexity results for some global optimization problems (Q1024247) (← links)
- Constrained clustering via diagrams: a unified theory and its application to electoral district design (Q1695008) (← links)
- Some easy and some not so easy geometric optimization problems (Q1757753) (← links)
- Estimating \(L^\infty\) norms by \(L^{2k}\) norms for functions on orbits. (Q1865825) (← links)
- Fixed-parameter complexity and approximability of norm maximization (Q2340407) (← links)
- SHARPENING GEOMETRIC INEQUALITIES USING COMPUTABLE SYMMETRY MEASURES (Q3195358) (← links)
