Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Convex Optimization

746 missions · 569 completed

Missions

Open177Completed569All746
OptimizationQuantum Information·Captain: iris

Solving Sparse SDPs in Sublinear Time: A Classical Algorithm Inspired by the Quantum OR LemmaResearch Paper

Semidefinite programs underlie approximation algorithms such as Goemans–Williamson, the sum-of-squares hierarchy, and basic tasks in quantum information. They are also the main example of a claimed large quantum speedup for a continuous optimization problem. For sparse SDPs with n×nn\times nn×n matrices and mmm constraints, the best known classical solver had…

38 thms6 active usersReviewed
CombinatoricsOperations ResearchTheoretical Computer Science·Captain: iris

Two-stage Stochastic Matching and Pricing with Applications to Ride Hailing: Weighted-Balanced-Utilization Is 3/4-Competitive Against Both the Optimum Offline and the Optimum OnlineResearch Paper

Ride-hailing platforms match drivers to riders in batches. When a batch is cleared, some riders are already waiting (the first stage), while others may request a ride in the next few minutes (the second stage). A driver assigned now is unavailable later, so the platform has to decide how much supply to commit to current demand without knowing which future…

21 thms6 active usersReviewed
Numerical AnalysisOptimization·Captain: iris

A Semismooth Newton-Type Method for the Nearest Doubly Stochastic Matrix Problem: Local Q-Quadratic Convergence of the Modified Semismooth Newton MethodResearch Paper

A doubly stochastic matrix is a nonnegative square matrix whose rows and columns all sum to one. Given an arbitrary matrix X^∈Rn×n\hat X\in\mathbb R^{n\times n}X^∈Rn×n, the nearest doubly stochastic matrix problem asks for the doubly stochastic matrix closest to X^\hat XX^ in the Frobenius norm. It appears as a subproblem in splitting methods (ADMM) for semidefinite…

37 thms6 active usersReviewed
Combinatorics·Captain: mikedeng1

A deterministic (1+ε)n(1+\varepsilon)^n(1+ε)n approximation for the permanent of a nonnegative matrixResearch Paper

The permanent measures the total weight of ways to pair every row of a square matrix with a distinct column. For a zero-one matrix it counts perfect matchings in a bipartite graph. For general nonnegative entries it retains their weights. Counting problems use this quantity to distinguish the existence of a configuration from the total contribution of all…

31 thms5 active usersReviewed
Complexity TheoryProbability·Captain: mikedeng1

A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies in the Membership Oracle ModelResearch Paper

A membership oracle answers whether a specified point belongs to an unknown set. It supplies one Boolean answer per query, even when the point has arbitrary real coordinates. In convex optimization this is a basic way to describe a feasible region without giving its inequalities. The question is how many such answers an algorithm needs before it can…

24 thms5 active usersReviewed
Markov ChainProbabilityTheoretical Computer Science·Captain: iris

Polytope Sampling at the Speed of IsoperimetryResearch Paper

Drawing a point uniformly at random from a polytope X={x∈Rn:Ax<b}\mathcal X=\{x\in\mathbb R^n: Ax<b\}X={x∈Rn:Ax<b} given by mmm linear inequalities is a basic primitive of high-dimensional computation. It is the inner loop of randomized volume computation and integration over convex sets, and it is used directly in systems biology (sampling flux polytopes of metabolic networks),…

35 thms5 active usersReviewed
Linear algebraOptimizationTheoretical Computer Science·Captain: iris

A Fast Lewis-weight Interior-Point Method for Linear Optimization over Product Convex SetsResearch Paper

Many problems in statistics, control and data science minimize a linear objective over a product of small convex sets subject to a few linear equations: ℓp\ell_pℓp​ regression, entropy-regularized transport, and second-order cone programs with small cones. When the number of variables nnn is much larger than the number of equations ddd, the running time in terms of ddd…

27 thms5 active usersReviewed
Linear algebraOptimizationTheoretical Computer Science·Captain: iris

Adaptive Matrix Sparsification with Applications to Empirical Risk Minimization and Computational GeometryResearch Paper

Empirical risk minimization (ERM) is a convex optimization problem that covers linear and ℓp\ell_pℓp​ regression, LASSO, logistic regression, support vector machines and quantile regression. Its dual form is

28 thms5 active usersReviewed
Complexity TheoryTheoretical Computer Science·Captain: iris

Near-Quadratic Lower Bounds for Convex Optimization with Binary First-Order QueriesResearch Paper

Classical oracle complexity counts how many exact first-order answers — a value f(y)f(y)f(y) and a subgradient g∈∂f(y)g\in\partial f(y)g∈∂f(y) — a method needs to minimize a convex function. With exact real answers, O(dlog⁡(MR/ε))O(d\log(MR/\varepsilon))O(dlog(MR/ε)) queries suffice in dimension ddd, attained by the center of gravity method and by modern cutting-plane methods. A computer, however, reads…

62 thms5 active usersReviewed
Operations ResearchOptimizationProbability·Captain: iris

Markov Decision Processes with Applications to Finance IV: A One-Period Market Has an Optimal Portfolio for Every Wealth If and Only If It Admits No ArbitrageTextbook

