(home)   //   (publications)   //   (blog)   //   (scans from the library)

A Simple Method for Convex Optimization in the Oracle Model

PDF

arXiv

BibTeX

@article{simple,
  doi = {10.1007/s10107-023-02005-8},
  year = {2023},
  archivePrefix={arXiv},
  eprint={2011.08557},
  month = aug,
  publisher = {Springer Science and Business Media {LLC}},
  author = {Daniel Dadush and Christopher Hojny and Sophie Huiberts and Stefan Weltge},
  title = {A simple method for convex optimization in the oracle model},
  journal = {Mathematical Programming},
  note={preliminary version in IPCO 2022}
}

A nearly optimal randomized algorithm for explorable heap selection (Oct 2022)
 Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev.
 IPCO 2023, Mathematical Programming / arXiv / talk / bibTeX
On the Integrality Gap of Binary Integer Programs with Gaussian Data (Dec 2020)
 Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari.
 IPCO 2021, Mathematical Programming / arXiv / bibTeX