math.OC · 2026-06-30 · No. 39

Optimization and Control, 2026-06-30.

2 new papers in math.OC. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

2 entries
  1. 01

    Local-Minima-Preserving Continuous Relaxation of Ising Problems

    Debraj Banerjee, Santanu Mahapatra, Kunal N. Chaudhury

    math.OC · cs.LG · physics.comp-ph

    The generalized Ising problem captures a broad spectrum of hard combinatorial problems, including MAX-CUT, Number Partitioning (NPP), and Maximum Independent Set. In this work, we consider the notion of one-flip local minima for this problem. We construct a polynomial relaxation and prove the landscape equivalence theorem: there exists a one-to-one correspondence between the local minima of the relaxation and the one-flip minima of the...

    arxiv.org/abs/2606.30333 · PDF

  2. 02

    A Distributionally Robust Framework for Learned Reconstructions in Inverse Problems

    Floor van Maarschalkerwaart, Subhadip Mukherjee, Christoph Brune, Marcello Carioni

    math.OC · cs.LG

    Learned reconstruction operators for inverse problems are typically trained under a fixed noise model, and generalize poorly when the distribution during testing differs from the one assumed during training. Distributionally robust optimization (DRO) addresses this by optimizing against the worst-case distribution within a prescribed ambiguity set, but standard Wasserstein DRO perturbs the full joint distribution uniformly, which can be...

    arxiv.org/abs/2606.30230 · PDF

This edition is part of The Daily Abstract — math.OC archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.