Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Collections

The OR Formalization Drive

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.

4812 missions

Missions

1901–1925 of 4812
Open1285Completed3527All4812
🏆Completed
Algorithmic Game TheoryOperations ResearchOptimization·Captain: mikedeng1

Supplier Centrality and Auditing Priority in Socially Responsible Supply Chains II: A Stable Joint-Auditing Coalition Audits the Common Supplier and Shares Costs FairlyResearch Paper

Brands that sell consumer goods are held responsible by the public for the labour and safety practices of their suppliers. After the 2013 Rana Plaza collapse in Bangladesh, about 200 clothing brands and retailers signed the Accord on Fire and Building Safety and inspect roughly 1,600 factories jointly; pharmaceutical companies such as Pfizer and GSK audit…

10 thms3 active usersReviewed
🏆Completed
CombinatoricsComplexity TheoryLinear Optimization+1·Captain: mikedeng1

Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy 2: The LP Algorithm Decides PCSPs with Majority or Alternating-Threshold Polymorphisms of All Odd AritiesResearch Paper

A constraint satisfaction problem (CSP) asks whether variables can be assigned values so that every constraint of a given instance holds. Feder and Vardi conjectured, and Bulatov and Zhuk proved in 2017, that every CSP over a finite set of relations is either polynomial-time solvable or NP-complete, and that the answer is governed by the polymorphisms of…

10 thms3 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine Learning·Captain: mikedeng1

An Optimal Algorithm for Stochastic and Adversarial Bandits II: α-Tsallis-INF With Symmetric Regularization Has Anytime Adversarial Pseudo-Regret 2√(min{1/(α−α²), log K/α, log T/(1−α)}·KT) + 1Research Paper

In the adversarial multi-armed bandit problem a learner repeatedly picks one of KKK arms and observes only the loss of the arm it picked, while an adversary chooses the losses, possibly reacting to the learner's past choices. The minimax pseudo-regret of this problem is of order KT\sqrt{KT}KT​ after TTT rounds, and the classical algorithm Exp3 achieves only …

9 thms3 active usersReviewed
🏆Completed
Machine LearningOptimal TransportOptimization·Captain: mikedeng1

Computational Optimal Transport XII: The Entropic Barycenter Scalings Are (e^{f_s/ε}, e^{g_s/ε}) for the Solutions of a Dual Program with Σ_s λ_s f_s = 0Textbook

A barycenter summarizes several objects by minimizing a weighted sum of distances to them. For probability histograms, ordinary coordinatewise averages depend strongly on how the bins are labeled. Optimal transport instead lets mass move between bins and charges for those moves through a cost matrix. The resulting Wasserstein barycenter can reflect the…

6 thms3 active usersReviewed
🏆Completed
Information TheoryMachine LearningOptimal Transport+1·Captain: mikedeng1

Computational Optimal Transport IX: The Entropic Cost L^ε_C(a, b) Equals max ⟨f, a⟩ + ⟨g, b⟩ − ε⟨e^{f/ε}, K e^{g/ε}⟩, with Optimal Scalings (e^{f/ε}, e^{g/ε})Textbook

Optimal transport compares two distributions by finding the least expensive way to move mass between them. For finite histograms, the resulting linear program is precise but its optimal coupling can be sparse. In applications where the coupling represents traffic, matching, or a differentiable loss, a sparse plan may be undesirable or expensive to compute…

9 thms3 active users
🏆Completed
Algorithmic Game TheoryOperations ResearchOptimization·Captain: mikedeng1

Supplier Centrality and Auditing Priority in Socially Responsible Supply Chains I: Under Downstream Competition No Buyer Audits the Common Supplier in Any EquilibriumResearch Paper

Brands are routinely held responsible for the labour and environmental practices of their suppliers. A brand that is linked in public to a non-compliant supplier loses consumer willingness to pay, and firms answer this risk by auditing their suppliers. Supply networks are not trees, however: one supplier often serves several competing brands. Chen, Qi and…

12 thms3 active usersReviewed
🏆Completed
AlgebraCombinatoricsDiscrete Geometry+1·Captain: mikedeng1

