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
Linear OptimizationOperations Research·Captain: mikedeng1

An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities: On Infeasible Systems, OEA Returns a Solution of (Alt) Within 2m(m+1) ln((m+1)‖u−ℓ‖/(2mτ)) IterationsResearch Paper

A system of linear inequalities may have either a feasible point or a short witness that no feasible point exists. An algorithm that returns the witness is useful when a solver must explain an infeasibility decision rather than merely announce one. The standard ellipsoid method can test feasibility under suitable geometric bounds, but its ordinary output…

11 thms3 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Set Relations via Families of Scalar Functions and Approximate Solutions in Set Optimization: A Weierstrass-Type Existence Theorem with Hausdorff Convergence of Approximate MinimizersResearch Paper

Many decision problems have set-valued outcomes rather than single numbers. Typical cases are a portfolio whose risk is a set of capital vectors, a vector optimization problem whose image is upper-bounded by an ordering cone, or a robust model whose value is the set of all achievable outcomes. Set optimization minimizes such a map f ⁣:X→P(Z)f\colon X\to\mathcal P(Z)f:X→P(Z).…

10 thms3 active usersReviewed
🏆Completed
CombinatoricsOperations ResearchTheoretical Computer Science·Captain: Shuze Chen

A Combinatorial, Strongly Polynomial-Time Algorithm for Minimizing Submodular Functions: The Algorithm of Figure 3 Returns a Minimizer of Every Real Submodular Function in O(n⁷ log n) StepsResearch Paper

Submodular function minimization asks for a subset XXX of a finite set VVV that minimizes a set function fff satisfying f(X)+f(Y)≥f(X∪Y)+f(X∩Y)f(X) + f(Y) \ge f(X \cup Y) + f(X \cap Y)f(X)+f(Y)≥f(X∪Y)+f(X∩Y). Cut functions, matroid rank functions and entropy are submodular, and minimizing them is a subroutine in dynamic flows, facility location and source coding. Grötschel, Lovász and Schrijver showed in…

15 thms3 active usersReviewed
🏆Completed
Convex OptimizationLinear algebraOperations Research·Captain: Shuze Chen

Lectures on Modern Convex Optimization V: Semidefinite Representability of Symmetric Functions of EigenvaluesTextbook

A convex optimization problem can be handed to a semidefinite programming solver only after its constraints and objective have been written as linear matrix inequalities (LMIs): conditions of the form A(x,u)⪰0\mathcal A(x,u) \succeq 0A(x,u)⪰0, where A\mathcal AA is affine in the decision variables xxx and in auxiliary variables uuu, and ⪰0\succeq 0⪰0 means positive semidefinite. A…

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

Sufficient Optimality Conditions in Bilevel Programming: A Second-Order Sufficient Condition via the Value Function Reformulation and Second-Order Directional DerivativesResearch Paper

In a bilevel program, the decision maker chooses an upper-level variable while a second decision must solve a lower-level optimization problem. This structure occurs when a leader anticipates the response of a follower, or when an outer design problem contains an optimization problem as a constraint. A feasible upper-level decision can therefore change the…

9 thms3 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

Disclosing Delivery Performance Information When Consumers Are Sensitive to Promised Delivery Time, Delivery Reliability, and Price: Full or No Information-Quality Effort Is OptimalResearch Paper

Online retailers and service providers quote a promised delivery time and are judged on how often they meet it. Platforms increasingly publish delivery-performance information, such as on-time ratings or conformance scores, so that consumers can weigh a quoted time against the firm's record. Producing accurate information is costly: the firm must track…

10 thms3 active usersReviewed
🏆Completed
CombinatoricsOperations Research·Captain: mikedeng1

Probability Distributions on Partially Ordered Sets and Network Interdiction Games: Under the Conservation Law, Element Marginals and Maximal-Chain Hitting Bounds Are Jointly AchievableResearch Paper

Network interdiction asks how an inspector should randomize over sets of links when a router can choose a path through a network. Link inspection probabilities and path interception probabilities describe different features of the same random choice. Specifying both sets of numbers separately does not guarantee that one distribution over inspection sets…

11 thms3 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Directional Necessary Optimality Conditions for Bilevel Programs: A Local Minimizer Satisfies the Directional KKT Condition Under Directional Calmness of the Value-Function ReformulationResearch Paper

A bilevel program is an optimization problem in which one of the constraints is itself an optimization problem. An upper-level decision maker (a leader) chooses xxx; a lower-level decision maker (a follower) responds with an optimal solution yyy of a problem parameterized by xxx; the leader's cost F(x,y)F(x,y)F(x,y) depends on both. Stackelberg games, toll setting on…

