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
Operations ResearchOptimization·Captain: Shuze Chen

Robust Optimization I: Conic Representations of Robust Linear ConstraintsTextbook

A production or allocation decision can satisfy a linear constraint for nominal data and violate it when those data change. Robust optimization asks for a decision that satisfies the constraint for every realization in a prescribed uncertainty set. The uncertainty set is part of the model: the requirement does not attach probabilities to its elements, and…

7 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

A Unified Analysis of a Class of Proximal Bundle Methods for Solving Hybrid Convex Composite Optimization Problems: An Iteration-Complexity Bound for Every GPB VariantResearch Paper

Bundle methods minimize a convex objective while using local supporting affine functions to represent a component that may be nonsmooth. Their iterations can spend time improving the model without moving the current proximal center, so a bound on useful center changes alone does not bound the total work. Liang and Monteiro study a common generic proximal…

10 thms3 active usersReviewed
🏆Completed
Linear algebraOperations ResearchOptimization·Captain: Shuze Chen

Lectures on Modern Convex Optimization V: Semidefinite Representability of Symmetric Functions of EigenvaluesTextbook

A convex optimization problem can be handed to a semidefinite programming solver only after its constraints and objective have been written as linear matrix inequalities (LMIs): conditions of the form A(x,u)⪰0\mathcal A(x,u) \succeq 0A(x,u)⪰0, where A\mathcal AA is affine in the decision variables xxx and in auxiliary variables uuu, and ⪰0\succeq 0⪰0 means positive semidefinite. A…

9 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

New Mixed-Integer Nonlinear Programming Formulations for the Unit Commitment Problems with Ramping Constraints: The DP Formulation Describes the Closed Convex Hull of the Single-Unit ProblemResearch Paper

Unit commitment (UC) decides, period by period, which thermal generators of a power system are switched on and how much power each produces. It is solved daily by system operators and in the bidding tools of producers, usually as a mixed-integer program, and its size makes the strength of the formulation the main computational lever. A formulation whose…

9 thms3 active usersReviewed
🏆Completed
Functional AnalysisOperations ResearchOptimization·Captain: mikedeng1

Multivariate Monotone Inclusions in Saddle Form: The Asynchronous Block-Iterative Saddle Splitting Algorithm Converges Weakly to a Primal-Dual Kuhn–Tucker PointResearch Paper

Many problems in convex optimization, variational inequalities, game theory and signal processing are systems of monotone inclusions coupled by linear operators: several unknowns xix_ixi​ in different Hilbert spaces, each subject to its own maximally monotone, cocoercive and Lipschitzian operators, and tied together through linear maps LkiL_{ki}Lki​ and composite…

15 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Time-Varying Semidefinite Programs: Under Strict Feasibility, Feasible Polynomial Solutions Have Objective Values Converging to the TV-SDP Optimal ValueResearch Paper

Many planning problems ask for a decision that varies over a time horizon and must satisfy a constraint at every instant, possibly with cumulative effects of past decisions. The applications in the source paper are a maximum-flow problem with time-varying pipeline capacities, a wireless coverage problem for a moving target region, and the approximation of…

10 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability+1·Captain: mikedeng1

Distributionally Robust Inverse Covariance Estimation: The Wasserstein Shrinkage Estimator: Without Sparsity Information the Robust Estimator Is a Closed-Form Shrinkage of the Sample EigenvaluesResearch Paper

The precision matrix X=Σ−1X=\Sigma^{-1}X=Σ−1 of a Gaussian random vector ξ∈Rp\xi\in\mathbb R^pξ∈Rp encodes its conditional independence structure: Xij=0X_{ij}=0Xij​=0 exactly when ξi\xi_iξi​ and ξj\xi_jξj​ are independent given the other coordinates. Estimating it is a basic step in Gaussian graphical models, portfolio selection and linear discriminant analysis. The textbook estimator, the…

14 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignOperations Research+1·Captain: mikedeng1

Optimal Commissions and Subscriptions in Networked Markets: The Convex Relaxation Is Tight and Characterizes All Revenue-Optimal FeesResearch Paper

