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
Dynamic ProgrammingOperations Research·Captain: iris

Dynamic Programming Deconstructed: Transformations of the Bellman Equation and Computational Efficiency: Refactored Value Iteration Converges to g* and g*-Greedy Policies Are OptimalResearch Paper

Many dynamic programs are solved faster after the Bellman equation has been rewritten. The Q-factor form of reinforcement learning moves the maximization inside an expectation over state-action pairs; Rust's expected value function for discrete choice models (Rust 1987) integrates out the next state before maximizing; optimal stopping problems are routinely…

13 thms2 active usersReviewed
EconomicsOperations Research·Captain: iris

Dark Knights: The Rise in Firm Intervention by Credit Default Swap Investors: an intervening CDS seller raises equilibrium firm value, with full hedging, no liquidation and a positive CDS premiumResearch Paper

A credit default swap (CDS) insures a lender against the default of a borrower: the protection buyer (the lender) pays an upfront premium, and the protection seller (a dealer) pays the insured amount if a credit event occurs. Because the payment depends on whether the firm is liquidated, both sides of the contract have a stake in how a distressed firm is…

18 thms2 active usersReviewed
Operations ResearchProbability·Captain: iris

Robustness in the Optimization of Risk Measures: Value-at-Risk is not robust against optimization for budget-constrained functional problemsResearch Paper

Value-at-Risk (VaR) and Expected Shortfall are the two risk measures used in banking and insurance regulation. Their robustness has traditionally been studied as a property of the functional alone, applied to one fixed position. In that setting Cont, Deguest and Scandolo (2010) found VaR more robust than coherent risk measures, while later work such as Embre…

15 thms2 active usersReviewed
Convex OptimizationLinear algebraOperations Research·Captain: iris

Masking Anstreicher's linx Bound for Improved Entropy Bounds: The Identity Mask Lowers the Optimally Scaled linx Bound by at Least 0.024036·nResearch Paper

The maximum-entropy sampling problem (MESP) asks, for an n×nn\times nn×n covariance matrix CCC of Gaussian random variables and an integer 0<s<n0<s<n0<s<n, for the sss variables of largest joint differential entropy:

14 thms2 active usersReviewed
Operations ResearchProbability·Captain: Shuze Chen

Credit Default Swaps and Debt Overhang: CDS protection raises bankruptcy and investment thresholdsResearch Paper

A creditor insured against a borrower's default may have less reason to accept concessions that keep the borrower operating. The resulting bargaining incentives can affect investment even when the insurance contract itself transfers no resources to the firm. Wong and Yu study this interaction in a firm that has already issued long-term debt and can…

7 thms2 active usersReviewed
Bandit AlgorithmsOperations Research·Captain: Shuze Chen

Online Learning and Optimization for Revenue Management Problems with Add-on Discounts: Regret bound for UCB-Add-OnResearch Paper

Retailers sometimes offer a discount on a game only after a customer buys a console. Such add-on discounts let the customer choose individual additional products while the retailer controls both the original prices and the conditional offers. A retailer with limited transaction history must learn purchase probabilities while choosing these prices. Offering…

9 thms2 active usersReviewed
Dynamic ProgrammingOperations Research·Captain: Shuze Chen

Dynamic Learning and Decision Making via Basis Weight Vectors: Exact backward recursion for continuation-value frontiersResearch Paper

A seller choosing prices may learn about demand from purchases while earning revenue from those same purchases. The hidden customer characteristic can range continuously, even when there are only a few prices and observations. A policy must therefore trade off present reward and information that affects later decisions. Describing every possible belief…

16 thms2 active usersReviewed
Operations ResearchProbabilityStatistics·Captain: Shuze Chen

A Data-Driven Approach to Multistage Stochastic Linear Optimization: Almost-sure asymptotic bounds for sample robust optimizationResearch Paper

A sequence of decisions often has to be made before all relevant uncertainty is observed. An inventory planner orders before demand arrives, then replenishes using the demand observed so far. Historical records provide complete trajectories from comparable products or earlier operating periods. They may reveal dependence between periods without identifying…

17 thms2 active usersReviewed
Linear OptimizationOperations Research·Captain: Shuze Chen

Production Planning by Mixed Integer Programming VI: Backlogging and Start-Up ReformulationTextbook

Production plans often allow demand to be served late and charge a separate cost for restarting production. These choices interact: keeping a machine set up can avoid a later start-up charge, while delaying production creates backlog costs. A formulation that represents each feature separately need not give an exact linear relaxation when the features are…

7 thms2 active usersReviewed
ProbabilityStochastic Systems·Captain: Shuze Chen

