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

On the Power and Limitations of Affine Policies in Two-Stage Adaptive Optimization III: The Best Affine Policy Can Cost More Than m^(1/2−δ)/4 Times the Fully Adaptable OptimumResearch Paper

Two-stage adaptive optimization models decisions taken in two steps: a first-stage decision xxx is fixed before an uncertain right-hand side bbb is revealed, and a second-stage recourse y(b)y(b)y(b) is chosen afterwards, with the worst case over an uncertainty set U\mathcal UU to be minimized. The fully-adaptable problem, in which yyy may be an arbitrary function of bbb, is…

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

Deriving Robust Counterparts of Nonlinear Uncertain Inequalities: For a Regular Nominal Vector, a Concave Uncertain Constraint Holds Robustly iff Its Fenchel Counterpart (FRC) Is SolvableResearch Paper

In robust optimization, a decision must satisfy a constraint for every parameter value in a prescribed uncertainty set. A nonlinear uncertain constraint can be difficult to use directly because it contains a universal condition over a continuum of parameters. Ben-Tal, den Hertog, and Vial study constraints whose value is concave in the uncertain parameter.…

7 thms4 active usersReviewed
🏆Completed
Convex OptimizationMachine Learning·Captain: mikedeng1

Katyusha: The First Direct Acceleration of Stochastic Gradient Methods 2: Without Strong Convexity, Katyusha^ns Reaches Error O((F(x₀)−F(x*))/S² + L‖x₀−x*‖²/(mS²))Research Paper

Many problems in machine learning and statistics are regularized empirical risk minimization: minimize an average f(x)=1n∑i=1nfi(x)f(x)=\frac1n\sum_{i=1}^n f_i(x)f(x)=n1​∑i=1n​fi​(x) of nnn loss terms, one per data point, plus a regularizer ψ(x)\psi(x)ψ(x) such as λ∥x∥1\lambda\|x\|_1λ∥x∥1​. When nnn is large, a full gradient ∇f\nabla f∇f costs nnn component gradients, so stochastic gradient methods that touch one fif_ifi​ per…

26 thms4 active users
🏆Completed
Linear OptimizationOperations Research·Captain: mikedeng1

On the Power and Limitations of Affine Policies in Two-Stage Adaptive Optimization II: With m + 3 Extreme Points the Best Affine Policy Can Cost More Than (2 − δ) Times the OptimumResearch Paper

Two-stage adaptive optimization models decisions made in two steps: a first-stage decision is fixed before an uncertain parameter is revealed, and a second-stage (recourse) decision may then depend on the realized value. In the robust version, the uncertain parameter ranges over an uncertainty set and the objective is the worst-case cost. Such models arise…

8 thms4 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: mikedeng1

On the Power and Limitations of Affine Policies in Two-Stage Adaptive Optimization I: An Affine Policy Is Optimal When the Uncertainty Set Is a SimplexResearch Paper

Two-stage adaptive optimization models decisions taken in two rounds: a first-stage decision xxx is fixed before an uncertain parameter is revealed, and a second-stage decision y(b)y(b)y(b) is chosen after the parameter bbb is observed, so that the second stage may depend on bbb arbitrarily. The objective is the worst case over an uncertainty set U\mathcal UU of possible…

7 thms4 active usersReviewed
🏆Completed
Convex Optimization·Captain: mikedeng1

Mirror Descent and Nonlinear Projected Subgradient Methods for Convex Optimization: Entropic Mirror Descent on the Unit Simplex Attains min_{s≤k} f(x^s) − min f ≤ √(2 ln n)·L_f/√kResearch Paper

Large-scale nonsmooth convex problems, such as minimising a Lipschitz convex function over a probability simplex with millions of coordinates, are routinely solved by first-order methods that use one subgradient per iteration. The classical projected subgradient method reaches accuracy ε\varepsilonε after O(L2R2/ε2)O(L^2 R^2/\varepsilon^2)O(L2R2/ε2) iterations, where LLL and RRR are…

18 thms4 active users
🏆Completed
CombinatoricsGraph TheoryOperations Research+1·Captain: mikedeng1

Maximal Flow Through a Network II: In an ab-Planar Network Some Chain from Source to Sink Meets Every Cut Exactly OnceResearch Paper

The maximum flow problem asks how much of a commodity can be shipped from a source to a sink through a network whose arcs have limited capacities. L. R. Ford, Jr. and D. R. Fulkerson's 1956 paper Maximal Flow Through a Network proved the minimal cut theorem: the largest flow value equals the smallest total capacity of a set of arcs that separates source…

10 thms4 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: mikedeng1

Maximization of a Linear Function of Variables Subject to Linear Inequalities: Under Nondegeneracy the Simplex Technique Ends in Infeasibility, Unboundedness, or a Maximum Feasible SolutionResearch Paper

