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 ResearchTheoretical Computer Science·Captain: mikedeng1

Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? 2: Random-Hyperplane Rounding Approximates Balanced MAX-2SAT within β ≈ 0.943Research Paper

MAX-2SAT asks for an assignment of Boolean variables that maximizes the total weight of satisfied clauses, each clause being a disjunction of two literals. It is one of the basic constraint satisfaction problems of approximation theory, and its approximability has been studied alongside MAX-CUT since semidefinite programming entered the field.

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

The Quantity Flexibility Contract and Supplier-Customer Incentives II: With a Perfect Demand Signal the Transfer Price c̄(ψ) Makes the Quantity Flexibility Contract System-EfficientResearch Paper

A manufacturer must commit to production before its retail customer knows what the market will demand, while the customer would rather postpone its purchase until better information arrives. Left uncoordinated, each firm protects itself: the customer inflates forecasts it is not bound by, and the manufacturer, discounting those forecasts, builds less than…

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

Primal and Dual Linear Decision Rules in Stochastic and Robust Optimization 1: With Fixed Recourse, the Primal and Dual Linear Decision Rule Problems Equal the LPs (2.3) and (2.8)Research Paper

Linear stochastic programs with recourse model decisions that are taken after an uncertain parameter ξ\xiξ has been observed: the decision is a decision rule x(ξ)x(\xi)x(ξ), a function of the data. Computing the optimal value exactly is intractable in general. Dyer and Stougie showed that already two-stage linear stochastic programs are #P-hard (Math. Program. 2006),…

11 thms4 active usersReviewed
🏆Completed
Theoretical Computer Science·Captain: marwahaha

Additive hardness and unbounded configuration gaps in bin packingOpen Problem

Configuration linear programs relax bin packing by allowing fractional combinations of feasible bins. The mission asks whether the integral optimum can stay within any universal additive constant of this relaxation. The source manuscript presents the surrounding research claim.

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

Rank-Sparsity Incoherence for Matrix Decomposition: If μ(A⋆)ξ(B⋆) < 1/6, ℓ1 + Nuclear-Norm Minimization Uniquely Recovers the Sparse and Low-Rank ComponentsResearch Paper

Many data matrices are, to a good approximation, the sum of a sparse matrix (few nonzero entries) and a low-rank matrix. In system identification the low-rank part models a system of small order and the sparse part a system with sparse impulse response; in statistics the same structure appears in latent-variable graphical models, where a sparse inverse…

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

Overbooking with Substitutable Inventory Classes: With Semigroup Survivals the Expected Net Revenue Is Componentwise Concave and Submodular in the Overbooking LevelsResearch Paper

Airlines, hotels and car-rental firms sell reservations ahead of service, and a fraction of those reservations cancel or do not show up. Overbooking — accepting more reservations than there is capacity — recovers revenue that cancellations would otherwise destroy, at the risk of denying service to some customers. In practice inventory is often substitutable:…

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

On Implementing a Primal-Dual Interior-Point Method for Conic Quadratic Optimization IV: The Nesterov–Todd Scaling of a Quadratic or Rotated Quadratic Cone Is W = −Q + (e₁ + w)(e₁ + w)ᵀ/(1 + w₁)Research Paper

Conic quadratic (second-order cone) programs are solved in practice by primal-dual interior-point methods. Each iteration solves a Newton system for the central-path equations, and for non-polyhedral cones that system is only guaranteed to be well posed after the problem is scaled: the primal point xxx and the dual slack sss are transformed by a matrix ΘW\Theta WΘW…

15 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryConvex OptimizationOperations Research·Captain: mikedeng1

How Bad is Selfish Routing? 2: With Linear Latency Functions the Cost of a Nash Flow Is at Most 4/3 Times the Optimal CostResearch Paper

In a road or communication network, each user picks a route to minimize its own delay, without regard to the delay it imposes on others. The outcome is an equilibrium that is in general not socially optimal: Braess's paradox shows that adding a road can make every user worse off, and Pigou's two-link example shows that selfish users can incur a third more…

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

Pegasos: Primal Estimated Sub-Gradient Solver for SVM: Mini-Batch Pegasos Has Average Instantaneous Objective Within c(1+ln T)/(2λT) of the SVM Optimum'sResearch Paper

The support vector machine (SVM) is a linear classifier trained by minimising a regularised hinge loss. For training sets with millions of examples, solving the SVM problem to high accuracy by interior-point or dual decomposition methods is too slow, and what is needed is an algorithm whose cost per iteration does not grow with the number of examples. Pegaso…

