math.OC · 2026-07-27 · No. 66

Optimization and Control, 2026-07-27.

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

    Explicit Iteration Complexity of Exact Data-Driven Inverse Optimization for Integer Linear Programs

    Akira Kitaoka

    math.OC · cs.AI · cs.LG · stat.ML

    A data-driven inverse optimization problem (DDIOP) is the problem of estimating the objective-function parameters (weights) that explain observed optimal-solution data, and it arises in many applications, including integer linear programming (ILP). It is known that, by applying gradient-based optimization methods to the suboptimality loss, the inverse optimization of ILPs can be solved exactly within finitely many oracle iterations, and that...

    arxiv.org/abs/2607.22263 · PDF

  2. 02

    Barzilai-Borwein Fails Superlinear Convergence on an Open Set of Quadratics for Every Dimension $n\geq 4$

    Dawei Li, Xiaotian Jiang, Mingyi Hong

    math.OC · cs.AI · cs.LG

    Barzilai--Borwein (BB) method has shown strong practical performance in continuous optimization, yet its convergence dynamics remains poorly understood. In particular, a central unresolved question is whether BB converges superlinearly for almost every strictly convex quadratic problem and initialization. We provide a negative answer to this question. Specifically, for every finite dimension $n\geq4$, we construct a nonempty open, hence...

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