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
Dynamic ProgrammingOperations ResearchProbability·Captain: mikedeng1

Bellman's Dynamic Programming V: Optimality of a Constant Stock Level for the Optimal Inventory EquationTextbook

The optimal inventory problem asks how much of an item to stock when demand is random, ordering costs money, and running short costs more. Arrow, Harris and Marschak formulated it as a sequential decision problem in 1951 (Optimal inventory policy, Econometrica 19), and Dvoretzky, Kiefer and Wolfowitz studied its structure in 1952–53. Chapter V of Richard…

7 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchProbability·Captain: mikedeng1

Bellman's Dynamic Programming III: Index Rules for the Stochastic Gold-Mining ProcessTextbook

Chapter II of Richard Bellman's Dynamic Programming (Princeton University Press, 1957) treats the stochastic gold-mining process, the first stochastic multi-stage decision process of the book whose optimal policy can be written down in closed form. There Bellman introduces decision regions, the sets of states at which a given first choice is optimal, and…

11 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations Research·Captain: mikedeng1

Bellman's Dynamic Programming II: Fibonacci Search for the Maximum of a Unimodal FunctionTextbook

Many optimization routines contain an inner step that maximizes a function of one variable whose values are expensive to compute: a line search inside a multivariate method, a tuning parameter chosen by simulation, a stage of a dynamic program in which each evaluation requires solving a subproblem. When the only structural information is that the function…

9 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations Research·Captain: mikedeng1

Bellman's Dynamic Programming I: Existence and Uniqueness for the Multi-Stage Allocation EquationTextbook

Chapter I of Richard Bellman's Dynamic Programming (Princeton University Press, 1957) opens the book with a multi-stage allocation process: a resource is divided, stage after stage, between two activities, each of which yields an immediate return and leaves behind a depleted remainder that is re-divided at the next stage. The chapter uses this process as…

10 thms2 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Analysis and Algorithms for Service Parts Supply Chains IV: Backorder Convexity and Everett's TheoremTextbook

Service parts (spares for aircraft, machines, and networks) are typically managed item by item with a one-for-one replenishment policy, the (s−1,s)(s-1, s)(s−1,s) policy: every unit withdrawn to meet a demand triggers an order for one replacement, so the inventory position stays at the stock level sss. A firm stocking thousands of such items at one location has to choose…

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

Fast Projection onto the Simplex and the ℓ1 Ball: Correctness of Condat's AlgorithmResearch Paper

The Euclidean projection of a vector onto the simplex — the nonnegative vectors whose entries sum to a fixed radius — is a subroutine of first-order methods whose iterates must stay probability vectors or nonnegative budgets: portfolio optimization, multispectral unmixing, image segmentation, constrained least squares and many machine-learning models.…

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

Linear Programming: Foundations and Extensions V: Convergence Rates of the Path-Following MethodTextbook

Interior-point methods are, together with the simplex method, the standard algorithms for linear programming, and the primal–dual path-following method is the form in which they are implemented in most solvers. Unlike the simplex method, it is a one-phase method: it can start from any point whose primal and dual variables are strictly positive, feasible or…

14 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryLinear Optimization+1·Captain: mikedeng1

Linear Programming: Foundations and Extensions III: Network Flows, the Integrality Theorem and König's TheoremTextbook

Minimum-cost network flow problems are the largest special class of linear programs met in practice: transportation, distribution, assignment, communication and electric networks, facility location and financial planning all reduce to moving material along the arcs of a directed network from supply nodes to demand nodes at least cost. Chapter 14 of R. J.…

7 thms2 active usersReviewed
🏆Completed
Convex OptimizationInformation TheoryLinear algebra+1·Captain: naimengye

Decoding by Linear Programming: Exact Recovery by ℓ1 Minimization under the Restricted Isometry ConditionResearch Paper

Consider the classical error-correcting problem. An input vector f∈Rnf \in \mathbb{R}^nf∈Rn (the plaintext) is encoded as Af∈RmAf \in \mathbb{R}^mAf∈Rm by a coding matrix AAA with m>nm > nm>n, and an unknown, arbitrary vector of errors eee corrupts the result, so that only y=Af+ey = Af + ey=Af+e is observed. Can fff be recovered exactly, and by an algorithm whose running time is polynomial in mmm? Can…