Optimal Stopping and Free-Boundary Problems VII: Optimal Prediction of the Brownian MaximumTextbook

Observing a fluctuating process does not reveal whether its largest value has already occurred. A decision to stop must nevertheless use the observations available at that moment. Optimal prediction asks how well such a decision can approximate a quantity determined by the entire future path. Peskir and Shiryaev formulate a basic instance using a Brownian…

7 thms2 active usersReviewed
Operations ResearchProbabilityStochastic Systems·Captain: Shuze Chen

Optimal Stopping and Free-Boundary Problems III: The Maximality PrincipleTextbook

A decision maker observes a fluctuating quantity and can collect its largest observed value when observation stops. Waiting can improve the record, but observation has a running cost. The decision depends on both the current state and the record already achieved: the same current observation can justify different decisions after different histories. This is…

7 thms2 active usersReviewed
Control TheoryLinear OptimizationOperations Research·Captain: mikedeng1

An Optimal Control Framework for Online Job Scheduling with General Cost Functions: Algorithm 2 Is 2K-Speed 2-Competitive for Monotone Substitute Cost FunctionsResearch Paper

A single machine receives jobs over time. Each job jjj arrives at its release time rjr_jrj​ with a length vjv_jvj​ and a cost function gjg_jgj​, and all three become known only at arrival. The machine may interrupt a job and resume it later (preemption). The objective is the total delay cost ∑jgj(Cj)\sum_j g_j(C_j)∑j​gj​(Cj​), where CjC_jCj​ is the completion time of job jjj. Weighted flow time (…

12 thms2 active usersReviewed
Algorithmic Game TheoryMachine Learning·Captain: mikedeng1

Greedy Adversarial Equilibrium: An Efficient Alternative to Nonconvex–Nonconcave Min-Max Optimization: Every Bounded Function with Lipschitz Hessian Has a Greedy Adversarial EquilibriumResearch Paper

Min-max problems min⁡xmax⁡yf(x,y)\min_x\max_y f(x,y)minx​maxy​f(x,y) model two-player zero-sum games and appear across machine learning and operations research: adversarial training of classifiers, generative adversarial networks, and robust optimization against an adversarial perturbation. When fff is convex in xxx and concave in yyy, von Neumann's minimax theorem gives a saddle point, and…

9 thms2 active usersReviewed
Machine LearningProbabilityStatistics·Captain: mikedeng1

Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model: The SDP Clustering Error Is at Most Twice the Oracle Integer Program ErrorResearch Paper

Clustering methods must infer a partition from noisy observations, while the quality of a partition is usually judged against labels that the method cannot see. Fei and Chen study a balanced sub-Gaussian mixture model in which a semidefinite program (SDP) estimates a cluster matrix from pairwise distances. Their Theorem 1 relates its error to a simpler…

13 thms2 active usersReviewed
Convex OptimizationLinear algebra·Captain: mikedeng1

Conic Optimization with Spectral Functions on Euclidean Jordan Algebras: The Root-Determinant Cone Barrier Is a (1 + d)-Logarithmically Homogeneous Self-Concordant BarrierResearch Paper

Interior-point methods solve a conic optimization problem by following the minimizers of a barrier function for the cone. Their iteration count is governed by the barrier's parameter ν\nuν: the best known algorithms need O(νlog⁡(1/ε))O(\sqrt\nu\log(1/\varepsilon))O(ν​log(1/ε)) iterations to reach accuracy ε\varepsilonε (Nesterov and Todd, 1997). A cone can be used natively by a solver…

14 thms2 active usersReviewed
Algebraic GeometryAlgorithmic Game TheoryOperations Research·Captain: mikedeng1

Nash Equilibrium Problems of Polynomials: For Generic Polynomial Data the KKT-Cut Algorithm Terminates Finitely, Finding a Nash Equilibrium or Certifying That None ExistsResearch Paper

A Nash equilibrium problem (NEP) asks for strategies of several players such that no player can lower its own cost by deviating while the others keep theirs fixed. NEPs model competition in electricity markets, environmental agreements, and the training of generative adversarial networks. When the players' problems are nonconvex, an equilibrium requires…

13 thms2 active usersReviewed
Bandit AlgorithmsDynamic ProgrammingOperations Research+1·Captain: Shuze Chen

Multi-armed Bandit Allocation Indices VIII: Index Theorems for Non-Preemptive Jobs under Precedence Constraints and Out-ForestsTextbook

Scheduling jobs on a single machine under precedence constraints ("job iii must be completed before job jjj may be started") is one of the oldest problems of operations research, and with random service times and discounted rewards it is a family of alternative bandit processes that is not simple: the set of jobs that may be served changes as jobs are…

7 thms2 active usersReviewed
Machine LearningProbability·Captain: mikedeng1

Global Convergence of Stochastic Gradient Hamiltonian Monte Carlo for Non-Convex Stochastic Optimization: Explicit Population Risk Bound for Euler SGHMCResearch Paper

Many learning problems are instances of the stochastic program

14 thms2 active usersReviewed
Machine LearningStatistics·Captain: mikedeng1

High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks: Excess-Risk Bounds at S3ONC Solutions of MCP-Regularized M-EstimationResearch Paper

High-dimensional statistical learning (HDSL) fits a model with ppp parameters from nnn samples when ppp may far exceed nnn. The standard guarantees for sparse estimators, such as the Lasso, rest on restricted strong convexity (RSC) or restricted eigenvalue conditions on the empirical risk (Negahban et al., 2012; Loh & Wainwright, 2015). These conditions fail or are…

11 thms2 active usersReviewed
Algebraic GeometryConvex OptimizationOperations Research·Captain: mikedeng1

On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization: The Set of Transition Points of the Optimal Partition Is FiniteResearch Paper

Sensitivity analysis asks how the solution of an optimization problem changes when its data move. For linear optimization the answer has been known since the 1990s: as the objective is perturbed along a fixed direction, the optimal partition (which variables can be positive at an optimum and which slacks can) stays constant on open intervals and changes…

11 thms2 active usersReviewed
Operations Research·Captain: mikedeng1

Optimal Use and Replenishment of Two Substitutable Raw Materials in a Stochastic Capacitated Make-to-Order Production System: A Use-Down-To/Balancing Production Policy Is OptimalResearch Paper

Make-to-order manufacturers may use two substitutable raw materials to satisfy demand when production capacity and material deliveries are uncertain. A cheaper material may yield less finished product per unit, and the firm must decide how much of each material to preserve for later periods. A production rule based only on current unit costs can be wrong…

11 thms2 active usersReviewed
Machine LearningRandom Matrix TheoryStatistics·Captain: mikedeng1

Nonconvex Low-Rank Tensor Completion from Noisy Data: Spectrally Initialized Vanilla Gradient Descent Recovers the Tensor Factors at a Linear Rate to Near-Optimal ℓ2 and ℓ2,∞ AccuracyResearch Paper

A partially observed array with three indices appears when data record relationships among triples of objects. If its entries have a low-rank structure, one can hope to recover the full array from far fewer than d3d^3d3 measurements. Cai, Li, Poor and Chen study this problem when the measurements are noisy and only a random subset of entries is seen. Their…

8 thms2 active usersReviewed
Control TheoryOperations Research·Captain: mikedeng1

Managing Self-Replicating Innovative Goods: Characterization of the Optimal Production and Sales Policies under Strong ReplicabilityResearch Paper

Some goods can only be made by copies of themselves. RepRap and Prusa 3D printers print the parts of new printers, seed stock is grown from seed, and livestock herds breed. For such a good the inventory is also the production capacity: a unit sold today is a unit that will not replicate tomorrow. A firm launching such a good has to decide, at every instant,…

8 thms2 active usersReviewed
EconomicsOperations Research·Captain: mikedeng1

Addictive Platforms 1: Monopoly versus Duopoly — Competition Raises Addictiveness and Hurts the Consumer When Attention Is Scarce, and Lowers Addictiveness When It Is AbundantResearch Paper

Digital services are paid for with attention: an ad-financed platform earns more the longer its users stay. Policy reports on digital markets (Crémer, de Montjoye and Schweitzer, 2019; the U.K. Digital Competition Expert Panel, 2019; Scott Morton et al., 2019) worry that such firms degrade their services with features that capture attention at the user's…

9 thms2 active usersReviewed
Numerical AnalysisOperations Research·Captain: mikedeng1

A First-Order Primal-Dual Method for Nonconvex Constrained Optimization Based on the Augmented Lagrangian 3: The Kurdyka–Łojasiewicz Property with Exponent 1/2 Implies the VP-EB Error BoundResearch Paper

Augmented Lagrangian methods are a standard tool for constrained optimization, and first-order primal-dual variants of them are used when the objective is large, nonsmooth or nonconvex and second-order information is too expensive. Zhu, Zhao and Zhang (arXiv:2007.12219v1, published in Mathematics of Operations Research, 2024) analyse such a method, NAPP-AL (…

14 thms2 active users
PreviousPage 16 of 24Next

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