11 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: mikedeng1

New Mixed-Integer Nonlinear Programming Formulations for the Unit Commitment Problems with Ramping Constraints: The DP Formulation Describes the Closed Convex Hull of the Single-Unit ProblemResearch Paper

Unit commitment (UC) decides, period by period, which thermal generators of a power system are switched on and how much power each produces. It is solved daily by system operators and in the bidding tools of producers, usually as a mixed-integer program, and its size makes the strength of the formulation the main computational lever. A formulation whose…

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

Solving Nonsmooth and Nonconvex Compound Stochastic Programs with Applications to Risk Measure Minimization: Almost Surely, SMM Accumulation Points Minimize a Limiting Convex SurrogateResearch Paper

Many risk-averse decision problems are not expectations of a loss but nonlinear functions of several nested expectations. The optimized certainty equivalent of a deviation, the buffered probability of exceedance and mean–deviation criteria all take the form "a convex isotone function of an expectation of a convex function of a random map and of another…

9 thms3 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

Distributed 3D Printing of Spare Parts via IP Licensing: Optimal Standard License, OEM Profit and Channel Selection for Two Nonidentical BuyersResearch Paper

Spare parts for capital goods (aircraft, defence systems, industrial machinery) are slow-moving and expensive to stock, and an unplanned stock-out idles the equipment they serve. Industrial additive manufacturing (3D printing) lets a part be produced close to where it is used, with short lead times and small batches. An original equipment manufacturer (OEM)…

9 thms3 active usersReviewed
🏆Completed
AnalysisOperations Research·Captain: mikedeng1

Personalized Robo-Advising: Enhancing Investment Through Client Interaction: The Approximate Personalization Measure Has a Unique Optimal Time Between Interactions, Increasing in Behavioral BiasResearch Paper

A robo-advisor is an automated portfolio manager. It invests a client's wealth according to a model of the client's risk preferences, and it learns those preferences by interacting with the client: questionnaires, check-ins, requests to confirm or revise a risk profile. The design question of how often such a system should query its client is practical:…

11 thms3 active users
🏆Completed
Convex OptimizationFunctional AnalysisOperations Research·Captain: mikedeng1

Multivariate Monotone Inclusions in Saddle Form: The Asynchronous Block-Iterative Saddle Splitting Algorithm Converges Weakly to a Primal-Dual Kuhn–Tucker PointResearch Paper

Many problems in convex optimization, variational inequalities, game theory and signal processing are systems of monotone inclusions coupled by linear operators: several unknowns xix_ixi​ in different Hilbert spaces, each subject to its own maximally monotone, cocoercive and Lipschitzian operators, and tied together through linear maps LkiL_{ki}Lki​ and composite…

15 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: mikedeng1

Time-Varying Semidefinite Programs: Under Strict Feasibility, Feasible Polynomial Solutions Have Objective Values Converging to the TV-SDP Optimal ValueResearch Paper

Many planning problems ask for a decision that varies over a time horizon and must satisfy a constraint at every instant, possibly with cumulative effects of past decisions. The applications in the source paper are a maximum-flow problem with time-varying pipeline capacities, a wireless coverage problem for a moving target region, and the approximation of…

10 thms3 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Second-Order Optimality Conditions for Nonconvex Set-Constrained Optimization Problems: A Directional Second-Order Necessary Condition via the Lower Generalized Support FunctionResearch Paper

Optimization problems often require a smooth objective to be minimized subject to membership in a set. When that set is convex, established second-order conditions describe how curvature of the objective and constraints limits a local solution. Complementarity constraints and related models lead to nonconvex constraint sets. The tangent sets needed for a…

11 thms3 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Promotion Optimization for Multiple Items in Supermarkets: Under Additively Separable Cross-Item Effects, All Higher-Order Promotion Contributions Vanish and App(2) = App(N)Research Paper

Supermarkets run temporary price promotions on a large share of their assortment, and the choice of which item to discount, by how much and in which week is a recurring planning decision for category managers. Promotions on one item change the sales of the others: a discount on one brand of coffee draws customers away from a competing brand (substitution),…

7 thms3 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

The Discrete Moment Problem with Nonconvex Shape Constraints: Optimal Extreme Point Solutions of the Log-Concave Discrete Moment Problem Are Piecewise Geometric with at Most m PiecesResearch Paper

A discrete moment problem asks for the largest expected payoff compatible with prescribed moments of an unknown probability distribution. A decision maker may know the first few moments of demand or loss while the full distribution remains uncertain. The optimization then asks which compatible distribution makes a chosen payoff largest. Chen, He, Jiang,…

