Pages that link to "Item:Q3437021"
From MaRDI portal
The following pages link to The geometry of logconcave functions and sampling algorithms (Q3437021):
Displaying 20 items.
- Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation (Q5116548) (← links)
- A simplified proof of CLT for convex bodies (Q5146559) (← links)
- (Q5148946) (← links)
- Approximate Spectral Gaps for Markov Chain Mixing Times in High Dimensions (Q5154639) (← links)
- (Q5214293) (← links)
- (Q5219717) (← links)
- Convex set of quantum states with positive partial transpose analysed by hit and run algorithm (Q5347997) (← links)
- On the integrality gap of binary integer programs with Gaussian data (Q5925655) (← links)
- Tyler's and Maronna's M-estimators: non-asymptotic concentration results (Q6097559) (← links)
- Finite sample complexity of sequential Monte Carlo estimators on multimodal target distributions (Q6126801) (← links)
- John’s walk (Q6159393) (← links)
- Convergence of Gibbs sampling: coordinate hit-and-run mixes fast (Q6174808) (← links)
- Finite-sample complexity of sequential Monte Carlo estimators (Q6177328) (← links)
- Minimizing convex functions with rational minimizers (Q6567265) (← links)
- Limit distribution theory for smooth \(p\)-Wasserstein distances (Q6590462) (← links)
- Rapid convergence of the unadjusted Langevin algorithm: isoperimetry suffices (Q6608556) (← links)
- Integrating products of quadratic forms (Q6624169) (← links)
- A quick estimate for the volume of a polyhedron (Q6635461) (← links)
- Statistical inference with regularized optimal transport (Q6663353) (← links)
- Robust lower bounds on monopoly profit with \(\alpha\)-concave demand (Q6665065) (← links)
