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
🏆Completed
Machine LearningProbability·Captain: mikedeng1

A Modern Introduction to Online Learning IV: Every Deterministic Online Linear Optimization Algorithm Has Regret at Least √2·LD√T/4Textbook

Online learning studies decisions made before their costs are known. An algorithm selects a point, observes a loss, and repeats. Regret compares its accumulated loss with the loss of one fixed point chosen after the sequence is known. Upper bounds show what a particular algorithm can guarantee; a lower bound shows what every algorithm must sometimes suffer.…

6 thms4 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Accelerated Gradient Methods for Nonconvex Nonlinear and Stochastic Programming 2: One Aggressive Stepsize Policy Drives the AG Gradient Mapping to Zero on Nonconvex Composite ProblemsResearch Paper

Many problems in statistics, signal processing and machine learning have the form "smooth loss plus simple non-smooth term": a differentiable data-fit term together with a constraint set or a sparsity-inducing penalty such as the ℓ1\ell_1ℓ1​ norm. When the loss is convex, Nesterov's accelerated gradient (AG) method and its proximal variants are known to be…

17 thms4 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Accelerated Gradient Methods for Nonconvex Nonlinear and Stochastic Programming 1: The AG Method Converges on Smooth Nonconvex Problems and Attains the Optimal Rate When Ψ Is ConvexResearch Paper

Accelerated gradient (AG) methods go back to Nesterov (1983), who showed that a first-order method with a momentum-like extrapolation reaches an ϵ\epsilonϵ-optimal value of a smooth convex function in O(1/ϵ)O(1/\sqrt\epsilon)O(1/ϵ​) iterations, against O(1/ϵ)O(1/\epsilon)O(1/ϵ) for gradient descent, and that this rate is optimal among first-order methods. Many objectives met in…

18 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationStatistics·Captain: mikedeng1

Sparse Regression at Scale: Branch-and-Bound rooted in First-Order Optimization 3: The Big-M Relaxation Is at Least as Strong as PR(∞) for M ≤ ½√(λ0/λ2) and at Most as Strong for M ≥ √(λ0/λ2)Research Paper

Best subset selection with a ridge term, the ℓ0ℓ2\ell_0\ell_2ℓ0​ℓ2​-regularized least squares problem

20 thms4 active users
🏆Completed
Optimization·Captain: mikedeng1

Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions IV: Lipschitz ∇g and Strongly Convex f (or Vice Versa) Make Relaxed PRS Contract LinearlyResearch Paper

Peaceman–Rachford splitting separates the minimization of a sum into two proximal computations. That matters when each summand has a tractable proximal map but the sum does not. Douglas–Rachford splitting is its half-relaxed instance, and related iterations appear in the analysis of ADMM. Davis and Yin study how regularity of the two summands changes the…

14 thms4 active usersReviewed
🏆Completed
Functional AnalysisMachine LearningOperations Research+1·Captain: mikedeng1

Kernel Distributionally Robust Optimization: Generalized Duality Theorem and Stochastic Approximation: The Worst-Case Risk over an RKHS Ambiguity Set Equals Its Support-Function DualResearch Paper

Distributionally robust optimization (DRO) chooses a decision θ\thetaθ that minimizes the expected loss under the worst distribution in an ambiguity set K\mathcal KK of plausible distributions, min⁡θsup⁡P∈K∫l(θ,ξ) dP(ξ)\min_\theta\sup_{P\in\mathcal K}\int l(\theta,\xi)\,dP(\xi)minθ​supP∈K​∫l(θ,ξ)dP(ξ). It sits between stochastic optimization, which trusts a single distribution, and worst-case robust…

15 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationStatistics·Captain: mikedeng1

Bootstrap Robust Prescriptive Analytics 2: The Entropic Robust Nadaraya-Watson Budget Equals inf{α : ν log Σ D·exp((L−α)w/ν) + rν ≤ 0}Research Paper

Data-driven decision making with side information ("prescriptive analytics") chooses a decision zzz after observing a context x=x0x = x_0x=x0​, using a training set of past pairs (x,y)(x, y)(x,y). A common recipe estimates the conditional expected cost E[L(z,y)∣x=x0]\mathbb E[L(z, y) \mid x = x_0]E[L(z,y)∣x=x0​] with a local learning method, such as Nadaraya–Watson kernel regression or nearest neighbours,…

11 thms4 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Fast Convergence of Inertial Dynamics and Algorithms with Asymptotic Vanishing Viscosity 3: For α > 3 and Σ k‖g_k‖ < ∞, the Perturbed Inertial Forward-Backward Iterates Converge Weakly to a MinimizerResearch Paper

Many problems in signal processing, statistics and machine learning take the form min⁡xΦ(x)+Ψ(x)\min_x \Phi(x)+\Psi(x)minx​Φ(x)+Ψ(x), where Ψ\PsiΨ is smooth and Φ\PhiΦ is convex but nonsmooth (a norm, the indicator of a constraint set). The forward-backward method takes a gradient step on Ψ\PsiΨ followed by a proximal step on Φ\PhiΦ. Its accelerated, inertial version — FISTA of Beck and…

15 thms4 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

