Daily Update: optimization news
- Limited-memory first-order methods, a Douglas–Rachford generalisation, and a new Reinhardt proof 2026-11-17
- Muon under shuffling, a Polyak-Łojasiewicz retrospective, and a polynomial-time result for slope change 2026-11-16
- Benders for power flows, bilevel cuts and decision-diagram intersection cuts 2026-11-14
- Integer programming theory has a busy Friday, and solvers move into practice 2026-11-13
- Decision-dependent demand, restricted transport sets and reshuffled minibatches 2026-11-12
- Heavy-ball momentum gets a sharp constant, and Wolfe's method inherits simplex's worst cases 2026-11-10
- ADMM's step-size limit, ReLU networks that attain their minimum, and a BCC lattice proof 2026-11-09
- A quiet Sunday: no new papers, and a look at GPU routing in practice 2026-11-08
- Retrospective approximation meets interior points, and a conditional look at network games 2026-11-07
- Newton steps speed up LCPs, random reshuffling gets a proof, and Nesterov's Gauss Prize gets a survey 2026-11-06
- Newton steps for complementarity problems, a Gauss Prize survey, and new results on shuffling SGD 2026-11-05
- Tight bounds and a sharper barrier: theory sets the pace while solvers go first-order 2026-11-04
- A quiet tape: no new papers, and the practice news is mostly vendor claims 2026-11-03
- GPU first-order methods spread to feasibility pumps, and BFGS loses a convergence bound 2026-11-02
- Stepsizes, curvature reuse and regret: a quiet Sunday for first-order theory 2026-11-01
Try ProvenDecisions free: type, photograph or say an optimization problem; every answer is checked by a solver.