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
Functional AnalysisOperations ResearchProbability·Captain: mikedeng1

Dual Solutions in Convex Stochastic Optimization: Under Assumption 23 and a Closed Linear pos(dom φ − (0, ū)), No Duality Gap, an Attained Dual Optimum and Scenario-Wise Optimality ConditionsResearch Paper

Multistage stochastic optimization chooses a sequence of decisions while information arrives over time. A decision at time ttt may depend on the observations available by then, but not on later outcomes. That information restriction, called nonanticipativity, links decisions across scenarios. Dual variables for it are useful because they express how an…

11 thms2 active usersReviewed
Algebraic GeometryOperations ResearchOptimization·Captain: mikedeng1

On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization: The Set of Transition Points of the Optimal Partition Is FiniteResearch Paper

Sensitivity analysis asks how the solution of an optimization problem changes when its data move. For linear optimization the answer has been known since the 1990s: as the objective is perturbed along a fixed direction, the optimal partition (which variables can be positive at an optimum and which slacks can) stays constant on open intervals and changes…

11 thms2 active usersReviewed
Algorithmic Game TheoryEconomics·Captain: mikedeng1

Infinite-Dimensional Fisher Markets and Tractable Fair Division 3: The Quasilinear Eisenberg–Gale Programs Attain Their Optima and Characterize Quasilinear EquilibriaResearch Paper

A Fisher market allocates a common supply of items among buyers with separate budgets. When the items form a continuum, such as positions in a measurable interval, a buyer's valuation and the market price are functions rather than finite lists. This is a useful model for divisible resources and for settings in which an allocation can be described as a…

10 thms2 active usersReviewed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Real-Time Spatial–Intertemporal Pricing and Relocation in a Ride-Hailing Network: Near-Optimal Policies and the Value of Dynamic Pricing 1: Arc Balancing Control Has Loss O(log(1+n)^{3/2}/n^{2/3})Research Paper

A ride-hailing firm chooses prices while drivers move through a city. A trip from one region uses a driver immediately and returns that driver at another region only after a travel delay. Prices affect which trips are requested, but the actual requests fluctuate. A plan that ignores these fluctuations can run out of available drivers at a busy origin even…

7 thms2 active usersReviewed
Dynamic ProgrammingOperations ResearchOptimization+1·Captain: mikedeng1

Convergence Analysis of Sampling-Based Decomposition Methods for Risk-Averse Multistage Stochastic Convex Programs 1: Almost Sure Convergence of the Risk-Averse Sampling-Based Decomposition AlgorithmResearch Paper

Multistage stochastic programs model sequential decisions under uncertainty: hydro-thermal scheduling, portfolio management and capacity planning are standard examples. Their dynamic programming equations involve recourse functions (cost-to-go functions) of the decision history, which cannot be computed exactly. Stochastic Dual Dynamic Programming (SDDP),…

18 thms2 active usersReviewed
Control TheoryLinear algebraOptimization·Captain: mikedeng1

Quadratic Matrix Inequalities with Applications to Data-Based Control V: A Reduced LMI in P Alone and an Explicit Data-Based Stabilizing GainResearch Paper

Data-driven control asks for a controller computed directly from measured trajectories of an unknown system, without first identifying a model. When the measurements are corrupted by noise, many systems explain the same data, and a controller is acceptable only if it works for all of them. Van Waarde, Camlibel, Eising and Trentelman (arXiv:2203.12959) model…

12 thms2 active usersReviewed
Operations ResearchProbability·Captain: mikedeng1

Arbitrage and Duality in Nondominated Discrete-Time Models I: Under NA(𝒫) the Superhedging Price Equals the Supremum of Expectations over Martingale Measures and Is AttainedResearch Paper

Classical arbitrage pricing fixes one probability measure PPP describing the market and asks for the cheapest way to dominate a payoff PPP-almost surely. When the model itself is uncertain, this choice is not available: a trader who only trusts a family P\mathcal PP of possible models wants a hedge that works under every one of them. Two literatures meet here. Rob…

21 thms2 active usersReviewed
Machine LearningOptimizationProbability·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
Control TheoryGraph TheoryOptimization·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
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
Complexity TheoryMachine LearningOptimization·Captain: mikedeng1