14 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchProbability+1·Captain: mikedeng1

Distributionally Robust Inverse Covariance Estimation: The Wasserstein Shrinkage Estimator: Without Sparsity Information the Robust Estimator Is a Closed-Form Shrinkage of the Sample EigenvaluesResearch Paper

The precision matrix X=Σ−1X=\Sigma^{-1}X=Σ−1 of a Gaussian random vector ξ∈Rp\xi\in\mathbb R^pξ∈Rp encodes its conditional independence structure: Xij=0X_{ij}=0Xij​=0 exactly when ξi\xi_iξi​ and ξj\xi_jξj​ are independent given the other coordinates. Estimating it is a basic step in Gaussian graphical models, portfolio selection and linear discriminant analysis. The textbook estimator, the…

14 thms3 active usersReviewed
🏆Completed
AnalysisEconomicsOperations Research·Captain: mikedeng1

Platform Tokenization: Financing, Governance, and Moral Hazard: For Small Capacity Cost the Blockchain-Based Business Model Strictly Dominates the Traditional OneResearch Paper

Digital platforms (marketplaces, payment networks, sharing services) need large up-front investments in capacity before any revenue arrives, and their founders typically finance them by selling equity to venture capitalists. Since 2017 an alternative has been available: issuing a platform-specific cryptocurrency (a utility token) in an initial coin offering…

11 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryConvex OptimizationMechanism Design+1·Captain: mikedeng1

Optimal Commissions and Subscriptions in Networked Markets: The Convex Relaxation Is Tight and Characterizes All Revenue-Optimal FeesResearch Paper

Online marketplaces such as Airbnb, Upwork and eBay match buyers and sellers but do not set transaction prices. They earn revenue through commissions (a fraction of the transaction price) and subscription fees (a fixed charge per transaction), and they often differentiate these fees by participant type. Prices then form endogenously, as a competitive…

23 thms3 active users
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Cross-licensing in a Supply Chain with Asymmetric Manufacturers III: When the Supplier Prefers to Commit to Cross-Licensing Ex AnteResearch Paper

A component supplier may ask two downstream manufacturers to license their improvements to each other. Sharing raises each product's quality, but it can also reduce a manufacturer's reason to invest in its own improvement. The supplier must choose the licensing rule before those investments and before setting the wholesale price. Wang, Huang, and Lee study…

8 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryMachine LearningOperations Research·Captain: mikedeng1

Optimal Decision Making Under Strategic Behavior 2: A Three-Value Instance with Outcome Monotonic Costs Whose Optimal Policies Are All StochasticResearch Paper

Many consequential decisions, such as lending, hiring or admissions, are made by policies that map an individual's features to a probability of a positive decision. When the policy is published, individuals respond to it: they change their features, at a cost, to raise their chance of a positive decision. Tsirtsis, Tabibian, Khajehnejad, Singla, Schölkopf…

7 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsOperations Research·Captain: mikedeng1

Improving Access to Rare Disease Treatments: Subsidy, Pricing, and Payment Schemes II: Consortium Price, No Cure No Pay: Subsidize Only Patients When the Price Is High, Only the Manufacturer When LowResearch Paper

A rare disease affects few patients, so a drug for it has a small market and its research and development (R&D) cost is spread over few sales. Governments respond with two kinds of subsidy: cost subsidies that pay part of the manufacturer's R&D bill (orphan drug programmes), and price subsidies that pay part of what each patient is charged. At the same time…

7 thms3 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

A Theory of Liquidity in Private Equity I: Without a Secondary Market, Two Capital-Share Thresholds Characterize Equilibrium, and Liquid LPs Earn Strictly More When Both Fund Types ExistResearch Paper

Private equity funds are organized as limited partnerships. Limited partners (LPs: pension funds, endowments, insurers) commit capital, and a general partner (GP) manages the fund and calls the committed capital over several years. A well-documented empirical regularity is that some LPs earn persistently higher returns than others, and that fund returns…

10 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomicsOperations Research·Captain: mikedeng1

Precommitments in Two-Sided Market Competition 2: Commission Precommitment Beats No Commitment When γ ≥ β or γ ≪ β, and Loses to It When γ Is Just Below βResearch Paper

Many service platforms set a price paid by customers and a wage paid to the providers who serve them. A platform may instead announce how much of each transaction's price it will pass to providers, then choose prices after both platforms have announced their shares. These are different games: a price change in the second game changes both customer demand…

7 thms3 active usersReviewed
PreviousPage 22 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