math.OC · 2026-11-11 · No. 170

Optimization and Control, 2026-11-11.

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

01 — The papers

4 entries
  1. 01

    Two Communities, One Problem: Branch-and-Bound vs. A* for Resource-Constrained Project Scheduling

    Izack Cohen, Dominik Kress, Lara Nehrke, Erwin Pesch, Shimrit Shtern

    math.OC · cs.AI

    Branch-and-Bound (B&B) and $A^*$ are popular exact search methods originating from Operations Research and Artificial Intelligence, respectively. Although the two methods share fundamental search principles, their different ways of exploring the search space can lead to substantially different computational performance. We investigate these differences using the Resource-Constrained Project Scheduling Problem (RCPSP) as an exemplary problem...

    arxiv.org/abs/2611.14426 · PDF

  2. 02

    On Federated Averaging with Partial Participation under a General Variance Condition

    Ziming Wang, Kun Huang, Karl Henrik Johansson, Shi Pu

    math.OC · cs.DC · cs.LG

    In this paper, we study the convergence of Federated Averaging (FedAvg) with partial participation under a general variance condition. In each communication round, the server samples $S$ of the $n$ clients uniformly at random without replacement. The stochastic gradients are assumed to satisfy the so-called ABC condition, which allows their variance to grow with the local objective gaps. For smooth nonconvex objectives, we establish a...

    arxiv.org/abs/2611.14239 · PDF

  3. 03

    Dual-Space Preconditioning for Variational Inequalities and Root-Finding Problems

    Jan Quan, Konstantinos Oikonomidis, Alexander Bodard, Panagiotis Patrinos

    math.OC · cs.LG

    This paper develops a dual-space preconditioning framework for variational inequalities and root-finding problems beyond classical cocoercivity and Lipschitz continuity assumptions. To this end, we introduce both a novel cocoercivity-type condition and a relaxed Lipschitz continuity condition, and derive convergence of deterministic and stochastic methods under these generalized conditions. For isotropic preconditioners, the resulting...

    arxiv.org/abs/2611.13916 · PDF

  4. 04

    Optimal Last-Iterate Bounds for Nonexpansive Stochastic Approximation

    Ramanan Tamizholi, Siddharth Chandak, Rahul Singh

    math.OC · cs.LG · eess.SY

    We establish last-iterate mean-square residual bounds for nonexpansive stochastic approximation (SA), or stochastic Krasnoselskii-Mann (KM) iterations. In particular, we consider fixed-point mappings that are nonexpansive with respect to the Euclidean norm, and focus on polynomially decaying stepsizes. We study three conditions on the conditional second moment of the noise, and obtain bounds that are optimal up to logarithmic factors in each...

    arxiv.org/abs/2611.13846 · 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.