Tight Complexity Bounds for Optimizing Composite Objectives II: Any Deterministic Algorithm with Gradient and Prox Oracle Access Needs Ω(m√(γB²/ε)) Queries on Sums of m Convex γ-Smooth FunctionsResearch Paper

Many problems in machine learning and statistics minimize an average of mmm convex losses, one per data point or per block of data. Incremental methods such as SAG, SVRG, SAGA, SDCA, Finito and Katyusha exploit this finite-sum structure: each step touches one component fif_ifi​ instead of the whole average, and for smooth components the best of them reach accuracy …

12 thms2 active usersReviewed
Machine LearningOptimization·Captain: mikedeng1

A Two-Timescale Stochastic Algorithm Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Critic: Explicit Error Bounds for TTSA with a Strongly Convex Outer ObjectiveResearch Paper

Bilevel optimization asks for an outer decision while an inner optimization problem responds to that decision. In hyperparameter selection, for example, the outer objective evaluates a model whose parameters are chosen by a training problem. A two-timescale algorithm updates both levels in one stochastic loop, so its outer step uses an inner solution that…

10 thms2 active usersReviewed
Information TheoryOptimizationQuantum Information·Captain: mikedeng1

Semidefinite Programming Hierarchies for Constrained Bilinear Optimization I: The Linearly Constrained de Finetti SDP Hierarchy Satisfies Q ≤ SDPₙ ≤ Q + ‖G‖∞·d_B²(d_B+1)·√((2 ln 2) log d_A / n)Research Paper

Many problems in quantum information theory ask for the maximum of a linear functional over pairs of quantum states, one on each of two systems, subject to linear constraints on each state. The best success probability of an approximate quantum error-correcting code of given size is of this form: the encoder and the decoder are quantum channels, their Choi…

17 thms2 active usersReviewed
Random Matrix TheoryStatistics·Captain: mikedeng1

Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization: Convex Relaxation Attains Near-Optimal Frobenius, Entrywise and Spectral Norm ErrorsResearch Paper

Matrix completion asks for a low-rank matrix from a small random subset of its entries. It models collaborative filtering (recommendation systems), sensor-network localisation, and structure from motion. In practice the revealed entries are corrupted by noise, and the most widely used estimator is nuclear-norm regularized least squares: fit the observed…

17 thms2 active usersReviewed
Optimization·Captain: mikedeng1

Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods I: For the Proximal Gradient Method, the Error Bound Condition Is Equivalent to Quadratic GrowthResearch Paper

A large share of the optimization problems solved in statistics, signal processing and machine learning have the composite form

13 thms2 active usersReviewed
Dynamical SystemsOptimization·Captain: mikedeng1

First-Order Optimization Algorithms via Inertial Systems with Hessian Driven Damping I: Under (G₂)–(G₃), (DIN-AVD)α,β,b Trajectories Satisfy f(x(t)) − min f = O(1/(t²w(t)))Research Paper

Accelerated first-order methods for convex minimization, starting with Nesterov's 1983 scheme, reach the rate f(xk)−min⁡f=O(1/k2)f(x_k)-\min f=\mathcal O(1/k^2)f(xk​)−minf=O(1/k2), which is optimal for the class of convex functions with Lipschitz gradient. Su, Boyd and Candès (NIPS 2014; JMLR 2016) showed that Nesterov's method is a discretization of the second-order ODE …

7 thms2 active usersReviewed
Machine LearningOptimization·Captain: mikedeng1

Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization 3: Under Refined Dual Strong Convexity, SDCA Reaches Expected Dual Sub-optimality ε after 2(n/s)·log(2/ε) IterationsResearch Paper

Regularized loss minimization covers support vector machines, logistic and ridge regression, and the absolute-deviation regression of robust statistics. Stochastic dual coordinate ascent (SDCA) solves these problems by maximizing the Fenchel dual one randomly chosen coordinate at a time. Shalev-Shwartz and Zhang (arXiv:1209.1873, JMLR 2013) gave the first…

13 thms2 active usersReviewed
Machine LearningOptimization·Captain: mikedeng1

Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization 1: With L-Lipschitz Losses, SDCA Reaches Expected Duality Gap ε after ⌈n log(λn/(2L²))⌉ + n + 20L²/(λε) IterationsResearch Paper