Online marketplaces such as Airbnb, Upwork and eBay match buyers and sellers but do not set transaction prices. They earn revenue through commissions (a fraction of the transaction price) and subscription fees (a fixed charge per transaction), and they often differentiate these fees by participant type. Prices then form endogenously, as a competitive…

23 thms3 active users
🏆Completed
Algorithmic Game TheoryLinear Optimization·Captain: mikedeng1

Persuading Risk-Conscious Agents: A Geometric Approach II: In Binary Persuasion with a Convex Non-Adoption Region the Convex Program Reduces to a Linear Program over Ω ∪ K₀₁Research Paper

In Bayesian persuasion a sender who observes the state of the world commits to a signaling scheme, a receiver updates her belief by Bayes' rule and acts, and the sender chooses the scheme that maximizes her own expected payoff (Kamenica and Gentzkow 2011). The classical theory assumes the receiver maximizes expected utility, so her payoff is linear in her…

8 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Contextual Inverse Optimization: Offline and Online Learning 4: The Polyhedral Cone of η-Separated Effective Differences Has Uncertainty Angle at Most arccos(η^(d−1)/d^(3/2))Research Paper

In contextual inverse optimization a decision-maker repeatedly faces linear problems min⁡x∈Xtft(x)′c⋆\min_{x\in\mathcal X_t} f_t(x)'c^\starminx∈Xt​​ft​(x)′c⋆ whose cost vector c⋆∈Sdc^\star\in S^dc⋆∈Sd is unknown. After each period it observes an action that an expert who knows c⋆c^\starc⋆ would have taken. Every observation is a set of linear inequalities on c⋆c^\starc⋆, so the costs consistent with the data…

9 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

A Distributionally Robust Perspective on Uncertainty Quantification and Chance Constrained Programming: Individual Chance Constraints over Markov Ambiguity Sets Are Finite Conic SystemsResearch Paper

Many engineering and operations problems must guarantee that a system operates safely with high probability, when the uncertain parameters z~\tilde zz~ are only partially known. A chance constraint asks that the safety condition Sz~≤tS\tilde z \le tSz~≤t hold with probability at least 1−ϵ1-\epsilon1−ϵ for a tolerance ϵ∈(0,1)\epsilon \in (0,1)ϵ∈(0,1). When the distribution of z~\tilde zz~ is…

9 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Convergence Analysis of Sampling-Based Decomposition Methods for Risk-Averse Multistage Stochastic Convex Programs 2: Subdifferential of the Value Function of a Convex ProgramResearch Paper

Stochastic dual dynamic programming (SDDP) and related decomposition methods solve multistage stochastic programs by approximating each stage's recourse function from below by a maximum of affine cuts. Every cut needs a value and a slope: the value of a convex subproblem at a trial point, and a subgradient of that subproblem's optimal value as a function of…

11 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization+1·Captain: mikedeng1

On the Convergence of Decomposition Methods for Multistage Stochastic Convex Programs 2: Under τ-Admissible Random Node Selection, Cuts Become Exact Almost Surely at Every Tree NodeResearch Paper

Stochastic dual dynamic programming (SDDP) and its relatives are the standard algorithms for multistage stochastic programs: hydro-thermal scheduling, energy storage and long-horizon capacity planning are solved with them in industry. They approximate each future cost function from below by a maximum of affine cuts, compute new cuts only at a few randomly…

16 thms3 active usersReviewed
🏆Completed
Machine LearningOperations ResearchOptimization·Captain: mikedeng1

Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation 2: SONATA with Push-Sum Converges R-Linearly over Time-Varying Directed GraphsResearch Paper

