math.OC Mathematics

Optimization and Control papers on arXiv

Track optimization methods and mathematical control in math.OC. Search by problem structure or guarantee to distinguish theoretical results from application-driven optimization papers.

1,970 papers indexed

Follow the whole category with the official math.OC RSS feed, or use a personal filter to select keywords and authors. See the arXiv RSS feed guide for setup and the category guide for primary and cross-listed subjects.

Filter ideas for Optimization & Control

How filters work

Combine the problem class with a desired property such as convergence or stability. Avoid requiring a particular algorithm name if you also want new methods for the same problem.

  • Convex optimization

    Add convergence, duality, or a constraint type to follow a narrower theoretical question.

    Category math.OC + abstract contains “convex”
    Try filter
  • Optimal control

    Pair the phrase with a system class or numerical method when the initial results are broad.

    Category math.OC + abstract contains “optimal control”
    Try filter

Examples are starting points. Preview them before saving; keyword matches do not assess a paper’s quality. Recent papers below use the primary category; saved category filters also match cross-listed categories.

Recent Optimization and Control papers

5 recent papers
  • Apoorva Narula, Santanu S. Dey

    Abstract

    Slope change detection seeks to identify changes in the trends of time-ordered signals. We study the problem of fitting a multidimensional time series by continuous piecewise-linear functions with a shared continuous breakpoint and unrestricted slopes. We consider both the dense setting, in which every dimension may change slope, and the sparse setting, in which at most kk dimensions may change slope. Although the resulting optimization problems are nonconvex mixed integer nonlinear programs and may have irrational optimal solutions even for rational data, we prove that all six variants, corresponding to the ℓ1\ell_1, ℓ2\ell_2, and ℓ∞\ell_\infty losses in both settings, are exactly solvable in polynomial time. For least-squares loss, we obtain efficient algorithms requiring O(JT)O(JT) operations in the dense setting and O(J2Tlog⁡J)O(J^2T\log J) operations in the sparse setting, where TT is the number of time points and JJ is the number of dimensions. We implement these least-squares algorithms and evaluate them on simulated data and three real-world time series, namely, surface temperatures (ERA5), hand-tracking data from a mixed-reality headset (HoloAssist), and turbofan engine sensor data (NASA C-MAPSS). The dense algorithm solves instances with up to J=105J=10^5 and T=100T=100, that is, 10710^7 observations, in less than 0.10.1 seconds on a laptop, while the sparse algorithm solves instances with about 10310^3 dimensions and up to T=240T=240 in under a second. Compared with a mixed-integer nonlinear programming (MINLP) formulation solved by Gurobi, our algorithms are several orders of magnitude faster (approximately 8.9×1038.9 \times 10^3 to 3.4×1063.4 \times 10^6 times) on instances where Gurobi terminates within its default optimality tolerance of 0.01%0.01\% optimality gap. On larger instances, Gurobi frequently reaches a 10,000-second time limit with substantial optimality gaps.

  • Shuo Sun, Rajan Udwani

    Abstract

    We study the joint optimization of assortment and inventory when products are identically priced and the total demand (number of customers) is uncertain. A seller chooses initial inventories before customers arrive and every customer buys her preferred product among those still in stock according to a choice model known to the seller. The objective is to maximize the (expected) total sales, subject to a capacity constraint. We give a (1−1/e)2(1-1/e)^2-approximation under any ranking-based choice model and a (1−1/e−ε)(1-1/e-\varepsilon)-approximation under the Markov chain choice model, where ε\varepsilon is a tunable parameter that trades off runtime with approximation guarantee. Our guarantees hold for arbitrary demand distributions and do not require the ubiquitous Increasing Failure Rate (IFR) assumption. In fact, our results also improve on the state-of-the-art approximations for IFR demand distributions. Key to our results is the discovery of hidden submodularity in these problems and the development of efficient procedures to evaluate (or approximate) the objective values. Specifically, we uncover a novel connection to online bipartite matching (for ranking-based models) and use stochastic coupling arguments (for the Markov chain choice model) to reduce the problems to instances of constrained submodular maximization. This opens the door to applying the vast algorithmic machinery for submodular maximization to our problem setting, leading, for example, to natural generalizations beyond cardinality constraint where no approximation results were previously known.

  • An Aloysius Wang, Kostas Margellos, Mark Cannon

    Abstract

    Neural-network approximations of nonlinear model predictive control can reduce online computational costs, but ensuring constraint satisfaction and closed-loop stability remains challenging. We propose a framework in which convex optimisation is used to restore feasibility under suitable local assumptions, while bounds on the corrected controller's cost suboptimality provide sufficient conditions for practical closed-loop stability. To assess these conditions over a compact set of initial states, we investigate a branch-and-bound approach based on convex relaxations of the nonlinear dynamics, with probabilistic guarantees established through scenario optimisation. The proposed approach represents a step towards combining the computational efficiency of approximate nonlinear model predictive control with systematic methods for restoring feasibility and assessing stability.

  • Michael Cummins, Matteo Santamaria, Brendan O'Donoghue

    Abstract

    We introduce a canonical central path for the homogeneous embedding of quadratic cone programs, defined by strongly monotone equations whose modulus is the barrier parameter. We prove that the path exists uniquely, is smooth, and lies on a sphere of fixed radius. Under mild regularity assumptions, its limit points recover optimal solutions or certificates of infeasibility. Exploiting the fact that the embedding operator has a closed-form resolvent, we derive Josephy-Newton steps that retain the nonlinear embedding equations and linearize only the complementarity conditions. Each step reduces to quasi-definite linear system solves and a scalar quadratic. Using this, we derive a new predictor-corrector interior-point method with a surrogate formulation that allows the predictor and corrector to share a single sparse factorization. We provide an open-source implementation, cpo3, for linear and quadratic programs. On 675 instances from eight benchmark collections, with presolve and crossover disabled, cpo3 achieves the highest verified solve count (631) and the lowest penalized shifted geometric mean runtime among the tested open-source and commercial solvers. It is the only tested solver to solve all 138 Maros-Meszaros instances to high accuracy. Moreover, we establish Euclidean and local-norm error bounds that motivate a warm-start heuristic for the proposed algorithm, yielding up to 2.3x median runtime speedup over cold starts on perturbed Netlib and Maros-Meszaros problems.

  • Masataka Nakamura, Kaito Ito, Hideaki Ishii

    Abstract

    This paper addresses the problem of online switching control for discrete-time nonlinear systems where a controller is sequentially selected from a finite set of candidates. The goal is to generate an adaptive sequence of controllers to minimize the cumulative cost under unknown disturbances and cost functions. Specifically, we consider a full-information feedback setting where realized disturbance effects and cost functions are available after each selection. Using counterfactual costs computed from historical data, we reduce the online switching control problem to the experts problem with switching costs. Then, we propose an adaptive switching algorithm based on the Hedge algorithm with a switching suppression mechanism. Notably, the proposed algorithm achieves an expected regret of O(Tlog⁡N)O(\sqrt{T\log N}), where TT is the time horizon and NN is the number of candidate controllers, while ensuring uniform boundedness of the state. This matches the optimal regret order for the standard experts problem.

Frequently asked questions

How do I get alerts for new Optimization and Control papers on arXiv?

Create a filter for the math.OC category — add keywords or authors to narrow it further if you like. Matching papers are delivered to a personal RSS feed, and optionally by immediate, daily, or weekly email digest.

Where does this Optimization and Control paper data come from?

Paper metadata comes directly from arXiv through its official OAI-PMH feed, checked roughly every 15 minutes for new submissions in math.OC and every other arXiv category.