15 thms4 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchProbability·Captain: mikedeng1

Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion 2: With Random Objective, Z(x) = Z_D(x) = Z_DD(x) and Moment-Matching Distributions Attain Z(x) AsymptoticallyResearch Paper

Two-stage stochastic linear programming chooses a first-stage decision xxx before a random parameter is revealed and pays an optimal second-stage (recourse) cost afterwards. The classical model fixes the distribution of the random parameter. In practice it is rarely known beyond a few moments, and a decision maker who is averse to risk does not evaluate the…

14 thms4 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchProbability·Captain: mikedeng1

Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion 3: With Random Right-Hand Side and Known Dual Extreme Points, the Problem Equals the Semidefinite Program (14)Research Paper

Two-stage stochastic linear programs model a decision xxx taken before uncertainty is revealed, followed by a corrective recourse action once it is. The classical model needs the full probability distribution of the uncertain data, which in practice is rarely known; often only estimates of the mean and the second moments are available, and the computed plan…

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

Convex Quadratic and Semidefinite Programming Relaxations in Scheduling IV: A ρ-Approximate Max-m-Cut Gives a (ρ + m(1 − ρ))-Approximate Schedule for Pm | | Σ wⱼCⱼResearch Paper

Scheduling jobs on identical parallel machines to minimize the total weighted completion time ∑jwjCj\sum_j w_jC_j∑j​wj​Cj​, the problem P ∣ ∣∑wjCjP\,|\,|\sum w_jC_jP∣∣∑wj​Cj​, is one of the basic NP-hard problems of machine scheduling. On a single machine it is solved by Smith's ratio rule (Smith 1956); with several machines the only hard decision is which jobs share a machine. Section 6 of…

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

On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs 2: At a Sharp Minimum the SAA Problem Fails to Be Exact with Exponentially Small ProbabilityResearch Paper

The sample average approximation (SAA) method replaces an expectation in a stochastic program by the average over a random sample and solves the resulting deterministic problem. It is the standard way to solve two-stage stochastic linear programs with large or continuous scenario sets, and it underlies the stochastic counterpart and sample-path optimization…

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

The Sample Average Approximation Method for Stochastic Discrete Optimization 2: √N(v̂_N − v*) Converges in Distribution to the Minimum over S* of a Centered Gaussian VectorResearch Paper

Many decision problems in operations research have a finite set of alternatives and an objective that is an expectation: choose a configuration, a route or a stocking level xxx from a finite set S\mathcal SS to minimize the expected cost E G(x,W)\mathbb E\,G(x, W)EG(x,W), where WWW is random. When the expectation cannot be computed in closed form, the sample average…

7 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchProbability·Captain: mikedeng1

Consumer Returns Policies and Supply Chain Performance 2: Under Consumer Returns, the Differentiated Buy-Back with b − l = s Coordinates the Supply Chain and Gives the Retailer a Share φResearch Paper

Retailers in many categories accept returns of products that are not defective: a consumer buys, learns whether the product suits them, and may send it back for a refund. Returns of this kind are a large cost item in retailing, and the refund a retailer offers is an operational decision on a par with its price and its stocking quantity. Xuanming Su, Consumer…

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

Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion 1: With Random Objective, the Risk-Averse Minimax Problem Equals the Semidefinite Program (7)Research Paper

Two-stage stochastic linear programs choose a first-stage decision xxx before a random parameter is revealed and a recourse decision www afterwards. The classical model assumes the distribution of the random data is known. In practice it is estimated, and often only its first two moments are trusted. The minimax (distributionally robust) approach hedges against…

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

Convex Quadratic and Semidefinite Programming Relaxations in Scheduling I: Randomized Rounding of the Convex Quadratic Relaxation (CQP′) Is Within 3/2 for R | | Σ wⱼCⱼResearch Paper

Scheduling jobs on unrelated parallel machines to minimize the total weighted completion time, the problem written R ∣ ∣∑wjCjR\,|\,|\sum w_jC_jR∣∣∑wj​Cj​ in the three-field notation, is one of the basic NP-hard models of machine scheduling. Each job may take a different time on each machine, as when heterogeneous processors, plants or crews serve the same pool of tasks, and…

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

Conditional Value-at-Risk for General Loss Distributions: β-CVaR Is min_α F_β(x, α), Attained on the Interval from β-VaR to Upper β-VaRResearch Paper