From Error Bounds to the Complexity of First-Order Descent Methods for Convex Functions 1: Subgradient Descent Sequences of Convex KL Functions Obey f(x_k) ≤ ψ(α_k) for a 1-D Worst-Case Prox SequenceResearch Paper

Many first-order methods for convex minimization — the forward–backward (proximal gradient) method, alternating minimization, trust-region and majorization–minimization schemes — produce sequences that decrease the objective by an amount proportional to the squared step and whose step controls a subgradient at the new point. Luo and Tseng (Ann. Oper. Res.…

13 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchOptimization+1·Captain: mikedeng1

On Synchronous, Asynchronous, and Randomized Best-Response Schemes for Stochastic Nash Games 2: Randomized Inexact Best Response Reaches an ϵ-NE in Explicitly Bounded Expected SG StepsResearch Paper

Many noncooperative problems in communication networks, power markets and supply chains are stochastic Nash games. Each player minimizes an expected cost that depends on its own decision and on the decisions of its rivals, and the expectation can only be sampled, not evaluated. A natural distributed way to compute an equilibrium is the best-response scheme:…

21 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchOptimization+1·Captain: mikedeng1

On Synchronous, Asynchronous, and Randomized Best-Response Schemes for Stochastic Nash Games 1: Synchronous Inexact Best Response Reaches an ϵ-NE in Explicitly Bounded Projected SG StepsResearch Paper

Many equilibrium problems in operations research, such as networked Cournot competition, power markets and communication networks, are stochastic Nash games: each player minimizes an expected cost fi(xi,x−i)=E[ψi(xi,x−i;ξ)]f_i(x_i,x_{-i})=\mathbb E[\psi_i(x_i,x_{-i};\xi)]fi​(xi​,x−i​)=E[ψi​(xi​,x−i​;ξ)] that depends on the rivals' strategies and on a random vector ξ\xiξ whose law is accessible only through samples. B…

13 thms4 active usersReviewed
🏆Completed
Machine Learning·Captain: mikedeng1

Online Learning and Online Convex Optimization 2: Normalized Exponentiated Gradient Has Regret at Most log(d)/η + η Σₜ Σᵢ wₜ[i]zₜ[i]² When ηzₜ[i] ≥ −1Research Paper

Learning with expert advice and online linear optimization over the probability simplex are the basic models behind boosting, multiplicative-weights methods for linear programming and zero-sum games, and adversarial bandit algorithms. The algorithm that solves them, under the names Weighted Majority, Hedge and Exponentiated Gradient (EG), keeps a…

6 thms4 active usersReviewed
🏆Completed
Machine LearningOptimization·Captain: mikedeng1

Making Gradient Descent Optimal for Strongly Convex Stochastic Optimization 1: SGD with α-Suffix Averaging Attains E[F(w̄ᵅ_T)] − F(w*) ≤ (2 + 2.5 log(1/(1−α)))G²/(αλT)Research Paper

Stochastic gradient descent (SGD) is the default method for minimizing an expected loss F(w)=Ez[ℓ(w,z)]F(w)=\mathbb E_z[\ell(w,z)]F(w)=Ez​[ℓ(w,z)] when only noisy gradients are available, which is the situation of nearly every large-scale learning problem. When FFF is strongly convex (for instance, any convex loss with an ℓ2\ell_2ℓ2​ regularizer), information-theoretic lower bounds show that no…

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

A Stochastic Gradient Method with an Exponential Convergence Rate for Finite Training Sets 1: SAG with Step Size 1/(2nL) Converges Linearly at Rate (1 − μ/(8Ln))ᵏResearch Paper

Many problems in machine learning and statistics minimize an average of nnn smooth losses, one per training example: regularized least squares, logistic regression, and other forms of empirical risk minimization. Two classical families of methods attack such finite sums. The full gradient method evaluates all nnn component gradients per iteration and converges…

14 thms4 active usersReviewed
🏆Completed
Linear algebraMachine LearningStatistics·Captain: mikedeng1

Nuclear-Norm Penalization and Optimal Rates for Noisy Low-Rank Matrix Completion 1: If λ ≥ 2‖M‖∞, the Nuclear-Norm Penalized Estimator Obeys Sharp Oracle Inequalities with Leading Constant 1Research Paper

Many estimation problems in statistics and machine learning ask for an unknown matrix observed only through noisy linear measurements: matrix completion (recover a large matrix from a few noisy entries, as in collaborative filtering), multi-task regression, and quantum state tomography. A common structural prior is that the unknown matrix has low rank, and…

19 thms4 active usersReviewed
🏆Completed
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 Research·Captain: mikedeng1

Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach: With Box Demand Uncertainty the Min-Max RSFC Problem Has the Same Optimal Value on the Extreme DemandsResearch Paper

In a flexible commitments contract a retailer announces, before a selling horizon starts, a vector of planned orders (commitments) to its supplier, who uses them to plan capacity. During the horizon the retailer may deviate from the commitments, but pays penalties for each deviation and for changes between successive commitments. Such contracts were studied…

13 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimization·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 TheoryOperations ResearchOptimization·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
Machine LearningOptimization·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
Operations ResearchOptimizationProbability·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
Operations ResearchOptimizationProbability·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
Operations ResearchOptimizationProbability·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
Operations ResearchOptimizationProbability·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
Numerical AnalysisOperations ResearchOptimization·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 5 of 23Next

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