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
Operations ResearchProbabilityStochastic Systems·Captain: Shuze Chen

Modeling, Measuring and Managing Risk IX: Dual Representation of the Nested Average Value-at-RiskTextbook

Risk that unfolds over several periods is measured in two common ways. One adds up one-period measurements of each payment, each made with the information available one step earlier. The other composes one-period conditional measurements backwards in time, the way dynamic programming evaluates a policy. The second way is the one used in multistage…

6 thms2 active usersReviewed
🏆Completed
EconomicsLinear algebraOperations Research+1·Captain: Shuze Chen

Modeling, Measuring and Managing Risk XI: The Mean-Variance Efficient Portfolio in Closed FormTextbook

An investor who splits a budget across MMM risky assets faces a trade-off between expected return and risk. Markowitz proposed measuring risk by the variance of the portfolio return and selecting, for each required expected return, the portfolio of least variance (Markowitz 1952). Tobin added a risk-free asset (Tobin 1958), and Sharpe, Lintner and Mossin…

4 thms2 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: Shuze Chen

Modeling, Measuring and Managing Risk VI: Choquet Representation of Distortion FunctionalsTextbook

A distortion functional values an uncertain profit YYY by integrating its quantiles against a reweighting of the probability scale: small (bad) quantiles receive more weight, large ones less. The construction appears in actuarial pricing (the distortion premium principles of Denneberg and Wang), in decision theory (Yaari's dual theory of choice), and in…

9 thms2 active usersReviewed
🏆Completed
Functional AnalysisOperations ResearchProbability·Captain: Shuze Chen

Modeling, Measuring and Managing Risk IV: Kusuoka Representations of Version-Independent Acceptability FunctionalsTextbook

Risk measures used in portfolio optimization, insurance pricing and regulation are almost always law invariant: they assign a number to a random profit YYY that depends only on its distribution, not on the scenario in which each outcome occurs. Kusuoka (Kusuoka 2001) showed that on a non-atomic space every law-invariant coherent risk measure is the worst…

10 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: Shuze Chen

Robust Optimization XIII: Exact Quadratic Decision Rules on EllipsoidsTextbook

An adjustable decision is a rule that responds to information revealed after an optimization problem is specified. In production planning, for example, a later quantity may depend on observed demand, while an earlier commitment must remain constant. A robust counterpart requires the resulting decisions to satisfy the constraints for every realization in a…

5 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: Shuze Chen

Robust Optimization XIV: Extreme-Scenario Reduction in Multistage InventoryTextbook

An inventory manager chooses replenishment orders before knowing all future demand. Orders made today affect both the stock available tomorrow and the cost of later decisions. A flexible commitment contract adds another consideration: deviations from previously announced orders can incur penalties. The uncertainty therefore concerns a sequence of…

2 thms2 active usersReviewed
🏆Completed
Convex OptimizationMachine LearningOperations Research·Captain: Shuze Chen

Robust Optimization XI: Finite Reformulations of Worst-Case Convex LossTextbook

Regression and classification fit a parameter vector to observed data. When measurements can vary within a prescribed set, a fit judged only at the nominal observations need not control its loss on the possible data. A worst-case loss constraint requires the loss bound to hold for every admissible matrix of measurements. Such a requirement can contain…

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

Robust Optimization II: Safe Robust Counterparts for Bounded Random PerturbationsTextbook

A linear constraint can fail when its coefficients vary. In an engineering or planning model, requiring it to hold for every imaginable realization may exclude useful decisions, while checking it only at an average realization may give little control over failure. A chance constraint specifies an acceptable probability of violation. Chapter 2 of Ben-Tal, El…

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

Robust Optimization IV: The Bernstein Uncertainty SetTextbook

An optimization model can require a linear inequality to hold with high probability when its coefficients are random. Such a chance constraint controls the probability of violation, but its feasible set need not be convex or easy to describe. A conservative convex approximation can make the requirement usable within a larger optimization model. Chapter 4 of …

6 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: Shuze Chen

Robust Optimization III: Global Sensitivity for Linear ConstraintsTextbook

A resource constraint can remain useful even when an exceptional disturbance makes exact satisfaction impractical. In such cases the model needs to distinguish the disturbances against which feasibility is mandatory from those for which a controlled violation is acceptable. Ordinary robust optimization specifies a set of perturbations and requires the…

1 thm2 active usersReviewed
🏆Completed
Mechanism DesignOperations Research·Captain: mikedeng1

Optimal Auction Design with Deferred Inspection and Reward: The Optimal Single-Agent Auction Has Best-Alternative Bid b(v) = G⁻¹(G(v) − G(v̲)) and a Continuous AllocationResearch Paper

A seller who can inspect a buyer's true value after receiving a bid can use the bid as a refundable deposit. A truthful buyer may receive a reward, while a buyer whose report is false forfeits the deposit. This changes the incentive constraint: a buyer who considers reporting www compares her truthful utility with vx(w)−wv x(w)-wvx(w)−w, not with the payoff from a…

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

Adaptive Bin Packing with Overflow: Budgeted Greedy Has Expected Cost at Most (3 + 2√2) Times That of the Optimal Policy for I.I.D. Item SizesResearch Paper

Sequential packing matters when an item's size is known statistically before placement but revealed only afterward. A connection request has uncertain bandwidth, a shipment has uncertain final weight, and a virtual machine has uncertain resource use. In each example, exceeding capacity can have a separate cost from opening another container. Perez-Salazar,…

10 thms2 active usersReviewed
🏆Completed
Numerical AnalysisOperations Research·Captain: mikedeng1

A Stochastic Sequential Quadratic Optimization Algorithm for Nonlinear-Equality-Constrained Optimization with Rank-Deficient Jacobians: A Vanishing Merit Parameter Forces liminf ‖J_kᵀc_k‖ = 0Research Paper

Many problems in machine learning, optimal control and data-driven engineering design take the form of minimizing an expected loss f(x)=E[F(x,ι)]f(x) = \mathbb E[F(x,\iota)]f(x)=E[F(x,ι)] subject to deterministic nonlinear equality constraints c(x)=0c(x) = 0c(x)=0. When fff is an expectation over a large or unknown distribution, only stochastic gradient estimates gk≈∇f(xk)g_k \approx \nabla f(x_k)gk​≈∇f(xk​) are…

11 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: Shuze Chen

Interior Point Algorithms VII: The Homogeneous Model for Monotone Complementarity and Its Central StepTextbook

The monotone complementarity problem (MCP) asks, for a continuous monotone map fff on the positive orthant, for a pair (x,s)(x,s)(x,s) with s=f(x)s=f(x)s=f(x), x≥0x\ge0x≥0, s≥0s\ge0s≥0 and xjsj=0x_js_j=0xj​sj​=0 for every jjj. It contains linear programming, convex quadratic programming, the monotone linear complementarity problem and the Karush–Kuhn–Tucker conditions of smooth convex programs.…

10 thms2 active usersReviewed
🏆Completed
Linear OptimizationNumerical AnalysisOperations Research·Captain: Shuze Chen

Interior Point Algorithms VI: Predictor Directions Are O(μ) on the Optimal PartitionTextbook

Primal-dual interior-point methods for linear programming come with two kinds of guarantee. The worst-case one is a bound of O(nlog⁡(R/ϵ))O(\sqrt n\log(R/\epsilon))O(n​log(R/ϵ)) iterations to reduce the duality gap below ϵ\epsilonϵ. The asymptotic one says what happens to the duality gap near the end of the run, where practical codes spend their final iterations. For the…

11 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchProbability·Captain: Shuze Chen

Interior Point Algorithms V: Random Gaussian Feasibility Problems Are Strictly Feasible on One SideTextbook

Worst-case analysis of interior-point methods gives iteration bounds of order n L\sqrt n\,Ln​L or nlog⁡(1/ϵ)\sqrt n\log(1/\epsilon)n​log(1/ϵ), while practical codes finish in a number of iterations that barely grows with the problem size. Chapter 6 of Yinyu Ye's Interior Point Algorithms: Theory and Analysis (Wiley 1997, doi:10.1002/9781118032701) addresses the gap…

6 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: Shuze Chen

Interior Point Algorithms III: The Primal-Dual Potential Function Falls by a Constant Every StepTextbook

Karmarkar's 1984 algorithm solved linear programs in polynomial time by reducing a logarithmic potential function by a constant at every step (doi:10.1007/BF02579150). Its successors replaced Karmarkar's projective transformations with a primal-dual potential that measures the duality gap and the distance from the central path together. Tanabe, and Todd and…

7 thms2 active usersReviewed
🏆Completed
Linear OptimizationNumerical AnalysisOperations Research·Captain: Shuze Chen

Interior Point Algorithms II: Proximity Measures and Newton Steps for the Analytic CenterTextbook

Interior-point methods for linear programming do not move along the boundary of the feasible region; they follow a curve of points that stay "central". The basic notion of centrality is the analytic center of a polytope, the interior point that maximizes the product of the slacks of its defining inequalities (Sonnevend, 1986, doi:10.1007/BFb0043914). Every…

8 thms2 active usersReviewed
🏆Completed
Linear OptimizationNumerical AnalysisOperations Research·Captain: Shuze Chen

Primal-Dual Interior-Point Methods V: Below a Threshold μ̄ the Projection Step Returns a Strictly Complementary SolutionTextbook

Primal-dual interior-point methods for linear programming generate strictly positive iterates that approach the solution set but never reach it: the duality measure μ\muμ tends to zero, yet no iterate is ever an exact solution. Many applications need more than an approximate point — an exact optimal basis, a vertex, or the optimal partition of the variables…

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

Primal-Dual Interior-Point Methods VI: The Simplified Homogeneous Self-Dual Form Decides Whether an LP Has a SolutionTextbook

Interior-point methods for linear programming are usually analysed under the assumption that the primal-dual pair has a strictly feasible point, or at least a solution. A solver used in practice cannot assume this: it must either return a solution or report that the primal or the dual problem is infeasible. The homogeneous self-dual approach embeds the…

10 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: Shuze Chen

Primal-Dual Interior-Point Methods IV: The Infeasible Path-Following Method Drives μ to Zero Q-LinearlyTextbook

Primal-dual interior-point methods solve a linear program by following the central path from a point with strictly positive primal variables xxx and dual slacks sss. The classical analysis assumes that the starting point is feasible: it already satisfies the equality constraints Ax=bAx = bAx=b and ATλ+s=cA^{\mathsf T}\lambda + s = cATλ+s=c. In practice such a point is rarely…

10 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: Shuze Chen

Primal-Dual Interior-Point Methods III: A Full Short Step Keeps the Iterate in the Neighborhood N₂(θ)Textbook

Primal-dual interior-point methods are the standard polynomial-time algorithms for linear programming and the basis of most commercial LP solvers. Among them, path-following methods are the ones with the cleanest complexity theory: they keep every iterate inside a neighborhood of the central path and shrink the duality measure by a fixed factor per step.…

10 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: Shuze Chen

Primal-Dual Interior-Point Methods II: The Kojima–Mizuno–Yoshise Step Lowers the Potential Φ_ρ by 0.15Textbook

Interior-point methods solve linear programs by moving through the interior of the feasible region instead of along its edges. Two families dominate the theory: path-following methods, which keep the iterates near a central path, and potential-reduction methods, which instead measure progress by a single merit function and only ask that it fall by a fixed…

10 thms2 active usersReviewed
🏆Completed
Convex OptimizationLinear OptimizationOperations Research·Captain: Shuze Chen

Primal-Dual Interior-Point Methods I: The Primal-Dual Log Barrier Has a Unique Minimizer, So the Central Path ExistsTextbook

Primal-dual interior-point methods are the standard polynomial-time algorithms for linear programming and the basis of most commercial LP solvers. They do not move along the boundary of the feasible polyhedron, as the simplex method does. Instead they follow a curve through its interior, the central path, toward the solution set. Every convergence and…

6 thms2 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: Shuze Chen

Pricing and the Newsvendor Problem: A Review with Extensions: If 2r(z)² + r′(z) > 0 and a − b(c − 2s) + A > 0, the Additive-Demand Pricing Newsvendor Has a Unique Optimal Stocking Factor z*Research Paper

A retailer of a seasonal or perishable product must commit to a stock level before demand is known, and must also choose the price at which to sell. The two decisions interact: the price shifts the demand distribution, and the stock level determines how much of that demand can be served. The price-setting newsvendor is the single-period model of this…

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