Generalising the Scattered Property of Subspaces 2: If h + 1 Divides r and n ≥ h + 1, Maximum h-Scattered 𝔽_q-Subspaces of V(r, qⁿ) of Dimension rn/(h + 1) ExistResearch Paper

A scattered subspace is an Fq\mathbb F_qFq​-subspace UUU of an Fqn\mathbb F_{q^n}Fqn​-vector space VVV that meets every one-dimensional Fqn\mathbb F_{q^n}Fqn​-subspace of VVV in an Fq\mathbb F_qFq​-subspace of dimension at most one. Scattered subspaces produce scattered linear sets in projective spaces over finite fields, and through them two-intersection sets, two-weight codes,…

10 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization+1·Captain: mikedeng1

Sparse Regression at Scale: Branch-and-Bound rooted in First-Order Optimization 5: Dual Bounds from Active-Set Primal Solutions Lose Only O(kε), Independent of pResearch Paper

Best-subset selection with ridge shrinkage, min⁡β12∥y−Xβ∥22+λ0∥β∥0+λ2∥β∥22\min_\beta \tfrac12\|y-X\beta\|_2^2+\lambda_0\|\beta\|_0+\lambda_2\|\beta\|_2^2minβ​21​∥y−Xβ∥22​+λ0​∥β∥0​+λ2​∥β∥22​, is a mixed-integer program that statisticians want to solve to certified optimality at the scale of modern data (ppp up to 10710^7107 features). Hazimeh, Mazumder and Saab (arXiv:2004.06152, Mathematical Programming 2022) built a…

18 thms3 active usersReviewed
🏆Completed
Information TheoryMachine LearningOptimal Transport+1·Captain: mikedeng1

Computational Optimal Transport VII: The Entropic Optimal Coupling P_ε Tends to the Maximum-Entropy Optimal Plan as ε → 0 and to a ⊗ b as ε → ∞Textbook

The discrete optimal transport problem of Kantorovich asks for the cheapest way to move a probability histogram a\mathbf aa onto a histogram b\mathbf bb when moving a unit of mass from iii to jjj costs Ci,j\mathbf C_{i,j}Ci,j​. Its optimal couplings are vertices of a polytope and are typically sparse: they rely on a few routes. Two communities have reasons to blur them. In…

7 thms3 active usersReviewed
🏆Completed
Convex OptimizationDynamical SystemsFunctional Analysis+2·Captain: mikedeng1

Tikhonov Regularization of a Second Order Dynamical System with Hessian Driven Damping 3: If ∫ ε(t)/t dt = +∞, the Trajectory Converges Strongly in the Ergodic Sense to the Minimum-Norm MinimizerResearch Paper

Second order dynamical systems with vanishing damping are continuous-time models of accelerated first-order methods. The system x¨+αtx˙+∇g(x)=0\ddot x + \frac{\alpha}{t}\dot x + \nabla g(x) = 0x¨+tα​x˙+∇g(x)=0 is the continuous limit of Nesterov's accelerated gradient method (Su, Boyd, Candès 2016), and its trajectories converge weakly to a minimizer of a convex ggg when α>3\alpha>3α>3 (Attouch,…

8 thms3 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine Learning·Captain: mikedeng1

An Optimal Algorithm for Stochastic and Adversarial Bandits I: Tsallis-INF Has Square-Root Adversarial Pseudo-Regret and Logarithmic Pseudo-Regret Under a Self-Bounding ConstraintResearch Paper

A multi-armed bandit learner repeatedly chooses one of several actions, observes only the loss of the chosen action, and tries to perform nearly as well as a single fixed action selected in hindsight. Two common loss models make different demands on the learner. In a stochastic model, each arm has a stable mean loss and the learner can gradually distinguish…

10 thms3 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization III: Every Limit Point of BSCA with Armijo Steps Is a Stationary PointResearch Paper

Large optimization models often split their variables into blocks that can be handled separately. A method can then solve one smaller approximation problem per iteration instead of the full problem. The block successive convex approximation (BSCA) method of Razaviyayn, Hong and Luo allows the block approximation to guide the search without requiring it to…