9 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingDynamical Systems·Captain: LG

Lindgren 2022: Dynamic-Programming Price Adjustment and Lyapunov StabilityResearch Paper

In a Walrasian pure exchange economy, agents trade a fixed stock of lll commodities, and a price vector p∈Rlp\in\mathbb R^lp∈Rl is a general equilibrium when aggregate excess demand vanishes. Existence of equilibrium (Arrow–Debreu, 1954) says nothing about how prices reach it. The classical tâtonnement model of Samuelson (1947), dpi/ds=ciZi(p)dp_i/ds = c_i Z_i(p)dpi​/ds=ci​Zi​(p), is not derived…

8 thms2 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Global Convergence of Splitting Methods for Nonconvex Composite Optimization IV: Descent and Stationary Cluster Points of the Proximal Gradient MethodResearch Paper

Many problems in statistics, signal processing and machine learning minimize a sum of a smooth loss and a nonsmooth regularizer: least squares with an ℓ0\ell_0ℓ0​ or ℓ1/2\ell_{1/2}ℓ1/2​ penalty, and constrained problems in which the regularizer is the indicator of a nonconvex set. The proximal gradient method (also called forward–backward splitting) is the standard…

13 thms2 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Global Convergence of Splitting Methods for Nonconvex Composite Optimization II: The Proximal ADMM Sequence Is Bounded Under CoercivityResearch Paper

The alternating direction method of multipliers (ADMM) splits a problem of the form min⁡xh(x)+P(Mx)\min_x h(x) + P(\mathcal M x)minx​h(x)+P(Mx) into a sequence of simpler subproblems, one in which the nonsmooth term PPP enters only through its proximal map and one in which only the smooth term hhh appears. For convex problems its convergence theory is classical. In signal processing and…

12 thms2 active usersReviewed
🏆Completed
CombinatoricsOperations Research·Captain: mikedeng1

Optimal Two- and Three-Stage Production Schedules with Setup Times Included 2: Johnson's Rule for Three MachinesResearch Paper

Johnson's 1954 paper in Naval Research Logistics Quarterly is the starting point of machine scheduling theory. Its first section solves the two-machine flow shop: nnn items must pass through machine 1 and then machine 2, and an explicit ordering rule minimizes the total elapsed time. Its second section treats three machines. There the problem "loses some of…

19 thms2 active usersReviewed
🏆Completed
Machine LearningStatistics·Captain: mikedeng1

Robustness and Generalization IV: Robustness of the Lasso on a Compact Sample SpaceResearch Paper

The Lasso (Tibshirani 1996, doi:10.1111/j.2517-6161.1996.tb02080.x) is ℓ1\ell_1ℓ1​-penalized least squares regression, one of the standard estimators of statistics and machine learning because it selects sparse coefficient vectors. Explaining why a learned Lasso predictor generalizes is less routine than it looks. The two classical routes are uniform convergence…

7 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchProbability·Captain: mikedeng1

Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program II: Stability of the Deterministic Equivalent Convex ProgramResearch Paper

A two-stage stochastic linear program with fixed recourse chooses a first-stage decision xxx before a random vector ξ\xiξ is observed, and then pays for a cheapest corrective action yyy once ξ\xiξ is known. It is the basic model of planning under uncertainty in operations research: capacity expansion, production planning with random demand, and energy dispatch are…

11 thms2 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program I: The Induced Feasibility Region Is a Closed Convex Polyhedron When T Is FixedResearch Paper

A two-stage stochastic program with recourse is a linear program in which a decision xxx is taken before a random vector ξ\xiξ is observed, and a corrective (recourse) decision yyy is taken afterwards at a cost. It is the basic model of planning under uncertainty in operations research: capacity expansion, production planning, energy dispatch and inventory models…

8 thms2 active usersReviewed
🏆Completed
Convex OptimizationNumerical AnalysisOperations Research·Captain: mikedeng1

A New Projection Method for Variational Inequality Problems: The Hyperplane Projection Method Converges to a Solution Under Continuity and Generalized MonotonicityResearch Paper

