Topics / Optimization and Control / Oct 12 - 18, 2026

Weekly issue

Top 20 Optimization and Control Papers: Oct 12 - 18, 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
    Restarted Fixed-Point Acceleration of Proximal ADMM for Capped-$\ell_1$ Penalized Optimization

    We consider box-constrained optimization with a convex, Lipschitz continuous loss function that may be nonsmooth and a capped-$\ell_1$ penalty. Exploiting the convex branch representation of the capped-$\ell_1$ penalty, we construct an associated nonexpansive fixed-point mapping for each branch and, based on these mappings, propose a restarted accelerated proximal alternating direction method of multipliers (RA-pADMM).

  2. 2
    The Tilted Sampling Problem: Optimism, Posterior Sampling, and Logarithmic Regret

    Our main contribution is a general regret framework that captures the different uncertainty structure of tilted sampling and classical regret minimization.

  3. 3
    An Adaptive Cubic Regularisation Algorithm Based on Interior-Point Methods for Optimization with General Inequality Constraints

    In this paper, we consider optimization with general inequality constraints and propose an Adaptive Regularisation algorithm using Cubics Based on Interior-Point methods (ARCBIP).

  4. 4
    Stochastic Dual Dynamic Programming for Log-linear Autoregressive Uncertainty in The Right-hand Side

    We consider the generation of cuts in stochastic dual dynamic programming (SDDP) for multistage stochastic linear programming problems with stagewise dependent uncertainty in the right-hand side described by a nonlinear autoregressive process.

  5. 5
    Parameter-Free Adaptive Extragradient Methods for Generalized-Smooth Variational Inequalities

    The $\alpha$-symmetric generalized-smoothness condition allows local operator variation to grow with the operator norm, but existing extragradient methods often require unknown problem-specific constants. To address this issue, we propose PF-AEG, an explicit, line-search-free extragradient method whose stepsizes use quantities generated during the iterations, without prior knowledge of these constants.

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

Follow this category
  1. 6
    Full-Order Safety for Nonlinear Reduced-Order MPC

    We introduce CoRE-MPC, a robust MPC formulation that plans with a nonlinear ROM and guarantees recursive feasibility and constraint satisfaction for the full-order system.

  2. 7
    Asymptotic Risk of Learning-Rate Schedules for Least-Squares Regression with Discretely Distributed Features

    We study the last iterate of stochastic gradient descent (SGD) on streaming least squares with discretely distributed features (Slock's model), which decouples the dynamics across eigendirections.

  3. 8
    Matching Full-Hessian Oracle Complexity for Nonconvex--Strongly-Concave Minimax Optimization

    We characterize the oracle complexity of finding first-order stationary points in smooth nonconvex--strongly-concave (NC--SC) minimax optimization when each query provides the full Hessian in addition to the function value and gradient.

  4. 9
    Versatile Two-layer Model for Thermohydraulic Prediction of Microchannel Heat Sinks

    Overall, the VTLM provides a reduced-dimensional framework for thermohydraulic analysis across the range of microchannel heat-sink configurations examined in this study without explicitly resolving the channel-height direction.

  5. 10
    Balancing Population Demand and Water Stress in Data Centre Siting Under Climate Change: A Spatial Optimisation Study Across England

    This paper develops a spatial optimisation framework that integrates a Water Resilience Index (WRI), combining rainfall, groundwater productivity, and river flow reliability, with a bi-objective integer linear programming (ILP) model that maximises population coverage while minimising aggregate water stress.

  6. 11
    Provably Efficient Risk-Sensitive Offline Reinforcement Learning Via Optimized Certainty Equivalents

    In this work, we investigate efficient offline risk-sensitive RL using the optimized certainty equivalent (OCE), a general class of risk measures.

  7. 12
  8. 13
    Geometry-Aware Multi-Objective Optimization: Norm-Constrained Oracles with Entropic Weight Updates

    We analyze a single-loop multi-objective method combining a norm-constrained linear minimization oracle with entropic updates of task weights.

  9. 14
    Randomized Momentum Transport with Cheap Predictors

    We introduce randomized momentum transport, which evaluates the correction with probability $q$ and otherwise uses a cheap prediction, with importance weighting that preserves the conditional mean and adds $(q^{-1}-1)$ times the prediction loss to the variance.

  10. 15
    Acceleration and Its Limits in Gaussian Variational Inference

    We study whether the classical momentum-based acceleration that improves the condition-number dependence of gradient descent from $\kappa$ to $\sqrt{\kappa}$ for strongly convex, smooth objectives extends to Gaussian variational inference (GVI) for strongly log-concave, log-smooth target distributions.

  11. 16
    A Composite Bayesian Risk--Distributionally Robust Optimization Model for Stochastic Programming with Elliptical Distribution Ambiguity

    To update the posterior distribution of the parameters, a key challenge is that the density of an elliptical distribution depends on the unknown radial distribution, and hence conventional likelihood-based Bayesian inference is infeasible. To overcome this challenge, we propose a novel estimating-equation-based Gibbs inference framework that updates posterior distributions of model parameters solely through estimating equations.

  12. 17
    Long Term Pediatric Vaccine Tender Scheduling with Quantity Discounts

    We extend the Hypothetically Coordinated Vaccine Market (HCVM) framework to schedule multi-year tenders with flexible lengths and all-unit quantity discounts, and compare three objectives: a balanced coordinatingentity model (UG), a social-benefit model that minimizes missed doses (SB), and a producer profit-maximizing model (MP).

  13. 18
  14. 19
    An Alternating Minimization Algorithm for Federated Sparse Orthogonal Nonnegative Matrix Factorization

    In this paper, we develop an alternating minimization algorithm for federated sparse orthogonal nonnegative matrix factorization (ONMF) with emphases on controlling client drift.

  15. 20
    Recursive Gradient Retraction Methods for Stochastic Nonconvex Optimization on Stiefel Manifolds

    We develop {\sf RGR}, a recursive gradient retraction method for stochastic nonconvex optimization on Stiefel manifolds.