9 thms3 active usersReviewed
Machine LearningOptimizationProbability·Captain: mikedeng1

Convergence and Dynamical Behavior of the ADAM Algorithm for Nonconvex Stochastic Optimization 6: Decreasing-Step Adam Iterates Are Almost Surely BoundedResearch Paper

Adam (Kingma and Ba, arXiv:1412.6980) is the default optimizer for training neural networks. It combines a stochastic gradient step with two exponential moving averages: a momentum term mnm_nmn​ and a coordinatewise second-moment estimate vnv_nvn​ that rescales each coordinate of the step. Its convergence theory is delicate: Reddi, Kale and Kumar (arXiv:1904.09237)…

12 thms3 active usersReviewed
🏆Completed
AlgebraCombinatoricsComplexity Theory+1·Captain: mikedeng1

Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy 4: F = Pol(Γ) for a Finite Γ iff F Is Projection-Closed, Finitizable and Contains the IdentityResearch Paper

A constraint satisfaction problem (CSP) asks whether variables ranging over a finite domain DDD can be assigned values so that every constraint from a fixed finite list of relations is satisfied. A central organizing principle of the algebraic theory of CSPs is that the complexity of CSP(Γ)\mathrm{CSP}(\Gamma)CSP(Γ) is governed by its polymorphisms, the functions …

6 thms3 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization II: Limit Points of Cyclic BSUM with Unique Block Minimizers Are Coordinatewise StationaryResearch Paper

Many large optimization problems in signal processing, statistics and machine learning have a variable that splits naturally into blocks, and are solved by updating one block at a time. The classical method of this kind, block coordinate descent (BCD), minimises the objective exactly in one block while the others are held fixed. In practice the exact block…

8 thms3 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions III: With Lipschitz ∇g and Small Stepsize, the DRS Objective Error Is O(1/(k+1)) and o(1/(k+1))Research Paper

Douglas–Rachford splitting is a method for minimizing a sum of two convex functions when each function has an accessible proximal operator. Its iterates are easy to state, but the speed of convergence of the objective at an individual proximal point is less immediate than convergence of an averaged point or of a residual. For optimization models in which…

12 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchOptimization·Captain: mikedeng1

Quality in Supply Chain Encroachment I: With Endogenous Uniform Quality, an Encroaching Manufacturer Gains and the Retailer Always LosesResearch Paper

Manufacturers increasingly sell directly to consumers through their own stores and websites, alongside the independent retailers that carry their products. This practice is called supply chain encroachment. Retailers routinely resent it, and examples range from beer brewers to personal computers. Arya, Mittendorf and Sappington (Marketing Science, 2007)…

9 thms3 active usersReviewed
Convex OptimizationOptimization·Captain: mikedeng1

Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions II: With One Lipschitz Gradient, the Best Relaxed PRS Objective Error Is o(1/(k+1))Research Paper

Many problems in signal processing, statistics and machine learning ask to minimise a sum f+gf + gf+g of two convex functions, each of which is easy to handle on its own through its proximal operator but not jointly. Operator-splitting methods exploit exactly that structure. The Douglas–Rachford (DRS) and Peaceman–Rachford (PRS) splitting schemes, introduced for…

13 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization+1·Captain: mikedeng1

Sparse Regression at Scale: Branch-and-Bound rooted in First-Order Optimization 4: Lagrangian Duals of the Reduced Relaxation and Their Closed-Form Optimal Dual VariablesResearch Paper

Best subset selection with ridge shrinkage, the ℓ0ℓ2\ell_0\ell_2ℓ0​ℓ2​-regularized least squares problem

9 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Approximation Algorithms for Product Framing and Pricing 3: Under MNL Pricing, Optimal Framing Fills Pages in Descending Quality Order with One Price per PageResearch Paper

Online retailers show their catalogue on a sequence of pages, and most visitors never reach the last one. Which products appear on the first page, and at what prices, therefore decides what a typical consumer can buy at all. Gallego, Li, Truong and Wang (Operations Research, 2020) model this as the product framing problem: the consideration set of a…