Regularized loss minimization over linear predictors is the training problem behind support vector machines, logistic regression, ridge regression and their many variants. Given examples x1,…,xn∈Rdx_1,\dots,x_n\in\mathbb R^dx1​,…,xn​∈Rd, one minimizes an average of convex losses of the predictions w⊤xiw^\top x_iw⊤xi​ plus a quadratic penalty. Dual coordinate ascent (DCA) solves the…

13 thms2 active usersReviewed
AlgebraAlgebraic GeometryOptimization·Captain: mikedeng1

Semidefinite Programming Relaxations for Semialgebraic Problems 1: A Polynomial System Has No Real Solution if and only if Its Degree-d Positivstellensatz SDP Is Feasible for All Large dResearch Paper

Deciding whether a system of real polynomial equations, inequations and inequalities has a solution is the basic feasibility question behind nonconvex quadratic programming, polynomial optimization, robustness analysis in control, and combinatorial relaxations. Over the complex numbers, Hilbert's Nullstellensatz turns infeasibility into an algebraic…

13 thms2 active usersReviewed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Minimization Methods for Non-Differentiable Functions VI: Almost-Sure Convergence of the Stochastic Subgradient MethodTextbook

Many optimization problems in operations research are posed on an expectation: a two-stage or multistage stochastic program minimizes f(x)=E F(x,ξ)f(x) = E\,F(x,\xi)f(x)=EF(x,ξ), where F(⋅,ξ)F(\cdot,\xi)F(⋅,ξ) is convex but nonsmooth and the expectation cannot be computed exactly. What can be computed is a stochastic subgradient, a random vector whose mean is a subgradient of fff. The stochastic…

17 thms2 active usersReviewed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Numerical Techniques for Stochastic Optimization VI: Adaptive Stepsizes and Cesàro Convergence of Stochastic Quasigradient MethodsTextbook

Stochastic quasigradient (SQG) methods minimize an expectation F(x)=Eωf(x,ω)F(x)=E_\omega f(x,\omega)F(x)=Eω​f(x,ω) over a constraint set X⊆RnX\subseteq\mathbb R^nX⊆Rn when neither FFF nor its gradient can be computed, only random vectors whose conditional mean is (close to) a subgradient. They are the workhorse of stochastic programming and, under the name stochastic gradient descent, of…

11 thms2 active usersReviewed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Introduction to the Scenario Approach II: Violation Guarantees after Discarding k ConstraintsTextbook

Decisions under uncertainty are often required to satisfy a constraint θ∈Θδ\theta \in \Theta_\deltaθ∈Θδ​ that depends on a random parameter δ\deltaδ, and requiring it for every possible δ\deltaδ is usually too conservative or infeasible. The scenario approach replaces the unknown distribution of δ\deltaδ by NNN independent samples (scenarios) and enforces only the sampled…

13 thms2 active usersReviewed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Introduction to the Scenario Approach IV: The FAST Algorithm Keeps the Beta Bound and Adds a Factor (1−ε)^{N₂}Textbook

The scenario approach turns an optimization problem under uncertainty into a finite, data-driven program: sample NNN instances of the uncertain parameter, optimize against all of them, and certify how often the resulting design fails on a new instance. Its main guarantee (Theorem 3.7 of Campi and Garatti's Introduction to the Scenario Approach) bounds the…

6 thms2 active usersReviewed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Introduction to the Scenario Approach III: The Risks of the Empirical Costs Follow an Ordered Dirichlet DistributionTextbook

A scenario program replaces an uncertain optimization problem by its worst case over finitely many sampled instances. In its simplest form it reads

10 thms2 active usersReviewed
Algorithmic Game TheoryOperations ResearchOptimization·Captain: mikedeng1

Value of Information in Bayesian Routing Games II: Equilibrium Adoption Rates of Information Systems Are the Minimizers of the Equilibrium PotentialResearch Paper

Traffic information systems (TIS) such as navigation apps send drivers private, noisy signals about the state of the road network: incidents, weather, closures. When several such systems coexist, their subscribers act on different information, and the congestion each population experiences depends on how all of them route. A question then arises for…

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