Linear programming asks for the best value of a linear objective under linear constraints. In the form studied by George B. Dantzig in 1951, all variables are nonnegative and the constraints are equalities. The simplex technique moves between small sets of columns, seeking a feasible vector first and then improving its objective. Its basic promise is…

9 thms4 active usersReviewed
🏆Completed
Linear algebraMachine LearningReinforcement Learning·Captain: mikedeng1

Reinforcement Learning: An Introduction X: Off-policy Divergence and the Gradient of the Projected Bellman ErrorTextbook

Off-policy learning estimates the value function of a target policy π\piπ from data generated by a different behavior policy bbb. It is how an agent learns about a greedy policy while exploring, and how many policies can be evaluated from one stream of experience. Combined with linear function approximation and bootstrapping (updating an estimate toward other…

14 thms4 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryOperations Research·Captain: mikedeng1

Maximal Flow Through a Network I: The Minimal Cut Theorem — the Maximal Flow Value Equals the Minimum Value of a Disconnecting SetResearch Paper

The question behind this mission was posed by T. E. Harris to L. R. Ford, Jr. and D. R. Fulkerson at RAND, in the setting of rail transport: given a rail network linking two cities, with a capacity on every link, find the largest steady flow from one city to the other. Ford and Fulkerson's answer, the minimal cut theorem, published in the Canadian Journal…

13 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryConvex OptimizationMachine Learning·Captain: mikedeng1

Blackwell Approachability and No-Regret Learning are Equivalent 3: An Efficient Forecaster Whose (ℓ1, ε)-Calibration Rate Is at Most √(2/(εT))Research Paper

A forecaster announces, each day, a probability that it will rain; afterwards nature reveals whether it did. The forecaster is calibrated if, on the days on which it announced roughly 30%, it rained roughly 30% of the time, and likewise for every other announced value. Calibration is a minimal consistency requirement for probabilistic forecasts, used in…

11 thms4 active usersReviewed
🏆Completed
Convex OptimizationFunctional Analysis·Captain: mikedeng1

The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster than 1/k^2 II: For α > 3, the Iterates Converge Weakly to a Minimizer of Ψ + ΦResearch Paper

Many problems in signal processing, statistics and machine learning take the additively separable form

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

Maximum Matching and a Polyhedron With 0,1-Vertices: The Vertices of the Matching Polyhedron Are Exactly the Matching VectorsResearch Paper

A matching in a graph is a set of edges no two of which share a node. Given a real weight on every edge, the maximum-weight matching problem asks for a matching of largest total weight. It is one of the basic problems of combinatorial optimization: assignment, pairing and scheduling problems reduce to it, and it is the standard example of a combinatorial…

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

On the Douglas–Rachford Splitting Method and the Proximal Point Algorithm for Maximal Monotone Operators: Generalized Douglas–Rachford Splitting Converges Weakly if A+B Has a Zero, Else Is UnboundedResearch Paper

Many problems in convex optimization, variational inequalities and equilibrium modelling reduce to finding a point xxx with 0∈Ax+Bx0 \in A x + B x0∈Ax+Bx, where AAA and BBB are maximal monotone operators on a real Hilbert space H\mathcal HH: for example, minimizing f+gf + gf+g for closed proper convex f,gf, gf,g is the case A=∂fA = \partial fA=∂f, B=∂gB = \partial gB=∂g. When the resolvent of A+BA + BA+B is hard…

18 thms4 active usersReviewed
🏆Completed
Discrete GeometryLinear OptimizationOperations Research+1·Captain: mikedeng1

Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time 1: The Expected Shadow of a Gaussian-Perturbed Polytope Has Polynomially Many VerticesResearch Paper

The simplex method solves linear programs very fast in practice, yet for most pivot rules there are inputs on which it takes exponentially many steps (Klee and Minty, 1972, for Dantzig's rule; Goldfarb, 1983, for the shadow-vertex rule). Average-case analyses (Borgwardt, 1980s; Smale, 1983) explained good behaviour on random inputs, but random inputs look…

31 thms4 active usersReviewed
🏆Completed
Operations ResearchStochastic Systems·Captain: mikedeng1

A Characterization of Waiting Time Performance Realizable by Single-Server Queues: The Conservation-Law Polytope Is the Convex Hull of the Preemptive Priority VectorsResearch Paper

A single server shared by several classes of jobs must decide, at every moment, which class to serve. Different scheduling rules give different mean response times to the classes, and a system designer often starts from the other end: a target vector of mean response times, one per class, and the question whether any rule can meet it. Coffman and Mitrani…

32 thms4 active users
🏆Completed
Convex OptimizationProbability·Captain: mikedeng1

The Entropic Barrier: A Simple and Optimal Universal Self-Concordant Barrier: The Entropic Barrier of a Convex Body in ℝⁿ Is a (1 + εₙ)n-Self-Concordant Barrier with εₙ ≤ 100√(log n / n)Research Paper

Interior-point methods minimize a linear function x↦⟨c,x⟩x\mapsto\langle c,x\ranglex↦⟨c,x⟩ over a convex set K⊂Rn\mathcal K\subset\mathbb R^nK⊂Rn by following the minimizers of ⟨c,x⟩+1tg(x)\langle c,x\rangle+\frac1t g(x)⟨c,x⟩+t1​g(x) as t→∞t\to\inftyt→∞, where ggg is a self-concordant barrier for K\mathcal KK. Each Newton step of such a method shrinks 1/t1/t1/t by a factor 1−1/ν1-1/\sqrt\nu1−1/ν​, where ν\nuν is the self-concordance…

24 thms4 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Air Travel Demand and Airline Seat Inventory Management II: The EMSR Protection Level for Two Nested Fare ClassesTextbook

An airline sells the seats of one flight in several fare classes at different prices, all drawn from one shared cabin. Discount fares are bought early, under advance-purchase restrictions, while most high-fare requests arrive close to departure. Accepting every early low-fare request fills the aircraft with cheap passengers and turns away late high-fare…

8 thms4 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchProbability·Captain: mikedeng1

Air Travel Demand and Airline Seat Inventory Management I: Marginal Seat Allocation Among Distinct Fare ClassesTextbook

An airline sells the seats of one flight leg at several prices. Low fares fill seats that would otherwise fly empty; high fares are bought by passengers who book late and cannot be predicted exactly. Seat inventory control decides how many seats each fare class may sell. Peter Belobaba's 1987 MIT dissertation (MIT Flight Transportation Laboratory Report…

8 thms4 active usersReviewed
🏆Completed
Convex OptimizationNumerical Analysis·Captain: mikedeng1

The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster than 1/k^2 I: For α > 3, (Ψ + Φ)(x_k) − min(Ψ + Φ) = o(k⁻²) and ‖x_{k+1} − x_k‖ = o(k⁻¹)Research Paper

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

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

Project Scheduling with Time Windows and Scarce Resources IV: Every Feasible Schedule Obeys a Minimal Delaying Mode of Each Forbidden SetTextbook

Resource-constrained project scheduling with general temporal constraints, written PS∣temp∣Cmax⁡PS|temp|C_{\max}PS∣temp∣Cmax​, asks for start times of the activities of a project that respect minimum and maximum time lags between activities and the capacities of renewable resources (staff, machines, reactors), and that minimize the project duration. Deciding whether a feasible…

8 thms4 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchTheoretical Computer Science·Captain: mikedeng1

Real-Time Optimization of Personalized Assortments: Inventory Balancing Is α_cmin(Ψ)-CompetitiveResearch Paper

Online retailers choose, customer by customer, which products to display. The customer's type (location, history, device) is revealed on arrival. Inventories are finite and are not replenished during the selling season. A seller who shows every customer the currently most profitable products can sell out a product early and leave nothing for later customers…

14 thms4 active usersReviewed
🏆Completed
Numerical AnalysisOperations Research·Captain: mikedeng1

Minimization Methods for Non-Differentiable Functions VIII: Quadratic Convergence of the Gradient Orthogonalization Method for Nonlinear EquationsTextbook

Solving a square system of nonlinear equations ψi(x)=0\psi_i(x) = 0ψi​(x)=0, i=1,…,ni = 1, \dots, ni=1,…,n, x∈Rnx \in \mathbb{R}^nx∈Rn, is one of the oldest tasks of numerical analysis. It appears whenever optimality conditions, equilibrium conditions or discretized differential equations have to be solved. N. Z. Shor's Minimization Methods for Non-Differentiable Functions (Springer 1985,…

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

Minimization Methods for Non-Differentiable Functions V: Polyak's Stepsize and Fejér-Type ApproximationsTextbook

The subgradient method for a convex function fff moves from xkx_kxk​ against a subgradient gf(xk)g_f(x_k)gf​(xk​), and everything hinges on the step length. Divergent-series stepsizes guarantee convergence but are slow and need no information about fff. When the optimal value f∗f^*f∗, or any level ccc that is known to be attainable, is available, B. T. Polyak proposed in 1969 the step

11 thms4 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchProbability+1·Captain: mikedeng1

A Dynamic Near-Optimal Algorithm for Online Linear Programming II: A Lower Bound for Every Online AlgorithmResearch Paper

Online linear programming models resource allocation under uncertainty about future demand: requests arrive one at a time, each asking for some amounts of mmm resources and offering a payment, and each must be accepted or rejected, irrevocably, on arrival. Airline seat and hotel room revenue management, online routing with bandwidth limits and the allocation…

7 thms4 active usersReviewed
PreviousPage 18 of 93Next

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