Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 45 min ago
PreprintPublisher termsHAL

Finding Simple Proofs for First-Order Optimization

  • Daniel Berg Thomsen
  • Manu Upadhyaya
  • Baptiste Goujaud
  • Aymeric Dieuleveut
  • Adrien Taylor
Open at sourcePDFCite

Related

  1. Finding Stationary Points under Higher-Order Smoothness: Trapping Algorithms and First-Order Lower Bounds
    Huanjian Zhou, Masashi Sugiyama, Taiji Suzuki
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  2. Breaking the Odd Cycle: Regularization and First-Order Optimization for the Maximum s-Plex Problem
    Eleonora Bellesso, Immanuel M. Bomze, Francesco Rinaldi
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  3. First-order approximations of multifunctions defined implicitly by "split" feasibility problems with applications to optimization
    Amos Uderzo
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  4. Discrete eigenvalue optimization from entropic smoothing and first-order methods
    Deborah Hendrych, Mathieu Besançon, Sebastian Pokutta
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  5. Sharp First-Order Lower Bounds for Higher-Order Smooth Nonconvex Optimization
    Dongruo Zhou
    arXivPreprintCC BY-SA 4.0Full textOptimisation & controlarXiv

Cite

BibTeXRIS
BibTeX
@misc{thomsen2026finding,
  title = {{Finding Simple Proofs for First-Order Optimization}},
  author = {Daniel Berg Thomsen and Manu Upadhyaya and Baptiste Goujaud and Aymeric Dieuleveut and Adrien Taylor},
  howpublished = {HAL},
  year = {2026},
  month = jul,
  eprint = {2607.08753},
  archivePrefix = {arXiv},
  url = {https://hal.science/hal-05741115v1},
}
RIS
TY  - UNPB
TI  - Finding Simple Proofs for First-Order Optimization
AU  - Daniel Berg Thomsen
AU  - Manu Upadhyaya
AU  - Baptiste Goujaud
AU  - Aymeric Dieuleveut
AU  - Adrien Taylor
PY  - 2026
DA  - 2026/07/09
PB  - HAL
UR  - https://hal.science/hal-05741115v1
ER  -