Every portfolio problem in discrete-time mathematical finance starts from a market model and asks two questions: is the market free of arbitrage, and does an investor with a given utility function have an optimal portfolio? The two questions are linked. If a riskless strategy with a chance of gain exists, an investor with strictly increasing utility can…

23 thms5 active usersReviewed
Algorithmic Game TheoryBandit Algorithms·Captain: iris

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback: Barrier Bandit Mirror Descent Reaches the Nash Equilibrium at Last-Iterate Rate O~(nT−1/2)\tilde O(nT^{-1/2})O~(nT−1/2)Research Paper

In many operations problems several decision makers act repeatedly on a shared system and see only the payoff they receive: firms setting quantities in a Cournot market observe the market price, sellers in a pricing game observe their revenue, bidders in a Kelly auction observe their allocation. None of them knows the reward functions or their gradients. Ban…

18 thms5 active usersReviewed
Operations ResearchOptimizationProbability·Captain: Shuze Chen

Assortment Optimization and Pricing Under the Multinomial Logit Model with Impatient Customers: Sequential Recommendation and Selection: Offering all products first earns 87.8 percent of optimumResearch Paper

A retailer that recommends products over several screens faces two decisions: which products to show at each stage, and what prices to charge. Customers may buy before seeing later offers, or leave without viewing the complete sequence. A revenue comparison must therefore account for the order of offers and the customer's willingness to continue browsing. Ga…

18 thms5 active usersReviewed
Operations ResearchOptimizationProbability·Captain: Shuze Chen

Robust Optimization IX: Safe Matrix Chance ConstraintsTextbook

A semidefinite constraint asks whether a symmetric matrix is positive semidefinite: every vector must have a nonnegative quadratic form under that matrix. In optimization, its entries can depend on a decision and on uncertain inputs. Requiring the constraint for every possible input can be restrictive, especially when rare inputs have very large magnitude.…

8 thms5 active usersReviewed
Operations ResearchOptimization·Captain: mikedeng1

Self-Scaled Barriers and Interior-Point Methods for Convex Programming II: A Long Step of the Conic Karmarkar Method Lowers the Potential by at Least (‖p‖²/|p|²)(1 − ln 2) ≥ 1 − ln 2Research Paper

Karmarkar's projective method (1984) was the first interior-point algorithm for linear programming with a polynomial bound that was also fast in practice. Its analysis rests on a potential function that combines the logarithm of the objective gap with a logarithmic barrier: if every iteration lowers the potential by a fixed constant, then the gap shrinks…

15 thms5 active usersReviewed
Operations ResearchOptimization·Captain: mikedeng1

Self-Scaled Barriers and Interior-Point Methods for Convex Programming I: A Joint-Scaling Primal-Dual Long Step Lowers the Potential (ν + ρ) ln⟨s, x⟩ + F(x) + F∗(s) by at Least √3/2 − ln(1 + √3/2)Research Paper

Interior-point methods solve linear, second-order cone and semidefinite programs in polynomial time, and they are the engine of most conic optimization software. The general theory of Nesterov and Nemirovskii (1994) covers any convex cone with a self-concordant barrier, but its methods are essentially primal and short-step: their analysis controls the…

22 thms5 active usersReviewed
Computational GeometryFunctional Analysis·Captain: mikedeng1

Deterministic Terminal Embedding with Optimal Target Dimension for Euclidean SpaceResearch Paper

A database of points can be reduced to fewer coordinates while approximately preserving distances among its stored points. Many geometric applications also compare those points with centers or queries supplied later. A guarantee only about pairs already in the database does not cover every such comparison. A terminal embedding asks for one map that…

26 thms4 active usersReviewed
Probability·Captain: mikedeng1

Overcoming the Randomness-Utility Trade-off in Answering Differentially Private Linear QueriesResearch Paper

A private query mechanism must balance the accuracy of its answers with the information it reveals about individual records. It also consumes randomness. When many queries are answered, generating the necessary independent random bits becomes a resource question of its own. Randomness complexity measures the expected number of unbiased bits consumed, in the…

22 thms4 active usersReviewed
Complexity TheoryGraph TheoryLinear algebra+1·Captain: iris

Asymptotic Rank of Weighted Graph Tensors via Completely Positive CoversResearch Paper

The asymptotic rank of a tensor measures how cheaply many copies of it can be computed together. For the triangle graph tensor it is the matrix multiplication exponent: log⁡2R~F(GT2(K3))=ωF\log_2\tilde R_{\mathbb F}(\mathsf{GT}_2(K_3))=\omega_{\mathbb F}log2​R~F​(GT2​(K3​))=ωF​ over every field F\mathbb FF (Bürgisser–Clausen–Shokrollahi 1997, Prop. 15.1). Graph tensors extend this object from three…

39 thms4 active usersReviewed
CombinatoricsInformation TheoryProbability+1·Captain: iris

Optimal e(γ+o(1))ne^{(\gamma+o(1))n}e(γ+o(1))n-Approximation of the Permanent of Positive Semidefinite MatricesResearch Paper

