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

Cross-Category Retailing Management: Substitution and Complementarity: Optimal Cross-Selling Prices Equalize Aggregate Markups, and the Optimal Profit Is the Unique Fixed Point of HResearch Paper

Retailers often sell products from two categories that are bought one after the other: a television and then a speaker, a laptop and then a mouse, a suit and then a tie. The first purchase changes how much the second is worth to the consumer, which is called a complementarity effect, and online stores act on it by showing secondary products only after a…

6 thms3 active usersReviewed
🏆Completed
Machine LearningOperations ResearchStatistics·Captain: mikedeng1

Stochastic Optimization Forests: the approximate risk criterion consistently approximates the oracle splitting criterion as the region to split shrinksResearch Paper

In contextual stochastic optimization a decision z∈Rdz\in\mathbb R^dz∈Rd is chosen after observing features X∈RpX\in\mathbb R^pX∈Rp, and the ideal policy solves, for each feature value,

9 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimal TransportProbability·Captain: mikedeng1

Distributionally Robust Linear and Discrete Optimization with Marginals: the worst-case expected optimal value over a Fréchet class equals its Lagrangian primal and dual formsResearch Paper

Many decision problems in operations research end in a linear optimization over a finite set of alternatives whose objective coefficients are random: the longest path in a project network with random activity durations, a maximum-weight assignment or spanning tree with random weights, the best item in a ranking with random utilities. The quantity of…

11 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Surge Pricing and Its Spatial Supply Response: Within an Attraction Region, Supply Fills the Congestion Bound Outward from the Sink at Locally Optimal Prices Without Loss of RevenueResearch Paper