A variational inequality asks for a point of a convex set at which a vector field points "inward" against every feasible direction. The format covers the first-order optimality conditions of constrained optimization, nonlinear complementarity problems, traffic and economic equilibria (Wardrop, Walrasian, Nash–Cournot), and systems of nonlinear equations;…

16 thms2 active usersReviewed
🏆Completed
Linear algebraNumerical AnalysisOperations Research·Captain: mikedeng1

Conjugate Gradient Methods with Inexact Searches: The Self-Scaled Direction Is a Multiple of Beale's Restart DirectionResearch Paper

Conjugate gradient methods minimize a smooth function f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R using only gradients and a handful of stored vectors. This makes them the standard choice when nnn is too large for Newton or quasi-Newton methods, which store an n×nn\times nn×n matrix. On a strictly convex quadratic with exact line searches the classical method of Hestenes and Stiefel…

18 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchProbability·Captain: mikedeng1

Information Sharing in a Supply Chain with a Common Retailer 1: Under Production Diseconomy the Retailer Earns More from Sequential Information Contracting and the Manufacturers from ConcurrentResearch Paper

Retailers hold point-of-sale data that their suppliers cannot observe, and large retailers sell access to it through data-sharing programs (Costco's CRX, Walmart's Retail Link and similar programs). When one retailer carries the substitutable products of two competing manufacturers, sharing its demand information is a strategic decision: a manufacturer who…

17 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignOperations Research·Captain: mikedeng1

Algorithmic Mechanism Design VII: Compensation-and-Bonus Based on a Non-Optimal Approximation Algorithm Is Not TruthfulResearch Paper

Algorithmic mechanism design studies optimization problems whose inputs are held by self-interested agents: the algorithm must compute a good solution and, through payments, make it in each agent's interest to report its input honestly. Nisan and Ronen introduced the field with the problem of scheduling tasks on unrelated machines, where each machine is an…

5 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignOperations Research·Captain: mikedeng1

Algorithmic Mechanism Design III: No Additive Truthful Mechanism Achieves a c-Approximation for Task Scheduling for Any c < nResearch Paper

Algorithmic mechanism design studies optimization problems whose inputs are held by self-interested agents: an algorithm must not only compute a good solution but also pay the agents so that reporting their data truthfully is in their own interest. Nisan and Ronen introduced the field in Algorithmic Mechanism Design (Games Econ. Behav. 35, 2001) with task…

8 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryOperations Research·Captain: mikedeng1

A New Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem: Safe Shrinking of Customer SetsResearch Paper

The capacitated vehicle routing problem (CVRP) asks for minimum-cost routes, starting and ending at a depot, that serve every customer exactly once without any vehicle carrying more than its capacity. It is one of the central problems of operations research and logistics, and exact algorithms for it have been built on branch-and-cut for three decades: a…

13 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: mikedeng1

Selected Topics in Column Generation II: A Strictly Redundant Column Is Never Optimal for the Ratio Pricing ProblemResearch Paper

Column generation solves linear programs with far more columns than can be written down: a restricted master problem holds a few columns, its dual multipliers are passed to a pricing problem, and the pricing problem returns a column to add. It is the standard engine behind branch-and-price for vehicle routing, crew scheduling and cutting stock, where the…

3 thms2 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Global Convergence of Splitting Methods for Nonconvex Composite Optimization I: Cluster Points of the Proximal ADMM Are Stationary and Improve on a Non-Stationary StartResearch Paper

Many problems in statistics, signal processing and machine learning have the form

17 thms2 active usersReviewed
🏆Completed
Convex OptimizationFunctional AnalysisOperations Research·Captain: mikedeng1

Accelerated Proximal Point Method for Maximally Monotone Operators: The Fixed-Point Residual Rate of the Accelerated MethodResearch Paper

Many problems in optimization reduce to finding a zero of a maximally monotone operator: minimizing a closed proper convex function (its subdifferential is maximally monotone), finding a saddle point of a convex–concave function, and solving monotone variational inequalities. The basic algorithm for this problem is the proximal point method of Martinet…

10 thms2 active usersReviewed
PreviousPage 64 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