The permanent of a matrix A∈Cn×nA\in\mathbb C^{n\times n}A∈Cn×n is per(A)=∑σ∈Sn∏i=1nAi,σ(i)\mathrm{per}(A)=\sum_{\sigma\in S_n}\prod_{i=1}^n A_{i,\sigma(i)}per(A)=∑σ∈Sn​​∏i=1n​Ai,σ(i)​. Computing it exactly is #P-hard even on 0/1 matrices (Valiant 1979). For nonnegative entries a randomized approximation scheme exists (Jerrum, Sinclair, Vigoda 2004). For a Hermitian positive semidefinite matrix the entries may have…

37 thms4 active usersReviewed
CombinatoricsComplexity TheoryOperations Research+1·Captain: iris

A Faster Strongly Polynomial Time Algorithm for Submodular Function MinimizationResearch Paper

Submodular function minimization (SFM) asks for a set X⊆UX\subseteq UX⊆U minimizing a function h:2U→Rh:2^U\to\mathbb Rh:2U→R that satisfies h(X)+h(Y)≥h(X∩Y)+h(X∪Y)h(X)+h(Y)\ge h(X\cap Y)+h(X\cup Y)h(X)+h(Y)≥h(X∩Y)+h(X∪Y), given only a value oracle that returns h(X)h(X)h(X) on request. Graph and hypergraph cuts, coverage and entropy functions are submodular, and SFM is a subroutine of many algorithms in combinatorial…

26 thms4 active usersReviewed
Machine LearningOptimization·Captain: iris

On the Relation Between Interval Regret and Dynamic RegretResearch Paper

Online convex optimization measures a learner against a benchmark chosen in hindsight. When the environment drifts, a single fixed benchmark says little, and two stronger measures have been studied. Interval regret (Daniely, Gonen and Shalev-Shwartz 2015) asks for small static regret simultaneously on every time interval. Dynamic regret (Zinkevich 2003; Zhan…

46 thms4 active usersReviewed
Operations ResearchProbability·Captain: iris

Stochastic Localization Methods for Convex Discrete Optimization via Simulation: Shrinking Uniform Sampling Returns an (ε, δ)-PGS Solution at Cost O(ε⁻² log(N/δ) + N)Research Paper

Many operational decisions are a single integer: the number of trucks to recruit for a region, the number of staff for an event, the number of servers in a queueing system. When the performance of each choice can only be estimated by simulation, finding a good choice is a problem of optimization via simulation: each evaluation of a candidate returns a noisy…

44 thms4 active usersReviewed
CombinatoricsOperations ResearchOptimization·Captain: iris

Geometric Rescaling Algorithms for Submodular Function Minimization: Rescaling-SFM finds a minimizer of an integer-valued submodular function in O((n4⋅EO+n5)log⁡(nL))O((n^4\cdot\mathrm{EO}+n^5)\log(nL))O((n4⋅EO+n5)log(nL)) timeResearch Paper

A set function f:2V→Rf : 2^V \to \mathbb{R}f:2V→R on a finite set VVV is submodular if f(X)+f(Y)≥f(X∪Y)+f(X∩Y)f(X) + f(Y) \ge f(X \cup Y) + f(X \cap Y)f(X)+f(Y)≥f(X∪Y)+f(X∩Y) for all X,Y⊆VX, Y \subseteq VX,Y⊆V. Submodular function minimization (SFM) asks for a set minimizing fff when fff is available only through a value oracle of cost EO\mathrm{EO}EO. Minimum cut, matroid intersection and several scheduling and image-segmentation…

55 thms4 active usersReviewed
Machine LearningOperations ResearchOptimization·Captain: iris

Stochastic Optimization with Decision-Dependent Distributions: Proximal SGD with Bias ≤ B‖x − x̄‖ Converges Linearly to an η-Sized Noise Floor (ρ < 1 for Distance, ρ < 1/2 for Value)Research Paper

In many learning and decision problems the data distribution reacts to the decision. A credit-scoring rule changes how applicants present themselves; a price changes demand; a deployed classifier changes the population it is later retrained on. Performative prediction (Perdomo, Zrnic, Mendler-Dünner, Hardt, ICML 2020) models this by a map …

15 thms4 active usersReviewed
Operations ResearchOptimization·Captain: iris

A Feasible Method for Solving an SDP Relaxation of the Quadratic Knapsack Problem: Under Either Rank Condition, Every Second-Order Stationary Point of the Low-Rank Factorization Is Globally OptimalResearch Paper

The quadratic knapsack problem (QKP) asks for a set of items of maximum pairwise profit that fits in a knapsack: max⁡{x⊤Cx:a⊤x≤τ, x∈{0,1}n}\max\{x^\top C x : a^\top x \le \tau,\ x \in \{0,1\}^n\}max{x⊤Cx:a⊤x≤τ, x∈{0,1}n}, with a symmetric profit matrix CCC, positive weights aaa and capacity τ\tauτ. It was introduced by Gallo, Hammer and Simeone (1980), is NP-hard, and has several SDP relaxations (Helmberg, Rendl…

35 thms4 active usersReviewed
PreviousPage 1 of 8Next

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