Ride-hailing platforms change prices by location in real time, and drivers respond by moving. A price increase at one location changes where drivers go, how congested each location becomes, and therefore what every driver earns everywhere else. Besbes, Castro and Lobel, Surge Pricing and its Spatial Supply Response (SSRN 3124571, version of May 17, 2019;…

12 thms3 active usersReviewed
🏆Completed
Convex OptimizationProbability·Captain: mikedeng1

Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization: Lower Bounds on the Smallest Eigenvalue of Boltzmann Covariance Matrices over a Convex BodyResearch Paper

Interior point methods for convex optimization need a self-concordant barrier for the feasible set, and for many convex bodies, such as the subtour elimination polytope, membership can be decided in polynomial time while no efficiently computable barrier is known. The entropic barrier of Bubeck and Eldan (arXiv:1412.1587) is a self-concordant barrier…

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

On Optimality Conditions for Nonlinear Conic Programming: Under the Generalized Łojasiewicz Inequality, Feasible Limit Points of the Augmented Lagrangian Method Satisfy CAKKTResearch Paper

Nonlinear conic programming covers nonlinear programming (NLP), nonlinear semidefinite programming (NLSDP) and nonlinear second-order cone programming (NSOCP) in one model: minimize a smooth objective subject to the requirement that a smooth map takes values in a closed convex cone. The classical first-order necessary condition, the Karush–Kuhn–Tucker (KKT)…

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

Convex Optimization for Bundle Size Pricing Problem: the Cross-Moment-Model Profit Is Concave in Choice ProbabilitiesResearch Paper

In bundle size pricing (BSP) a seller of many products offers a menu of bundles in which the price of a bundle depends only on its size, the number of items in it. Customers choose which items to put in a bundle and which size to buy. Season tickets for theatres and sports teams, cable-TV channel packages and streaming plans priced by the number of…

10 thms3 active usersReviewed
🏆Completed
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences: Revenue Lower Bound for the Assignment Rounded from Dynamic-Programming ActionsResearch Paper

Retailers, online travel agencies and search engines display products in an ordered list or on a physical layout, and customers inspect only a prefix of it. Display optimization asks how to assign products to positions so as to maximize expected revenue when each customer considers only the products shown in the first kkk positions, with kkk random. Aouad and…

8 thms3 active usersReviewed
🏆Completed
Machine LearningOperations ResearchProbability·Captain: mikedeng1

Distributed Stochastic Optimization with Large Delays: Under Polynomially Growing Delays, Asynchronous SGD with Tuned Step-Sizes Drives the Mean-Square Gradient Norm to ZeroResearch Paper

Large-scale learning problems, such as empirical risk minimization over millions of samples, are solved in practice by stochastic gradient descent (SGD) run on many processors at once. In a master–worker system, or in a multi-processor system with shared memory, a worker reads the current parameter, computes a stochastic gradient and writes its update back.…

13 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchProbability·Captain: mikedeng1

Model-Free Bounds for Multi-Asset Options Using Option-Implied Information and Their Exact Computation: Under No-Arbitrage with Bid–Ask Spreads, the Superhedging Price ϕ(f) Equals sup_{μ∈Q} ∫f dμResearch Paper

A trader who quotes an exotic option written on several underlying assets (a basket call, a spread option, a best-of option) needs a price range that does not rest on a particular stochastic model. What is observed in the market is a finite set of liquid derivatives (vanilla calls and puts on each asset, and possibly some traded basket options), each with a …

9 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchProbability·Captain: mikedeng1

Time Consistency of the Mean-Risk Problem: The Upper Images of the Dynamic Mean-Risk Problem Satisfy a Set-Valued Bellman RecursionResearch Paper

Markowitz's mean-variance problem trades off the expected terminal wealth of a portfolio against its risk. Over several periods the scalarized form of this problem is time inconsistent: a strategy that is optimal today for a fixed risk-aversion parameter is generally no longer optimal tomorrow for the same parameter, so the investor would deviate from her…

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

A Moment-Sum-of-Squares Hierarchy for Robust Polynomial Matrix Inequality Optimization with Sum-of-Squares Convexity: Both Bounds of the Hierarchy Decrease to the Robust Optimum f⋆Research Paper

Many problems in control, robust semidefinite programming and risk management ask for a decision yyy that keeps a matrix positive semidefinite for every value of an uncertain parameter xxx in a set X\mathcal XX. Examples include robust polynomial SDPs (Scherer and Hol, 2006), Lyapunov-type conditions that must hold on a region of the state space, and robust…

11 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators: Optimal Tolls Bounded by the Marginal Tolls Are (Strong) Cap EquilibriaResearch Paper

Congestion pricing charges road users for the delay they impose on others. The classical theory, going back to Beckmann, McGuire and Winsten (1956), assumes a single benevolent authority that sets every toll: charging each link its marginal toll makes the selfish (Wardrop) traffic pattern socially optimal. Many real networks are different. Roads, bridges…

8 thms3 active usersReviewed
🏆Completed
CombinatoricsDiscrete GeometryLinear Optimization+1·Captain: mikedeng1

Binary Extended Formulations and Sequential Convexification: Among All d-Hypercube Binarizations, the Logarithmic Binarization Has Minimum RankResearch Paper

Mixed-integer programs often contain general integer variables x∈{0,…,k}x \in \{0, \dots, k\}x∈{0,…,k}. A standard modelling device replaces such a variable by ddd binary variables y∈{0,1}dy \in \{0,1\}^dy∈{0,1}d linked to xxx through a polytope, a binarization. Examples are the unary encoding, the "full" encoding with one indicator per value, and the logarithmic encoding x=∑i2i−1yix = \sum_i 2^{i-1} y_ix=∑i​2i−1yi​.…

15 thms3 active usersReviewed
🏆Completed
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem: For Every ε > 0 the Cluster Dynamic Program Returns a Feasible Solution Within Factor 1 − ε of OptimalResearch Paper

The incremental knapsack problem is a multi-period extension of the binary knapsack problem. Items are inserted over a planning horizon whose capacity grows over time, and an item, once inserted, stays. Sharp (2007) and Hartline (2008) introduced it in their theses on incremental optimization. It models resource allocation in which the available budget…

14 thms3 active usersReviewed
🏆Completed
Convex OptimizationLinear OptimizationOperations Research+1·Captain: Shuze Chen

Modeling, Measuring and Managing Risk X: Dual Representation of Polyhedral Acceptability FunctionalsTextbook

Risk measures enter optimization models as objectives or constraints, and the models that use them most, multi-stage stochastic programs, are solved as large linear programs. A risk functional is only usable there if it can itself be written as the value of a linear program. Eichhorn and Römisch introduced polyhedral risk measures for this purpose (doi:10.11…

9 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchProbability+1·Captain: Shuze Chen

Modeling, Measuring and Managing Risk VII: Dual Representation of Minimal Loss Deviation FunctionalsTextbook

A deviation functional measures how far a random profit YYY spreads around its mean: the variance, the standard deviation, the mean absolute deviation from the median, and the average value-at-risk deviation are the standard examples in portfolio selection and in risk-averse stochastic programming. Pflug and Römisch, Modeling, Measuring and Managing Risk (Worl…

6 thms3 active usersReviewed
🏆Completed
Functional AnalysisOperations ResearchProbability·Captain: Shuze Chen

Modeling, Measuring and Managing Risk V: Dual Representation of Conditional Acceptability MappingsTextbook

A risk measure that returns a single number answers the question "how acceptable is this random profit, seen from today?". Multi-period decision problems — portfolio rebalancing, insurance reserves, stochastic programs on scenario trees — need the same question asked at every later date, given the information available then. The answer is no longer a number…

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

Robust Optimization I: Conic Representations of Robust Linear ConstraintsTextbook

A production or allocation decision can satisfy a linear constraint for nominal data and violate it when those data change. Robust optimization asks for a decision that satisfies the constraint for every realization in a prescribed uncertainty set. The uncertainty set is part of the model: the requirement does not attach probabilities to its elements, and…

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

Penalty and Augmented Lagrangian Methods for Constrained DC Programming: Feasible Accumulation Points of the Penalty Method Are B-Stationary under the Pointwise Slater Constraint QualificationResearch Paper

A DC function is a difference of two convex functions. Programs whose objective and constraints are DC functions model sparse estimation with nonconvex penalties, affine sparsity constraints, piecewise-affine regression and several problems in signal processing and finance. Constraints of DC type make the feasible region nonconvex and nonsmooth, and the…

15 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Characterizing and Computing the Set of Nash Equilibria via Vector Optimization: Shared Constraint Nash Equilibria Are Exactly the Pareto Optimal Points Under a Non-Convex Ordering ConeResearch Paper

A Nash equilibrium is a feasible choice of strategies at which no player can lower her own cost by changing her strategy alone. A Pareto minimizer is a feasible point that cannot be improved under a specified comparison of vector outcomes. These ideas usually select different points: a change that helps several players at once is relevant to ordinary Pareto…

7 thms3 active usersReviewed
🏆Completed
Machine LearningOperations ResearchStatistics·Captain: mikedeng1

Accelerated MM Algorithms for Ranking Scores Inference from Comparison Data: Rescaled MM for Bradley–Terry MAP Estimation Contracts the Log-Posterior Gap at a Rate Set by Algebraic ConnectivityResearch Paper

Paired-comparison data (which of two items a user clicked, which of two players won a game, which of two products a respondent preferred) are summarised by ranking scores, one real number per item. The Bradley–Terry model (Bradley and Terry, 1952) is the standard statistical model for such scores, and its parameters are estimated by maximum likelihood or by…

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

A Unified Analysis of a Class of Proximal Bundle Methods for Solving Hybrid Convex Composite Optimization Problems: An Iteration-Complexity Bound for Every GPB VariantResearch Paper

Bundle methods minimize a convex objective while using local supporting affine functions to represent a component that may be nonsmooth. Their iterations can spend time improving the model without moving the current proximal center, so a bound on useful center changes alone does not bound the total work. Liang and Monteiro study a common generic proximal…

10 thms3 active usersReviewed
🏆Completed
Machine Learning·Captain: mikedeng1

How Well do LLMs Compress Their Own Chain-of-Thought? A Token Complexity Approach: The Optimal Accuracy-Length Tradeoff Solves the Questions of Smallest Token Complexity FirstResearch Paper

Large language models answer reasoning questions better when they are allowed to write out a chain of thought (CoT) before the final answer, but every generated token costs time and money. A large body of recent work therefore asks models to "think less": prompts such as "be concise" or "use at most 10 words", and training methods that shorten the reasoning…

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

Dynamic Risked Equilibrium: Every Multistage Risk-Trading Equilibrium Solves the Social Planning Complementarity ProblemResearch Paper

Electricity systems with hydro storage, and many other resource systems, are operated over time under uncertain inflows. In a centrally planned system a single risk-averse planner chooses releases and storage to minimize a nested (time-consistent) coherent risk measure of total cost. In a deregulated system the same decisions are taken by many agents, each…

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