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

Real-Time Dynamic Pricing for Revenue Management with Reusable Resources, Advance Reservation, and Deterministic Service Time Requirements II: Average-Loss Bound for Batch-Adjusted DPCResearch Paper

Hotel rooms, rental cars, cloud servers, operating rooms and rental equipment are reusable resources: a customer occupies capacity for a fixed service time, and the capacity returns to the firm afterwards. Many of these settings also allow advance reservation, where a request made today is for a service that starts later. Lei and Jasin study dynamic pricing…

9 thms2 active usersReviewed
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Real-Time Dynamic Pricing for Revenue Management with Reusable Resources, Advance Reservation, and Deterministic Service Time Requirements I: Average-Loss Bound for Deterministic Price ControlResearch Paper

Hotel rooms, rental cars, cloud servers, hospital beds and event spaces are reusable resources: a customer occupies a unit for a while and then returns it. Pricing them differs from classical revenue management, where a sold unit is gone for good. A sale now blocks capacity only for the length of the service, so the binding constraint is how many services…

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

On the tightness of SDP relaxations of QCQPs 5: The Multiplicity Bound k ≥ aff dim{b(γ) : γ ∈ F} + 1 Cannot Be Lowered by OneResearch Paper

A quadratically constrained quadratic program (QCQP) minimizes a quadratic function subject to quadratic inequality and equality constraints. QCQPs contain max-cut, binary programming, the trust-region subproblem and many problems from signal processing and control, and are NP-hard in general. The standard convex approach is the Shor semidefinite relaxation,…

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

On the tightness of SDP relaxations of QCQPs 4: Quadratic Eigenvalue Multiplicity k ≥ m + 1 Gives conv(D ∩ H) = D_SDP ∩ H and Opt = Opt_SDPResearch Paper

A quadratically constrained quadratic program (QCQP) minimizes a quadratic function subject to quadratic inequality and equality constraints. QCQPs model trust-region subproblems, max-cut and other binary programs, phase retrieval, and many problems in signal processing and control; in general they are NP-hard. The standard tool for bounding and solving…

10 thms2 active usersReviewed
🏆Completed
Convex Optimization·Captain: mikedeng1

Bridging Bayesian and Minimax Mean Square Error Estimation via Wasserstein Distributionally Robust Optimization 2: The Fully Adaptive Frank-Wolfe Algorithm Converges LinearlyResearch Paper

The Frank-Wolfe algorithm (also called the conditional gradient method) minimizes a smooth convex function over a compact convex set using only a linear minimization oracle in place of a projection. Each step solves a linearized problem over the feasible set and moves toward its solution. This makes it the method of choice when projections are expensive but…

11 thms2 active usersReviewed
🏆Completed
Numerical Analysis·Captain: mikedeng1

Douglas-Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results IV: The Image Function (Bg) Is Lsc on B dom g Exactly When Condition (5.5) HoldsResearch Paper

The alternating direction method of multipliers (ADMM) solves problems of the form min⁡x,zf(x)+g(z)\min_{x,z} f(x)+g(z)minx,z​f(x)+g(z) subject to Ax+Bz=bAx+Bz=bAx+Bz=b. Themelis and Patrinos (arXiv:1709.05747v4, SIAM J. Optim. 30(1):149–181, 2020) show that, for nonconvex fff and ggg, ADMM is the Douglas–Rachford splitting method applied to a reformulated problem whose second term is the image function …

7 thms2 active usersReviewed
🏆Completed
Convex OptimizationDynamical Systems·Captain: mikedeng1

Understanding the Acceleration Phenomenon via High-Resolution Differential Equations V: Along the High-Resolution ODE of NAG-C, inf ‖∇f(X(u))‖² ≤ (12 + 9sL)‖x₀ − x⋆‖²/(2√s(t³ − t₀³))Research Paper

Nesterov's accelerated gradient method for smooth convex functions, called NAG-C in the source paper, minimizes an LLL-smooth convex function fff with function values decreasing at the rate O(L/k2)O(L/k^2)O(L/k2). That rate is optimal among first-order methods (Nesterov, 1983). A line of work starting with Su, Boyd & Candès (2016) studies such methods through ordinary…

9 thms2 active usersReviewed
CombinatoricsLinear Optimization·Captain: mikedeng1

The Running Intersection Relaxation of the Multilinear Polytope 2: If a Hypergraph Is Not β-Acyclic, Its Multilinear Polytope Is Strictly Contained in the Running Intersection RelaxationResearch Paper

Many nonconvex optimization problems in binary variables have a polynomial objective or polynomial constraints. The standard way to bring them into the reach of linear and mixed-integer programming solvers is to introduce one new variable per monomial and to study the convex hull of the resulting set of feasible 0/1 vectors, the multilinear polytope. Strong…

11 thms2 active usersReviewed
CombinatoricsLinear Optimization·Captain: mikedeng1

The Running Intersection Relaxation of the Multilinear Polytope 1: For Kite-Free β-Acyclic Hypergraphs the Running Intersection Relaxation Equals the Multilinear PolytopeResearch Paper

