A coordinated effort to formalize the mathematics of operations research in Lean 4.
Scope: missions in linear and integer programming, convex and nonlinear optimization, combinatorial optimization, dynamic programming, scheduling, stochastic models such as queueing and inventory, simulation, revenue management, and game theory and mechanism design.
A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality: The Inexact Primal–Dual Forward–Backward–Forward Iterates Converge Weakly to a Primal and a Dual SolutionResearch Paper
Many problems in convex optimization, variational inequalities, mechanics, traffic equilibrium and signal processing reduce to finding a zero of a monotone operator on a Hilbert space. Frequently that operator is a sum A+L∗∘B∘L of a monotone operator and a monotone operator composed with a linear map and its adjoint, and one also wants the…
Solving Semidefinite-Quadratic-Linear Programs Using SDPT3: The HKM and NT Search Directions of Second-Order Cone Programming Are Invariant Under Automorphic ScalingResearch Paper
Second-order cone programming (SOCP) minimizes a linear function over the intersection of an affine subspace with a product of Lorentz cones. It contains convex quadratically constrained programs, robust linear programs with ellipsoidal uncertainty, and many norm-minimization problems, and it is solved in practice by primal–dual interior-point methods. At…
Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems: Error √2ΘL/(αN) After N StepsResearch Paper
Monotone variational inequalities (v.i.) cover convex minimization, convex–concave saddle-point problems, Nash equilibria of convex games and complementarity problems. Matrix games and other large saddle-point problems are typical cases. At large scale, first-order methods that use only values of the operator and simple auxiliary minimizations are the…
Centralized and Competitive Inventory Models with Demand Substitution 2: At Least One Product Is Stocked No Less Under Competition Than Under Centralized ManagementResearch Paper
A retailer that carries several substitutable products, such as brands of the same item, loses part of a customer's demand when the preferred product is out of stock, but not all of it: some customers buy another product instead. How much of each product to stock then depends on the stocking levels of the others. When all products are managed by one…
On the Sample Complexity of Reinforcement Learning III: Non-Stationary Approximate Policy Iteration Is Within 2T Times the Regression Error Averaged over Any Competitor's State-Time DistributionTextbook
Approximate dynamic programming replaces the exact value functions of a Markov decision process by approximations, typically produced by a regression algorithm. The classical guarantees for the resulting policies are stated in the max norm: if every state-action value is estimated to within ε uniformly over the state space, the greedy policy loses…
Linearly Parameterized Bandits 2: Under Smooth Best Arm Response, the Phased Exploration and Greedy Exploitation Policy Has Regret at Most a₁(‖z‖ + 1/‖z‖)r√TResearch Paper
In a linearly parameterized bandit, a decision maker repeatedly chooses an arm from a possibly infinite set of vectors and receives a noisy reward whose mean is linear in an unknown parameter. Classical bandit policies treat arms as independent and must try each arm, so their regret grows with the number of arms (Lai and Robbins 1985); in applications such…
Robust Regression and Lasso 4: ‖b − Ax‖₂ + √n c‖x‖₁ + √n c Equals the Worst Case of √(n·E_μ[(b′ − r′ᵀx)²]) over Box-Constrained Distribution ClassesResearch Paper
The Lasso fits a linear model to data (b,A) by penalizing the ℓ1 norm of the coefficient vector. Xu, Caramanis and Mannor (arXiv:0811.1790) showed that ℓ1-regularized regression is exactly a robust regression problem: it minimizes the worst-case residual when every feature column may be disturbed within a norm ball. That reading explains Lasso…
Robust Regression and Lasso 2: When an Absolute Norm Bounds the Column Disturbance Norms, Robust Regression Is Regression Regularized by the Dual Norm, ‖b − Ax‖ₐ + l‖x‖*ₛResearch Paper
Robust regression guards a linear model against errors in the data matrix. The observations b∈Rn are fitted by Ax, but the features (the columns a1,…,am of A) are only known up to a disturbance ΔA from an uncertainty setU. The robust estimator minimizes the worst-case residual,
Reliable Facility Location Design Under the Risk of Disruptions 4: The Fixed-Probability Reformulation (RRSP) Lower-Bounds the Relaxed SubproblemResearch Paper
Facility networks fail: plants close after floods, distribution centres lose power, suppliers go bankrupt. The reliable uncapacitated facility location problem (RUFL) of Cui, Ouyang and Shen (UCTC-FR-2010-02, February 2010; published as Operations Research 58(4), 2010, doi:10.1287/opre.1090.0801) chooses which facilities to open and, for every customer, an…
Distributionally Robust Optimization and Its Tractable Approximations 2: Under a Mean Set and a Known Covariance, the Bound π² Equals the Worst-Case Expected Positive PartResearch Paper
Many operations models contain terms of the form EP((r0+r′ζ~)+): expected shortfall or overflow of an affine function of an uncertain vector. Inventory and newsvendor costs, penalties for violated soft constraints, and the Conditional Value-at-Risk of a linear decision rule all reduce to it. In practice the distribution …
On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs 3: For Finite Polyhedral Problems the SAA Optimal Set Fails to Be a Face Exponentially RarelyResearch Paper
Stochastic programs of the form minx∈ΘEPh(x,ω) are rarely solvable exactly, because the expectation is an integral over a large or continuous scenario space. The standard remedy is sample average approximation (SAA), also called the Monte Carlo or sample path method: draw an i.i.d. sample ω1,…,ωN from P and…
Convex Quadratic and Semidefinite Programming Relaxations in Scheduling III: Optimal Nonpreemptive Schedules Are Within 3 of Preemptive Ones for R | rᵢⱼ | Σ wⱼCⱼ, Within 2 Without Release DatesResearch Paper
In machine scheduling, preemption means that a job may be interrupted and resumed later, possibly on a different machine. Allowing it can only lower the optimal cost, and a basic question for every scheduling model is how much it can lower it: the ratio between the best nonpreemptive and the best preemptive schedule, often called the power of preemption.…
How Bad is Selfish Routing? 4: With Polynomial Latencies of Degree p and Nonnegative Coefficients the Cost of a Nash Flow Is at Most p + 1 Times the Optimal CostResearch Paper
In a road or communication network carrying a large population of users, each user picks a route that is fastest for itself given the congestion caused by everyone else. The resulting traffic pattern, a Wardrop or Nash equilibrium, need not minimize the total travel time: Braess's paradox shows that adding a road can make every user slower. Transportation…
Semidefinite Programming Relaxations for Semialgebraic Problems 2: A Feasible Solution of the SDPs (7.7) Certifies That M Is Copositive, and the Test Is at Least as Strong as M = P + NResearch Paper
A real symmetric matrix is copositive when its quadratic form is nonnegative on the nonnegative orthant. Copositive matrices appear wherever a quadratic objective meets sign constraints: standard quadratic programs over the simplex, linear complementarity problems, and conic reformulations of combinatorial problems such as the stability number of a graph.…
The Primal-Dual Active Set Strategy as a Semismooth Newton Method II: Global Convergence and Monotonicity for M-MatricesResearch Paper
Obstacle problems, contact problems and box-constrained quadratic programs share one finite-dimensional core: the linear complementarity problem "find y≤ψ and λ≥0 with Ay+λ=f and λi(yi−ψi)=0". After discretization by finite differences or piecewise linear finite elements, the matrix A is typically an M-matrix,…
On Implementing a Primal-Dual Interior-Point Method for Conic Quadratic Optimization II: Points of a Product of Quadratic and Rotated Cones Are Complementary Iff Their Arrow-Head Products VanishResearch Paper
Conic quadratic optimization (also called second-order cone programming) minimizes a linear function over the intersection of an affine subspace with a product of quadratic cones. It contains linear programming, convex quadratically constrained programming, robust linear programming with ellipsoidal uncertainty and many problems from engineering design; see…
On the Sample Complexity of Reinforcement Learning V: Exact Conservative Policy Iteration Improves at Every Update and Halts within 8H²/ε² Updates with Future Advantages at Most ε/HTextbook
Policy iteration replaces the current policy by the greedy policy with respect to its state-action values. With exact values this improves the policy at every state. When the improvement step is only approximate, or is restricted to a class of policies, a greedy replacement can make the policy worse, and the resulting error bounds are stated in max norm…
On Implementing a Primal-Dual Interior-Point Method for Conic Quadratic Optimization I: Solutions of the Homogeneous Model Are Complementary and Give an Optimal Pair or an Infeasibility CertificateResearch Paper
Conic optimization minimizes a linear function over the intersection of an affine subspace with a closed convex cone. Linear programming (the nonnegative orthant), second-order cone programming (products of quadratic cones) and semidefinite programming (the positive semidefinite cone) are all instances. Primal–dual interior-point methods are the standard…
Ising Models on Locally Tree-Like Graphs 2: With a Positive Field, Belief Propagation Converges Exponentially Fast from Every Positive Initial ConditionResearch Paper
Belief propagation (BP) is the message-passing algorithm used throughout artificial intelligence, coding theory and statistical physics to approximate marginals of graphical models. On graphs with cycles it is a heuristic: it may fail to converge, and when it converges its output need not be the true marginal. Rigorous guarantees had mostly been confined to…
Inventory Management of a Fast-Fashion Retail Network 2: The Tangent-Envelope Approximation of Expected Sales Is an Upper BoundResearch Paper
Zara ships inventory from a central warehouse to each of its stores every week, and for a short-lived fashion item the warehouse holds a limited amount of each size. Deciding how many units of each size to ship to each store is therefore a constrained allocation problem whose objective is the expected sales a store will realize from a given inventory. Caro…
Distributionally Robust Optimization and Its Tractable Approximations 1: Under a Support Set and a Mean Set, the Bound π¹ Equals the Worst-Case Expected Positive PartResearch Paper
Linear decision rules are a standard device for making multistage optimization under uncertainty computationally tractable: a recourse decision is restricted to be an affine function of the uncertain data observed so far. Their weakness is that a recourse variable that must stay nonnegative forces the rule to be very conservative. Goh and Sim, Distributional…
Convex Quadratic and Semidefinite Programming Relaxations in Scheduling II: Randomized Rounding of the Time-Slot Convex Quadratic Relaxation (CQP) Is Within 2 for R | rᵢⱼ | Σ wⱼCⱼResearch Paper
Scheduling jobs on unrelated parallel machines to minimize the total weighted completion time is a basic model of machine scheduling: each job may take a different time on each machine, and a job becomes available on a machine only at a machine-dependent release date. In the three-field notation the problem is R∣rij∣∑wjCj. Already the…
The Price of Anarchy is Independent of the Network Topology: For a Standard Latency Class Containing the Constants, Two-Link Networks Attain the Worst Nash/Optimal Cost Ratio α(L)Research Paper
In a road or communication network where each unit of traffic picks its own route, the outcome is a Nash flow (Wardrop equilibrium): no traffic can lower its own latency by switching paths. It is well known since Pigou (1920) that such selfish routing can be inefficient: the total latency of a Nash flow may exceed that of the best centrally planned flow.…
Solving Project Scheduling Problems by Minimum Cut Computations: Finite-Capacity n-Cuts Are Exactly the Feasible Schedules, and a Minimum a-b-Cut Has the Optimal CostResearch Paper
Time-indexed formulations are a standard way to model scheduling problems as integer programs: a binary variable xjt records whether job j starts at time t. They were introduced by Pritsker, Watters and Wolfe (1969) and give strong linear relaxations, at the price of many variables. In project scheduling, jobs are linked by time lags: a lag (i,j) of…
Designing a Call Center with Impatient Customers III: Square-Root Staffing Is Equivalent to a Nondegenerate Delay Probability and to Abandonment of Order 1/√NResearch Paper
A telephone call center must decide how many agents N to staff against an offered load R=λ/μ (arrival rate over service rate). Staff too few and callers wait and hang up; staff too many and agents sit idle. For large centers the industry rule of thumb is square-root safety staffing, N≈R+βR, and the question is what service level…