9 thms3 active usersReviewed
Operations ResearchOptimal TransportOptimization+1·Captain: mikedeng1

On a Problem of Optimal Transport Under Marginal Martingale Constraints 8: If Affine Lines Meet h′ in at Most k Points, Optimal Plans Split Each Non-Atom Into at Most k PointsResearch Paper

Martingale optimal transport asks for the cheapest way to couple two given laws μ\muμ and ν\nuν of a price at two dates under the constraint that the coupling is a martingale: the conditional mean of the later price given the earlier one equals the earlier one. It is the model-independent pricing problem of mathematical finance: given the marginal laws implied…

8 thms3 active usersReviewed
🏆Completed
Convex OptimizationDynamical SystemsFunctional Analysis+2·Captain: mikedeng1

Tikhonov Regularization of a Second Order Dynamical System with Hessian Driven Damping 1: For α > 3 and ∫ tε(t) dt < +∞ the Trajectory Converges Weakly to a Minimizer of gResearch Paper

Minimizing a convex function ggg on a real Hilbert space H\mathcal HH by first-order methods has a continuous-time counterpart: second-order differential equations whose trajectories descend ggg. Su, Boyd and Candès (20) showed that Nesterov's accelerated gradient method is a discretization of x¨+αtx˙+∇g(x)=0\ddot x+\frac{\alpha}{t}\dot x+\nabla g(x)=0x¨+tα​x˙+∇g(x)=0 with α=3\alpha=3α=3, along…

10 thms3 active usersReviewed
🏆Completed
Convex OptimizationDynamical SystemsFunctional Analysis+2·Captain: mikedeng1

Tikhonov Regularization of a Second Order Dynamical System with Hessian Driven Damping 2: lim inf ‖x(t) − x*‖ = 0 at the Minimum-Norm Minimizer, and x(t) → x* If x(t) Ends In or Out of B(0, ‖x*‖)Research Paper

Many methods for minimizing a smooth convex function ggg on a Hilbert space can be read as discretizations of second order ordinary differential equations, and the asymptotic behaviour of the continuous trajectories predicts the behaviour of the iterates. The inertial system with vanishing damping x¨+αtx˙+∇g(x)=0\ddot x+\frac{\alpha}{t}\dot x+\nabla g(x)=0x¨+tα​x˙+∇g(x)=0 is the continuous…

7 thms3 active usersReviewed
🏆Completed
CombinatoricsComplexity TheoryGraph Theory+1·Captain: mikedeng1

Algebraic Approach to Promise Constraint Satisfaction 2: Pol(K_k, K_{2k−1}) Has No Olšák Function, So It Maps by a Minion Homomorphism to Pol(H₂, H_K)Research Paper

Given a graph that is promised to be kkk-colourable, how many colours are needed to find a proper colouring in polynomial time? The decision version asks to distinguish kkk-colourable graphs from graphs that are not even ccc-colourable. It has been studied since Garey and Johnson (1976) and is conjectured to be NP-hard for all fixed 3≤k≤c3 \le k \le c3≤k≤c. This is the appr…

9 thms3 active usersReviewed
🏆Completed
Bandit AlgorithmsInformation TheoryMachine Learning+1·Captain: mikedeng1

A Tutorial on Thompson Sampling I: Any Algorithm Whose Information Ratio Is at Most Γ̄ Has Expected Regret at Most √(Γ̄·H(x*)·T)Research Paper

Thompson sampling (TS) chooses each action with the posterior probability that it is optimal. Its practical success in online advertising, recommendation and experimentation raised the question of why it works and when it does not. The tutorial of Russo, Van Roy, Kazerouni, Osband and Wen (Found. Trends Mach. Learn. 11(1), 2018) answers part of that…

9 thms3 active users
PreviousPage 77 of 193Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1TItianyipeng5162497
2EYEyal199050327667
3MRmrfancypants41060
4WIWillR36575444
5NINickrobbins953286155
6VEvebis25800
7FIfizzyinc321725
8SHshivm17490
9SCShuze Chen9455324
10KMkmehltretter82895261

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me