Majorizing measures for the optimizer

DOI10.4230/LIPICS.ITCS.2021.73MaRDI QIDQ7229362zbMATH OpenFDO

Authors Daniel Dadush, Neil Olver, Makrand Sinha

Publication date 15 April 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2021.73

zbMATH Keywords

convex optimizationdimensionality reductionGaussian processesgeneric chainingmajorizing measures

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A simple proof of the majorizing measure theorem
• A theorem on majorizing measures
• An improved cutting plane method for convex optimization, convex-concave games, and its applications
• Cover times, blanket times, and majorizing measures
• scientific article; zbMATH DE number 4061904 (Why is no real title available?)
• scientific article; zbMATH DE number 49190 (Why is no real title available?)
• scientific article; zbMATH DE number 3518027 (Why is no real title available?)
• scientific article; zbMATH DE number 1975226 (Why is no real title available?)
• Isometric sketching of any set via the restricted isometry property
• Majorizing measures without measures
• Majorizing measures: The generic chaining
• Regularity of Gaussian processes
• Sample boundedness of stochastic processes under increment conditions
• The majorizing measure approach to sample boundedness
• The sizes of compact subsets of Hilbert space and continuity of Gaussian processes
• Theory of principal partitions revisited
• Ultrametric skeletons

This page was built for publication: Majorizing measures for the optimizer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229362)