Binary polynomial optimization asks to minimize a polynomial over {0,1}n\{0,1\}^n{0,1}n. The standard way to attack it with linear programming is to introduce one variable zez_eze​ for every monomial ∏v∈ezv\prod_{v\in e} z_v∏v∈e​zv​ and to work with the convex hull of the resulting set of binary points. This convex hull, the multilinear polytope, is the object behind the cutting planes…

14 thms2 active usersReviewed
🏆Completed
Numerical Analysis·Captain: mikedeng1

Douglas-Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results I: Under the Tight Stepsize Bound, the Nonconvex DRS Residual Vanishes and Cluster Points Are StationaryResearch Paper

Douglas–Rachford splitting (DRS) minimizes a sum φ=φ1+φ2\varphi=\varphi_1+\varphi_2φ=φ1​+φ2​ by alternating the proximal mappings of the two terms. It goes back to the alternating-direction schemes for heat conduction of Douglas and Rachford (1956), was cast as a splitting method for monotone operators by Lions and Mercier (1979), and through its dual form, the alternating…

11 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimal TransportProbability·Captain: mikedeng1

Sinkhorn Distributionally Robust Optimization 1: Strong Duality — the Worst-Case Expectation over a Sinkhorn Ball Equals inf over λ ≥ 0 of λρ̄ + λε·E log E_Q[e^{f/(λε)}]Research Paper

Distributionally robust optimization (DRO) hedges a decision against uncertainty in the data distribution. It minimizes the worst-case expected loss over an ambiguity set of distributions around a nominal one, typically the empirical distribution of the data. Ambiguity sets built from the Wasserstein (optimal-transport) distance are standard in operations…

12 thms2 active usersReviewed
Machine LearningProbabilityReinforcement Learning·Captain: mikedeng1

Global Convergence of Policy Gradient Methods to (Almost) Locally Optimal Policies: Random-Horizon Policy Gradient with Robbins–Monro Stepsizes Drives the Policy Gradient to Zero Almost SurelyResearch Paper

Policy gradient methods are the main family of reinforcement learning algorithms that search directly over a parameterized class of stochastic policies πθ\pi_\thetaπθ​, θ∈Rd\theta\in\mathbb R^dθ∈Rd, by stochastic gradient ascent on the expected discounted return. They underlie REINFORCE, actor-critic methods and their deep-learning descendants. The return is a nonconvex…

17 thms2 active usersReviewed
🏆Completed
Functional AnalysisNumerical Analysis·Captain: mikedeng1

A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity 3: With Linesearch and Locally Lipschitz B the Method Converges to a Zero in Finite DimensionsResearch Paper

Many problems in optimization, variational inequalities and saddle-point computation can be written as a monotone inclusion: find xxx with 0∈A(x)+B(x)0 \in A(x) + B(x)0∈A(x)+B(x), where AAA is a set-valued maximally monotone operator (a subdifferential, a normal cone) and BBB is single-valued (a gradient, a skew saddle operator). Splitting methods treat AAA only through its resolvent…

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

Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach 3: Variable-Right-Hand-Side Production Cuts along a Precedence Chain Are ValidResearch Paper

Strategic open pit mine planning decides which parts of an ore body are excavated, in which period, and where each block of material is sent: to a processing plant, a stockpile or a waste dump. Rivera Letelier, Espinoza, Goycoolea, Moreno and Muñoz (Operations Research 68(5), 2020) state the problem as a mixed-integer program, the precedence-constrained…

7 thms2 active usersReviewed
Convex OptimizationMachine LearningProbability·Captain: mikedeng1

Distributed Stochastic Gradient Tracking Methods I: With a Constant Stepsize, DSGT's Limiting Mean-Square Error Is at Most (Γ+1)ασ²/(Γμn) Plus a Network TermResearch Paper

Many learning and estimation problems are solved by a network of agents: each agent holds part of the data, can talk only to its neighbours, and wants to compute the minimizer of the average of all agents' objectives. Examples are sensor networks, multi-robot systems, and data-parallel training without a central server (Nedić and Ozdaglar 2009; Lian et al.…

18 thms2 active usersReviewed
🏆Completed
Functional AnalysisNumerical Analysis·Captain: mikedeng1

A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity 1: The Forward-Reflected-Backward Method Converges Weakly to a Zero of A + BResearch Paper

Many problems in convex optimization, variational inequalities and saddle-point computation can be written as a monotone inclusion: find xxx in a real Hilbert space HHH with

11 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimal TransportProbability·Captain: mikedeng1

Distributionally Robust Stochastic Optimization with Wasserstein Distance: If the Growth Rate κ of Ψ Is Finite, sup{E_μ[Ψ] : W_p(μ, ν) ≤ θ} Equals Its One-Dimensional Dual and Is FiniteResearch Paper

