Maximizing determinants under partition constraints
From MaRDI portal
Recommendations
- Subdeterminant maximization via nonconvex relaxations and anti-concentration
- Determinant Maximization with Linear Matrix Inequality Constraints
- Real stable polynomials and matroids: optimization and counting
- Randomized rounding for the largest simplex problem
- On the complexity of constrained determinantal point processes
Cited in
(17)- Some constrained partitioning problems and majorization
- A generalization of permanent inequalities and applications in counting and optimization
- Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids
- Near-optimal discrete optimization for experimental design: a regret minimization approach
- Subdeterminant maximization via nonconvex relaxations and anti-concentration
- Approximation algorithms for \(D\)-optimal design
- Determinant Maximization with Linear Matrix Inequality Constraints
- Nash social welfare, matrix permanent, and stable polynomials
- Spectral analysis of matrix scaling and operator scaling
- On the complexity of constrained determinantal point processes
- Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes
- Proportional volume sampling and approximation algorithms for \(A\)-optimal design
- A Local Search Framework for Experimental Design
- scientific article; zbMATH DE number 7758358 (Why is no real title available?)
- On the parameterized intractability of determinant maximization
- Optimal experimental design: formulations and computations
- Fast algorithms for maximizing the minimum eigenvalue in fixed dimension
This page was built for publication: Maximizing determinants under partition constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361829)