Financial institutions, insurers and engineers who manage the risk of a decision describe it by a statistic of the loss distribution that the decision induces. The value-at-risk (VaR) at confidence level β\betaβ, the β\betaβ-quantile of the loss, became an industry and regulatory standard in the 1990s, but it is not subadditive and behaves erratically as a…

9 thms4 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization II: If f = f₀ + Σf_k Is Quasiconvex and Hemivariate in Each Block, BCD Cluster Points Are Coordinatewise MinimaResearch Paper

Block coordinate descent (BCD), also called the nonlinear Gauss–Seidel method or alternating minimization, minimizes a function of several blocks of variables by exactly minimizing over one block at a time while the others are held fixed. It is used wherever the subproblem in a single block is cheap even though the joint problem is not: alternating least…

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

Quantitative Stability in Stochastic Programming: The Method of Probability Metrics 1: Solution Sets Move by at Most Ψ of the Minimal Information DistanceResearch Paper

A stochastic program minimizes an expected cost under expected-value constraints, and the expectation is taken with respect to a probability distribution μ\muμ of the random data. In applications μ\muμ is rarely known: it is estimated from samples, replaced by a finite scenario tree, or chosen from a parametric family. Whether the optimal value and the optimal…

10 thms4 active usersReviewed
🏆Completed
Machine LearningStatistics·Captain: mikedeng1

Additive Logistic Regression: A Statistical View of Boosting 1: The Exponential Criterion E[e^{−yF(x)}] Is Minimized at Half the Log-Odds ½ log[P(y=1|x)/P(y=−1|x)]Research Paper

AdaBoost (Freund and Schapire, 1996) combines many weak classifiers, such as small decision trees, into a single strong classifier by repeatedly reweighting the training data. In the late 1990s it was among the most accurate off-the-shelf classifiers, but why it worked was unclear. Friedman, Hastie and Tibshirani (Ann. Statist. 28 (2000) 337–407) gave a…

8 thms4 active usersReviewed
🏆Completed
Machine LearningStatistics·Captain: mikedeng1

Additive Logistic Regression: A Statistical View of Boosting 5: J-Class LogitBoost Is the Base-Class-Averaged Diagonal Quasi-Newton Step on the Multinomial Log-LikelihoodResearch Paper

Boosting combines many weak classifiers into a strong one. Friedman, Hastie and Tibshirani (Ann. Statist. 28 (2000) 337–407) explained the two-class AdaBoost algorithms statistically: in the population, boosting fits an additive logistic regression model by stagewise optimization of a criterion on the log-odds scale. Section 5 of that paper carries the…

11 thms4 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization I: On a Compact Level Set, Cluster Points of Essentially Cyclic BCD Are Stationary or Coordinatewise MinimaResearch Paper

Block coordinate descent (BCD), also called the nonlinear Gauss–Seidel method or alternating minimization, minimizes a function of several blocks of variables by minimizing over one block at a time with the others held fixed. It is used wherever the full problem is hard but each block subproblem is easy: proximal point methods, the Arimoto–Blahut algorithm…

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

Bounded Rationality in Newsvendor Models IV: Raising the Payoff Scale from λ₂ to λ₁ > λ₂ Strictly Raises the Expected Profit of a Logit Decision MakerResearch Paper

A standard way to coordinate a supply chain is to align incentives: contracts are written so that the retailer's profit is a fixed fraction λ\lambdaλ of the whole chain's profit. With buy-back terms b=(1−λ)pb=(1-\lambda)pb=(1−λ)p and wholesale price w=(1−λ)p+λcw=(1-\lambda)p+\lambda cw=(1−λ)p+λc, for instance, the retailer's profit is λπS(x)\lambda\pi_S(x)λπS​(x), where πS\pi_SπS​ is the chain's newsvendor profit.…

7 thms4 active users
🏆Completed
Convex OptimizationNumerical AnalysisOperations Research·Captain: mikedeng1

A Coordinate Gradient Descent Method for Nonsmooth Separable Minimization 3: The Local Lipschitzian Error Bound Holds for Polyhedral P with Quadratic or Composite f, and for Strongly Convex fResearch Paper

Many problems in statistics, signal processing and machine learning minimize the sum of a smooth function and a convex but nonsmooth one: ℓ1\ell_1ℓ1​-regularized least squares (the Lasso), bound-constrained problems, and group-sparse regression are standard examples. Tseng and Yun (Math. Program. Ser. B 117 (2009) 387–423) proposed the coordinate gradient…

7 thms4 active usersReviewed
PreviousPage 12 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