Distributionally robust stochastic optimization (DRSO) chooses a decision xxx to minimize the worst expected loss sup⁡μ∈MEμ[Ψ(x,ξ)]\sup_{\mu\in\mathfrak M}\mathbb E_\mu[\Psi(x,\xi)]supμ∈M​Eμ​[Ψ(x,ξ)] over an ambiguity set M\mathfrak MM of probability distributions, instead of the expectation under one estimated distribution. When M\mathfrak MM is a ball around a nominal distribution ν\nuν (often the…

16 thms2 active usersReviewed
Control TheoryConvex OptimizationGraph Theory·Captain: mikedeng1

Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs 2: Push-DIGing Converges R-Linearly over Time-Varying Directed Graphs for Every Step Size Below 1.5(1−δ)²/(μ̄J₂)Research Paper

In distributed optimization, nnn agents cooperatively minimize the 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 private cost functions fi:Rp→Rf_i:\mathbb R^p\to\mathbb Rfi​:Rp→R, exchanging information only with their current neighbours in a communication network. The model covers sensor networks, multi-robot coordination and machine learning with data split across machines,…

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

Trade Credit, Risk Sharing, and Inventory Financing Portfolios: The Optimal Contract Always Uses Trade Credit, with Net Terms for Costless Default or High Cash and Two-Part Terms for Low CashResearch Paper

Most business-to-business sales are not paid in cash on delivery. The supplier lets the buyer pay later, which is trade credit, and often offers a discount for paying early. In the classic "2/10 net 30" the buyer gets 2% off for paying within 10 days and otherwise owes the full price in 30 days. Trade credit is a major source of short-term finance for…

9 thms2 active usersReviewed
Control TheoryProbabilityStochastic Systems·Captain: mikedeng1

Open-Loop and Closed-Loop Solvabilities for Stochastic Linear Quadratic Optimal Control Problems 4: A Problem Open-Loop Solvable at Every (t, x) but Closed-Loop Solvable on No [t, 1]Research Paper

In a stochastic linear–quadratic (LQ) optimal control problem a controller steers a linear stochastic differential equation and pays a quadratic cost. When the cost weights are allowed to be indefinite — as in mean–variance portfolio selection, where the control weight is zero — the problem can still be well posed, and two different notions of solution…

13 thms2 active usersReviewed
Control TheoryProbabilityStochastic Systems·Captain: mikedeng1

Open-Loop and Closed-Loop Solvabilities for Stochastic Linear Quadratic Optimal Control Problems 3: Open-Loop Solvability Is Equivalent to Convergence of the Riccati Minimizing SequenceResearch Paper

Linear–quadratic (LQ) optimal control is the basic test case of stochastic control: a linear stochastic differential equation, a quadratic cost, and an optimal control that one expects to be a linear feedback of the state computed from a Riccati equation. In the indefinite stochastic case the weighting matrices GGG, QQQ, RRR carry no sign condition. The cost can…

14 thms2 active usersReviewed
Convex Optimization·Captain: mikedeng1

On the Convergence of Decentralized Gradient Descent II: For Convex Smooth fᵢ the Mean Iterate Has Objective Error r̄(k) ≤ 4C²/(αk) Until r̄ Falls to C√2·αL_hD/(1 − β)Research Paper

In decentralized optimization, nnn agents connected by a communication network jointly minimize a sum of private functions without a central coordinator: each agent sees only its own fif_ifi​ and talks only to its neighbours. Applications include sensor networks, distributed estimation, multi-agent control and learning over data spread across machines. The…

10 thms2 active usersReviewed
Functional AnalysisNumerical Analysis·Captain: mikedeng1

Projected Reflected Gradient Methods for Monotone Variational Inequalities 3: The Adaptive-Step Method Converges Weakly to a Solution Without Knowing the Lipschitz ConstantResearch Paper

A variational inequality asks for a point of a convex set at which a vector field points "inward" against every feasible direction. It covers constrained convex minimization (with F=∇fF = \nabla fF=∇f), saddle-point problems, Nash equilibria of convex games and complementarity problems, which is why projection methods for it are a standard topic in optimization and…

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

Multistage Adaptive Robust Optimization for the Unit Commitment Problem I: Without Ramping Constraints, Two-Stage and Multistage Robust Unit Commitment Are EquivalentResearch Paper

Unit commitment (UC) is the day-ahead decision of an electricity system operator: which generators to switch on in each hour of the next day, and how much each of them should produce. System operators solve UC problems every day, and their cost and reliability are first-order concerns of power-system operations. With a large share of wind and solar…

10 thms2 active usersReviewed
🏆Completed
Control TheoryConvex Optimization·Captain: mikedeng1

Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints I: A Feasible LMI and a ρ-Hard IQC Certify the Linear Rate ‖ξₖ − ξ⋆‖ ≤ √cond(P) ρᵏ ‖ξ₀ − ξ⋆‖Research Paper

First-order methods such as the gradient method, Nesterov's accelerated method and the Heavy-ball method are usually analysed one at a time, each with its own hand-built potential function. Lessard, Recht and Packard (SIAM J. Optim. 26(1), 2016; read here in arXiv:1408.3595v7) observed that such a method is a linear dynamical system in feedback with the…

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