Topics / Optimization and Control / Oct 19 - 25, 2026

Weekly issue

Top 20 Optimization and Control Papers: Oct 19 - 25, 2026

Updated · Category: Optimization and Control (arXiv math.OC) · Ranked by potential impact

Prefer new papers every day? It's free.Optimization and Control Daily Papers →
  1. 1
    Training with ML-labeled Data Via Stochastic First- and Zeroth-Order Optimization

    We propose both first-order and zeroth-order stochastic optimization methods for training on datasets consisting of a mix of true-labeled and ML-labeled samples.

  2. 2
    Model Predictive Control of Wind Turbines: A Model-Oriented Review of Prediction Models, Control Objectives, and Nonlinear Aerodynamic Formulations

    Particular attention is given to aerodynamic pitch dependence: variable-pitch turbine dynamics can be non-affine with respect to applied pitch, and the term NMPC alone does not prove that the original nonlinear pitch map is retained inside the optimizer. The review therefore adopts a conservative, equation-based classification for direct nonlinear applied-pitch propagation.

  3. 3
  4. 4
    Anytime-Valid Runtime Monitoring of Learned Barrier Certificates

    We propose an anytime-valid runtime monitor that audits a learned barrier certificate using observed closed-loop trajectories.

  5. 5

Get papers like these the day they come out, not a week later.

Follow this category
  1. 6
    U-Examples: A Unified Family of Worst-Case Instances for Optimization Algorithms

    A common framework treats every algorithm as a rule on a state space with a progress potential, so that one definition of misdirection, and of the resulting blow-up in cost, covers pivoting, descent, interior-point, tree-search, and population methods.

  2. 7
    Adding Heavy-Ball Momentum to Distributed Constrained Optimization for Energy Resource Management Subject to Time-Delays and Quantization

    For a static connected undirected graph and bounded delays, a Lyapunov-Krasovskii analysis establishes practical stability by isolating the discontinuous quantization error as an additive disturbance and closing a computable invariant-sublevel argument.

  3. 8
    Low-Bit Distributed Constrained Optimization with Application to Optimal Scheduling and Allocation

    This paper proposes a distributed resource allocation algorithm in which each agent communicates only the sign of its local cost gradient, a single bit per directed link per iteration.

  4. 9
    Newton-Based Methods for Bilevel Optimization Beyond Lower-Level Strong Convexity

    We develop two Newton-based methods beyond lower-level strong convexity by exploiting curvature shared by the lower-level and multiplier updates.

  5. 10
  6. 11
    Curvature-Scaled Sharpness-Aware Minimization: Convergence Beyond Smoothness

    We then establish a necessary condition for uniform distortion control among perturbations along the gradient whose nonnegative multipliers depend only on its norm. Motivated by this condition, we propose Curvature-Scaled SAM (CS-SAM), which scales both the perturbation and the descent step by suitable curvature upper bounds, and prove that it uniformly bounds the distortion.

  7. 12
    Optimal Dividends and Proactive Capital Injection Over A Finite Horizon

    We study a finite-horizon dividend and capital-injection problem for a Brownian surplus process with time-varying financing costs.

  8. 13
    From Market Signals to Maintenance Decisions: Grid-Informed Maintenance Optimization in Offshore Wind Farms

    We propose to consider additional grid-level information in maintenance operations, such as generation curtailment and market pricing.

  9. 14
    Branch‐and‐Cut POPMUSIC for The Electric Vehicle Routing Problem With Time Windows

    In this study, we develop a POPMUSIC matheuristic to solve the EVRPTW that relies solely on BC (termed BC‐POPMUSIC), and can be implemented using commercial optimisation software such as Gurobi. We introduce new battery infeasibility inequalities, along with capacity cuts, reachability cuts, ‐path cuts and polar cuts, and incorporate them into Gurobi to tighten the linear programming (LP) relaxation of the mixed integer linear program (MILP) model.

  10. 15
    Polar Switch: Fast Muon Orthogonalization with Polynomial Circuits

    In this paper, we introduce Polar Switch, a new approach to polynomial gradient orthogonalization.

  11. 16
    Tight Lower Bounds for Lipschitz Geodesically Convex Optimization on Hyperbolic Space

    We determine the dimension-independent first-order query complexity of minimizing a Lipschitz geodesically convex (g-convex) function on hyperbolic space.

  12. 17
    Variance Reduction with Delayed Feedback for Non-Convex Optimization

    We study variance reduction for non-convex optimization when gradient evaluations return with a delay.

  13. 18
    MARS: Enabling Efficient DNN Mapping for Spatial Accelerators in Ruby Space

    However, state-of-the-art mapping tools predominantly rely on perfect factorization mapping (PFM), which restricts tile sizes to exact divisors of tensor dimensions and may overlook high-quality mappings in the broader design space. To address this limitation, we propose MARS, the first efficient exploration framework designed for Ruby space.

  14. 19
    Exact Value Functions and Sensitivities for Energy Storage By Fast Legendre Transforms

    Long chains of decisions coupled only through a bounded cumulative state, such as the operation of an energy-storage device, form convex programs that generic solvers treat as arbitrary sparse models. We present an exact solver for this class that propagates the complete convex cost-to-reach function through restrictions and infimal convolutions, each evaluated by fast Legendre-Fenchel conjugation as an ordered merge of slopes: no state grid, no value approximation, and a function rather than a single primal-dual pair as output.

  15. 20
    High-Probability Polynomial-Time Complexity of Restarted Primal-Dual Hybrid Gradient Method for Linear Programming

    Despite its impressive practical performance, the theoretical iteration bounds for rPDHG can be exponentially poor. To investigate this gap from a probabilistic perspective, we show that rPDHG achieves polynomial-time complexity in a high-probability sense, under assumptions on the probability distribution from which the data instance is generated.