Applied Math · Mathematics & Statistics
Optimization & Control
The newest papers in Optimization & Control that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
754 papers, from 31 August 2026 to 5 November 2026: 698 arXiv preprints and 56 OpenAlex records.
Get the few papers worth your time in Optimization & Control every morning.
Follow Optimization & Control and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 3
The Staged Pandora's Box: Reservation Indices for Multi-Fidelity Bayesian Optimization
A staged search must decide which candidate to advance next and when to stop.Equivalent Graphical Conditions for Angle Rigidity and Angle-Based Network Localization
Angle rigidity theory provides a theoretical basis for characterizing the geometric shape of graphs embedded in the plane under angle constraints, and establishing global convergence of angle-based…Offline Approximate Value Iteration: A Reinforcement Learning Approach for Satellite Constellation Deployment
This paper introduces a reinforcement learning-based approximate dynamic programming approach to optimize the deployment of Walker-type satellite constellations under uncertainties, including launch…When Is Tracking Affordable? A Movement-Budget Feasibility Threshold for Dynamic Regret
Dynamic regret measures an online learner against a moving comparator, and standard analyses assume the learner may move freely at every round.Efficient Detailed Scheduling of Multiproduct Pipelines using Action-Decoupled Deep Reinforcement Learning
Multiproduct pipelines transport refined products to delivery stations in sequential batches, and their detailed scheduling must meet market demand while respecting nonlinear hydraulic constraints.Finite-horizon Optimal Consumption and Investment with Costly Income Adjustment
We study optimal consumption and investment for an investor who receives labor income until a fixed retirement date, can raise the income rate irreversibly at a constant price per unit of income…Diagonal Equivalence in State Space Models: Characterization, Retrieval Rank, and Selective Extensions
We classify real and complex state-space models (SSMs) with linear transitions, distinguishing fixed-basis diagonal equivalence from input-output equivalence and tracking coefficient-conditioning…On a Class of Non-Local Elliptic-Transport Systems in Score-Guided Probability Flow on $SE(3)$: Score-Singularity Resolution, Space-Time ADN Shift, and Markov Mean-Field Games
We establish mathematical foundations for optimal spatiotemporal vector fields governing continuous score-guided probability flows over bounded submanifolds $M \subset SE(3)$ on the Special…A Bayesian Framework for Safe Optimal Control of Unknown Systems from Input-Output Data
As control engineering is applied to increasingly complex systems, learning-based control, which uses empirical data to reduce the reliance on first-principles models, has emerged as a promising…Tilted Convexity and an Exact Offline-Online Separation
Convexity has three equivalent descriptions: support by affine functions, monotonicity of the subdifferential, and increasing secant slopes.Delay-Certified Readiness Barriers for Overactuated Multirotor Allocation Without Lipschitz Constants
Overactuated multirotors can produce the same wrench with many rotor-speed combinations, some of which leave the vehicle unable to change its wrench quickly, e.g., to reject a gust.ParaDeAl: Parallel Descent Algorithms for Sparse Statistics
Best subset selection is a central problem in statistical regression, drawing increasing attention from the broader optimization and machine learning communities.Online Matching with Arbitrary Stochastic Rewards
Online matching with stochastic rewards is a generalization of online bipartite matching in which an attempt to match an online arrival to an offline resource may fail with some probability.Benign population landscapes do not transfer to empirical risk minimization in nonsmooth optimization
Benign landscapes provide a geometric explanation for the success of iterative methods on nonconvex problems arising in data science.Three-phase time minimization transportation problem with non-idle phases: a polynomial two-witness algorithm
The three-phase time minimization transportation problem partitions the origin-terminal links into three sets used in consecutive phases and minimizes the sum of the phase shipment times.Dual Path Following for an Aerial Manipulator Under State and Input Constraints via Transverse Feedback Linearization
This paper studies dual path following for a quadrotor carrying a three-degree-of-freedom arm.Learning Gradients of Homogeneous Functions
Homogeneous gradient functions have widespread significance, including applications in maximum energy subspace selection and retrieval problems.Smoothed analysis of stability radii for the assignment problem
Every linear program can tolerate small changes to its costs and still yield a solution of the original problem.Convex Regression at Scale: Geometry-Preserving Constraint Sparsification
Convex regression provides a flexible nonparametric estimation framework while incorporating appropriate shape information.Optimization Frameworks & Learning Algorithms for Discrete-Time Mean Field Games
This monograph introduces discrete-time mean field games with finite state and action spaces, emphasizing optimization formulations and learning algorithms.