Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Optimization

2,311 missions · 1,728 completed

Missions

Open583Completed1728All2311
🏆Completed
Control Theory·Captain: wenxinzhang

Vector Space Methods XII: Pontryagin Minimum PrincipleTextbook

Pontryagin's principle as presented by Luenberger is the decisive necessary condition in continuous-time optimal control. It converts an optimization over functions into a pointwise comparison of a Hamiltonian, coupled to the original state equation and a backward costate equation. Luenberger derives the minimum-Hamiltonian convention from vector-space…

7 thms5 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: Shuze Chen

Convex Optimization III: Conic Duality and the S-procedureTextbook

Two quadratic functions can be compared losslessly. The S-procedure says that, when the constraint is strictly feasible, the implication

17 thms5 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: Shuze Chen

Convex Optimization I: Prékopa's TheoremTextbook

Log-concave functions are the meeting point of convex analysis and probability: densities of Gaussian, exponential, uniform and Wishart distributions are all log-concave, and countless facts of applied probability flow from one structural theorem — integrating out variables preserves log-concavity. This mission builds the convex-analysis spine of Boyd &…

29 thms5 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: Shuze Chen

Introduction to Linear Optimization X: Max-Flow Min-CutTextbook

How much flow can be sent from a source sss to a sink ttt through a network with arc capacities uij∈(0,∞]u_{ij}\in(0,\infty]uij​∈(0,∞] — and what certifies that no more is possible? This mission formalizes §7.4-7.5 of Bertsimas & Tsitsiklis. The circulation calculus of §7.4 supplies the two structural tools: the flow decomposition theorem (Lemma 7.1 — every nonzero nonnegative…

14 thms5 active usersReviewed
🏆Completed
Machine LearningProbability·Captain: mikedeng1

Cryptographic Guarantees for Distributed Training Under Malicious AdversariesResearch Paper

Distributed training splits the computation of a gradient across many workers whose contributions are combined by an aggregation server. When some workers are malicious and the server is untrusted, protocols add three kinds of safeguard: cryptographic checks that a reported aggregate is consistent with committed local gradients, differential privacy noise…

9 thms4 active usersReviewed
🏆Completed
CombinatoricsOperations ResearchProbability+1·Captain: Shuze Chen

Hermite Brings a Laptop: Analyzing Frieze-Jerrum Rounding Yields Improved Approximations for Clustering ProblemsResearch Paper

Correlation clustering asks for a partition of the vertices of a graph whose edges are labelled "similar" or "dissimilar", agreeing with as many labels as possible. In its maximization form, MaxAgree, one maximizes the total weight of positive edges inside clusters plus negative edges between clusters. The problem was introduced by Bansal, Blum and Chawla (M…

26 thms4 active usersReviewed
🏆Completed
CombinatoricsLinear OptimizationOperations Research·Captain: iris

Approximate Submodularity in Network Design Problems: Every Greedy-Type Heuristic of Algorithm 1 Is a (1 − (1 − 2/K)^K)/2 ≥ (1 − e^{−2})/2 Approximation for Flexibility DesignResearch Paper

Process flexibility lets a plant, warehouse or server pool serve more than one product or customer class. A firm that cannot predict which products will be in demand chooses, before demand and capacity are realized, which supply–demand pairs to connect; after the uncertainty resolves it routes capacity to demand along the installed links. Since Jordan and…

24 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchProbability·Captain: iris

Markov Decision Processes with Applications to Finance VIII: The Binomial Mean-Risk Problem with Average-Value-at-Risk Has an Explicit Value and a Stationary Optimal PolicyTextbook

Markowitz's mean-variance criterion measures the risk of a portfolio by the variance of its terminal wealth. The variance penalizes gains and losses alike, which is one of its drawbacks as a measure of risk. The axiomatic theory of coherent risk measures (Artzner, Delbaen, Eber and Heath, 1999) replaced it in much of risk management by quantities that look…

13 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchProbability·Captain: iris

Markov Decision Processes with Applications to Finance XI: Contracting Models Satisfy Value Iteration, Have a Unique Fixed Point and an Optimal Stationary PolicyTextbook

Infinite-horizon Markov Decision Processes with discounted rewards are the standard model for sequential decisions under uncertainty in operations research, economics and finance: inventory and cash management, consumption and investment, dividend payout, replacement and maintenance. Whether the problem has a usable solution depends on two questions. Is the…

12 thms4 active usersReviewed
🏆Completed
Operations ResearchRevenue Management and Pricing·Captain: iris

Technical Note—Optimizing Risk-Balancing Return Under Discrete Choice Models: Under Symmetric MNL Demand the Optimal Markup Is Uniform and Falls with Risk Aversion, Reaching Zero Past a ThresholdResearch Paper

Pricing under discrete choice models is a core tool of revenue management: a firm sets prices for a line of substitute products, and customers choose one product or nothing according to a probabilistic choice rule. Almost all of this literature assumes a risk-neutral firm that maximizes expected profit. Under the multinomial logit (MNL) model with a common…

13 thms4 active usersReviewed
🏆Completed
Graph TheoryOperations Research·Captain: iris

Convexification of Bilinear Terms over Network Polytopes: For m=1m = 1m=1, Every Tree Meeting Exactly One Endpoint of Arc lll Gives an EC&R Assignment of Class l±l^\pml± for Every Partition of Its NodesResearch Paper

Products yjxiy_jx_iyj​xi​ of a flow variable xix_ixi​ and a second decision variable yjy_jyj​ appear whenever a flow decision interacts with a pricing, design or selection decision: pooling and blending problems, network interdiction, transportation with fixed charges, and bilevel network models. Global solvers handle such terms by convexification: they replace the nonconvex…

9 thms4 active usersReviewed
🏆Completed
Convex OptimizationMachine LearningOperations Research·Captain: iris

Dynamic Data-Driven Estimation of Non-Parametric Choice Models: With Primal-Oracle Steps, the Weighted Average Has Primal Optimality Gap at Most the Dual Regret Plus the Two Data-Error TermsResearch Paper

A non-parametric choice model describes customers by a probability distribution over rankings of nnn products: a customer offered a subset of products buys the one ranked highest among them. Revenue management and assortment planning use such models because they impose no functional form on substitution behaviour (Farias, Jagabathula and Shah, 2013; van Ryzin…

16 thms4 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: iris

Finding Hall Blockers by Matrix Scaling: without a perfect matching, (1/4)n² log(mA_max/A_min) Sinkhorn iterations and a sort of the scaling vectors output a Hall blockerResearch Paper

Matrix scaling asks for positive diagonal matrices that turn a nonnegative matrix into one with prescribed row and column sums. The Sinkhorn algorithm, which alternately normalizes rows and columns, is the standard method; it appears in statistics (iterative proportional fitting), entropic optimal transport, and combinatorial optimization. For the doubly…

16 thms4 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: iris

Stochastic Linear Programming: Models, Theory, and Computation IX: Jensen and generalized Edmundson–Madansky bounds sharpen on every partition of the support boxTextbook

In a two-stage stochastic linear program the objective contains the expected recourse Q(x)=Eξ[Q(x;T(ξ),h(ξ))]\mathcal Q(x)=\mathbb E_\xi[Q(x;T(\xi),h(\xi))]Q(x)=Eξ​[Q(x;T(ξ),h(ξ))], the expectation of a second-stage LP value over a random vector ξ∈Rr\xi\in\mathbb R^rξ∈Rr. For a continuous distribution this is an rrr-dimensional integral of a function that is itself defined by an optimization problem, and it…

25 thms4 active usersReviewed
🏆Completed
Combinatorics·Captain: iris

Combinatorial Optimization (Cook et al.) XIII: Edmonds' Matroid Intersection TheoremTextbook

Many combinatorial optimization problems ask for a largest set that is simultaneously "independent" in two different senses. A matching in a bipartite graph G=(V,E)G=(V,E)G=(V,E) with bipartition {V1,V2}\{V_1,V_2\}{V1​,V2​} is a set of edges in which every node of V1V_1V1​ meets at most one edge and every node of V2V_2V2​ meets at most one edge. A branching of a digraph is an arc set that is a…

16 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: iris

When Nash Meets Stackelberg: The Enumeration Algorithm Returns a Mixed Nash Equilibrium or Correctly Certifies That None ExistsResearch Paper

Many markets are organised as competition among firms that each anticipate the reaction of a group of followers. Electricity producers decide capacities while the system operator and consumers clear the market; carriers set prices while shippers choose routes. Operations research models these settings as equilibrium problems with equilibrium constraints…

23 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryLinear OptimizationOperations Research·Captain: iris

Zero-Sum Games and Linear Programming Duality: Every Max-Min Strategy of Dantzig's Game with One Extra Row Yields Optimal LP Solutions or Certifies That No Optimal Solution ExistsResearch Paper

Linear programming duality and the minimax theorem for zero-sum games are two faces of the same convexity fact. The classical direction, from LP duality to the minimax theorem, is textbook material: the optimal strategies of a matrix game are the optimal solutions of a pair of dual LPs. The converse direction, solving an LP by solving a game, goes back to Da…

23 thms4 active usersReviewed
🏆Completed
Convex Optimization·Captain: Shuze Chen

Theory and Applications of Robust Optimization: Tightness of the semidefinite approximation for affine adaptabilityResearch Paper

In a two-stage robust optimization problem, a decision maker commits to some variables before observing uncertain data and chooses the remaining variables after observing it. Requiring every decision to be fixed at the outset can lose the benefit of this information. Allowing an arbitrary response, however, can produce a problem with infinitely many…

9 thms4 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: Shuze Chen

Robust Assortment Optimization Under the Markov Chain Choice Model: Min-max duality and optimal robust assortmentsResearch Paper

A retailer chooses which products to offer before learning exactly how customers will substitute between them. A product that looks attractive under estimated demand can perform poorly when those estimates are wrong. Robust assortment optimization evaluates each offer set by its worst expected revenue over a specified set of possible customer models. The…

14 thms4 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: Shuze Chen

Minimum Label s-t Cut has Large Integrality Gaps: Nearly cube-root integrality gap for the strengthened relaxationResearch Paper

A network failure can remove several connections at once. When the connections share a physical resource, paying for or disabling that resource acts on an entire class of edges. The minimum label s-t cut problem captures this distinction: edges carry labels, and the cost of removing a label is paid once, regardless of how many edges have that label. Zhang…

14 thms4 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: Shuze Chen

Production Planning by Mixed Integer Programming IV: An Extended Formulation for the Mixing SetTextbook

Mixed-integer production models combine quantities that vary continuously with decisions counted in whole units. A relaxation that allows the latter quantities to be fractional can admit points excluded by every implementable plan. The convex hull of the original feasible set describes the strongest convex relaxation in the same variables. Understanding…

9 thms4 active usersReviewed
🏆Completed
Complexity TheoryDiscrete GeometryOperations Research·Captain: mikedeng1

Mixed-integer Quadratic Programming is in NP: Every Feasible Mixed-Integer Quadratic System Has a Feasible Solution of Polynomial Bit-SizeResearch Paper

Mixed-integer quadratic programming (MIQP) asks to minimize a quadratic function over the points of a polyhedron whose first ppp coordinates are integers. It contains integer linear programming, quadratic programming and combinatorial problems such as max-cut.

9 thms4 active usersReviewed
🏆Completed
Machine LearningOperations ResearchProbability+1·Captain: mikedeng1

Stochastic First-Order Methods for Average-Reward Markov Decision Processes: Stochastic Policy Mirror Descent Attains Expected Average-Cost Gap κ√(log|A|/K) + ς on Mixing AMDPsResearch Paper

Many control problems in operations research have no natural horizon and no natural discount rate: a queue, an inventory system or a communication network runs indefinitely, and what matters is the cost it incurs per period in the long run. The average-reward Markov decision process (AMDP) is the standard model for these problems (Puterman, 2014, Ch. 8).…

13 thms4 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: mikedeng1

Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis: Sparsity Theorem, the Closed-Form Minimizer of a Symmetric Gauge over Sparse Weak MajorantsResearch Paper

Many problems in statistics and signal processing ask for a vector that is both small in some norm and sparse, with at most KKK nonzero entries. The best-known example is sparse principal component analysis (sparse PCA), whose feasible set is the set of unit vectors in the Euclidean norm with at most KKK nonzero entries (d'Aspremont et al. 2007). Cardinality…

13 thms4 active usersReviewed
🏆Completed
CombinatoricsOperations Research·Captain: mikedeng1

M♮-Convexity and Its Applications in Operations: Optimal Solutions Are Nonincreasing in the Parameters for SSQM♮-Concave Objectives on a BoxResearch Paper

Many operations models ask how an optimal decision moves when a parameter moves. The classical answer is lattice programming (Topkis 1998): when the objective is supermodular, so that decisions and parameters are complements, optimal solutions are nondecreasing in the parameters. Inventory, assortment and resource-allocation problems often have the opposite…

11 thms4 active usersReviewed
PreviousPage 7 of 70Next

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