Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 31 min ago
PreprintLicence not statedHAL

Relax and Follow: L0-Path Computation with L0-Bregman Relaxations

  • Mhamed Essafri
  • Luca Calatroni
  • Emmanuel Soubies
Open at sourceCite

Related

  1. Fast Relax-and-Round Unit Commitment with Topological Constraints
    Evan J. R. Brody, Charles Foltz, Eve Tsybina +2
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Optimal Control of State Constrained Systems via Measure Relaxations and Polynomial Optimization
    Saroj Prasad Chhatoi, Aneel Tanwani, Didier Henrion
    HALPreprintPublisher termsFull textOptimisation & controlHAL
  3. On The Linear Convergence of Bregman Proximal Gradient Methods with Applications to Kullback--Leibler regression
    Jonathan Chirinos-Rodríguez, Christian Daniele, Cédric Févotte +1
    HALPreprintLicence not statedOptimisation & controlHAL
  4. A greedy double-block nonlinear Bregman-Kaczmarz method for nonlinear equations
    Wendi Bao, Jing Li, Lili Xing +1
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  5. Graph Matching Relaxations and Amortization for Supervised Graph Prediction
    Federico Méndez, Paul Krzakala, Gabriel Melo +3
    arXivPreprintCC BY 4.0Full textStatisticsarXiv

Cite

BibTeXRIS
BibTeX
@misc{essafri2026relax,
  title = {{Relax and Follow: L0-Path Computation with L0-Bregman Relaxations}},
  author = {Mhamed Essafri and Luca Calatroni and Emmanuel Soubies},
  howpublished = {HAL},
  year = {2026},
  month = jun,
  eprint = {2606.02176},
  archivePrefix = {arXiv},
  url = {https://hal.science/hal-05732667v1},
}
RIS
TY  - UNPB
TI  - Relax and Follow: L0-Path Computation with L0-Bregman Relaxations
AU  - Mhamed Essafri
AU  - Luca Calatroni
AU  - Emmanuel Soubies
PY  - 2026
DA  - 2026/06/01
PB  - HAL
UR  - https://hal.science/hal-05732667v1
ER  -