In distributed optimization a network of mmm agents minimizes a sum of private functions while each agent talks only to its neighbours. Applications include federated and decentralized learning, sensor networks and multi-robot systems, where the data cannot be pooled at one site. Many of these networks are directed (communication links are one-way, for…

13 thms3 active usersReviewed
🏆Completed
Control TheoryLinear algebraOptimization·Captain: mikedeng1

Quadratic Matrix Inequalities with Applications to Data-Based Control II: Matrix Finsler's Lemma — Z⁰ᵣ(N) ⊆ Zᵣ(M) iff M − αN ⪰ 0 for Some α ≥ 0Research Paper

Finsler's lemma (P. Finsler, 1937) states that for symmetric matrices M,N∈SnM,N\in\mathbb S^nM,N∈Sn, the quadratic form x⊤Mxx^\top Mxx⊤Mx is positive on every nonzero xxx with x⊤Nx=0x^\top Nx=0x⊤Nx=0 if and only if M−αN>0M-\alpha N>0M−αN>0 for some real α\alphaα. Together with the S-lemma of Yakubovich it is one of the basic tools for converting a statement about all vectors satisfying a quadratic…

9 thms3 active usersReviewed
🏆Completed
Machine LearningOperations ResearchOptimization·Captain: mikedeng1

Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation 1: SONATA Converges R-Linearly over Undirected Graphs for Small Step SizesResearch Paper

In distributed optimization, mmm agents connected by a communication network jointly minimize the average of their private losses, exchanging vectors only with their neighbours. This is the computational model of decentralized machine learning (data held by many machines, no central server), of sensor networks and of multi-agent control. A central family of…

14 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

On the tightness of SDP relaxations of QCQPs 6: For Diagonal QCQPs the SOCP and SDP Relaxations Have the Same Projected Epigraph and Optimal ValueResearch Paper

Quadratically constrained quadratic programs (QCQPs) minimize a quadratic function subject to quadratic inequality and equality constraints. They model trust-region subproblems, robust least squares, max-cut and many problems in signal processing and control. They are NP-hard in general, so practice relies on convex relaxations, and the standard one is the S…

9 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

On the tightness of SDP relaxations of QCQPs 2: Polyhedral Γ with 0 ∉ Proj_V(F){b(γ) : γ ∈ F} on Every Semidefinite Face Makes Every SDP Optimizer FeasibleResearch Paper

A quadratically constrained quadratic program (QCQP) minimizes a quadratic function subject to quadratic inequality and equality constraints. The class contains nonconvex problems such as max-cut, Boolean least squares, the trust-region subproblem and its generalizations, and robust least squares, and it is NP-hard in general. The standard convex approach…

15 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

On the tightness of SDP relaxations of QCQPs 1: Polyhedral Γ and Large Shared Zero Eigenspaces on Semidefinite Faces Give conv(D) = D_SDP and Opt = Opt_SDPResearch Paper

Quadratically constrained quadratic programs (QCQPs) minimize a quadratic function subject to quadratic inequality and equality constraints. They model facility location, pooling, max-cut, trust-region steps and robust optimization problems, and every {0,1}\{0,1\}{0,1} integer program can be written as one; in general they are NP-hard. The standard tractable approach…

16 thms3 active usersReviewed
🏆Completed
Dynamical SystemsOptimization·Captain: mikedeng1

Understanding the Acceleration Phenomenon via High-Resolution Differential Equations IV: The High-Resolution Heavy-Ball ODE Satisfies f(X(t)) − f(x⋆) ≤ 7‖x₀ − x⋆‖² e^(−√μ t/4)/(2s)Research Paper

Polyak's heavy-ball method and Nesterov's accelerated gradient method for strongly convex functions (NAG-SC) are the two classical momentum methods of smooth convex optimization. With step size sss and momentum α=(1−μs)/(1+μs)\alpha=(1-\sqrt{\mu s})/(1+\sqrt{\mu s})α=(1−μs​)/(1+μs​) they differ only by a gradient-correction term, yet NAG-SC is accelerated for every μ\muμ-strongly convex, LLL-smo…

9 thms3 active usersReviewed
🏆Completed
Numerical AnalysisOptimization·Captain: mikedeng1

From Differential Equation Solvers to Accelerated First-Order Methods for Convex Optimization 6: Nesterov's Method Has ℒ_k ≤ ℒ₀·min{4L/(√γ₀k + 2√L)², (1 − √(min{γ₁, μ}/L))^k}Research Paper

Nesterov's accelerated gradient method minimises a smooth convex function fff to accuracy ε\varepsilonε in O(L/ε)O(\sqrt{L/\varepsilon})O(L/ε​) gradient evaluations, and a μ\muμ-strongly convex one in O(L/μ log⁡(1/ε))O(\sqrt{L/\mu}\,\log(1/\varepsilon))O(L/μ​log(1/ε)); both counts match the lower bounds for first-order methods. Nesterov's own analysis (Y. Nesterov, Introductory Lectures on Convex…

9 thms3 active usersReviewed
🏆Completed
Numerical AnalysisOptimization·Captain: mikedeng1

From Differential Equation Solvers to Accelerated First-Order Methods for Convex Optimization 4: The Predictor–Corrector Scheme Has ℒ_k ≤ ℒ₀·min{4L/(√γ₀k + 2√L)², (1 + √(min{γ₀, μ}/L))^(−k)}Research Paper

Nesterov's accelerated gradient method minimises a smooth convex function fff to accuracy ε\varepsilonε in O(1/ε)O(1/\sqrt{\varepsilon})O(1/ε​) gradient evaluations, and a μ\muμ-strongly convex one in O(L/μlog⁡(1/ε))O(\sqrt{L/\mu}\log(1/\varepsilon))O(L/μ​log(1/ε)), which is optimal for first-order methods. The method's original derivation by estimate sequences gives little insight into why it…

8 thms3 active usersReviewed
🏆Completed
Numerical AnalysisOptimization·Captain: mikedeng1

From Differential Equation Solvers to Accelerated First-Order Methods for Convex Optimization 3: The Implicit Scheme Gives ℒ_{k+1} ≤ ℒ_k/(1 + α_k) for Every μ-Convex f and Every Step α_k > 0Research Paper

Accelerated first-order methods, beginning with Nesterov's 1983 scheme, reach the optimal iteration complexity among gradient methods for smooth convex minimization, but their classical derivations ("estimate sequences") give little insight into why acceleration works. A line of work started by Su, Boyd and Candès (arXiv:1503.01243) reads accelerated…

10 thms3 active usersReviewed
🏆Completed
Numerical AnalysisOptimization·Captain: mikedeng1

From Differential Equation Solvers to Accelerated First-Order Methods for Convex Optimization 5: The Gradient-Corrected Scheme Contracts ℒ_k by 1/(1 + α_k) and Has the Rate of Theorem 5.1Research Paper

Nesterov's accelerated gradient method minimises a smooth convex function fff to accuracy ε\varepsilonε in O(1/ε)O(1/\sqrt{\varepsilon})O(1/ε​) gradient evaluations, against O(1/ε)O(1/\varepsilon)O(1/ε) for plain gradient descent, and this rate is optimal for first-order methods (Nesterov 2018). The method is usually presented through estimate sequences, which certify the rate but say…

10 thms3 active usersReviewed
🏆Completed
Dynamical SystemsNumerical AnalysisOptimization·Captain: mikedeng1

From Differential Equation Solvers to Accelerated First-Order Methods for Convex Optimization 2: The NAG Flow Has a Unique C² Solution and Its Lyapunov Function Satisfies ℒ(t) ≤ e^(−t)ℒ(0)Research Paper

Accelerated first-order methods, above all Nesterov's accelerated gradient (NAG) method, minimize a convex function with an LLL-Lipschitz gradient to accuracy ε\varepsilonε in O(L/ε)O(\sqrt{L/\varepsilon})O(L/ε​) gradient evaluations, and a μ\muμ-strongly convex one in O(L/μlog⁡(1/ε))O(\sqrt{L/\mu}\log(1/\varepsilon))O(L/μ​log(1/ε)), against O(L/ε)O(L/\varepsilon)O(L/ε) and O((L/μ)log⁡(1/ε))O((L/\mu)\log(1/\varepsilon))O((L/μ)log(1/ε)) for gradient…

11 thms3 active usersReviewed
PreviousPage 9 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