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
Algorithmic Game TheoryLinear OptimizationOperations Research·Captain: mikedeng1

Theory of Games and Economic Behavior III: Mixed Strategies, the Minimax Theorem and Good StrategiesTextbook

A zero-sum two-person game in normalized form is a real matrix H(τ1,τ2)\mathcal H(\tau_1, \tau_2)H(τ1​,τ2​): player 1 chooses a row τ1\tau_1τ1​, player 2 simultaneously chooses a column τ2\tau_2τ2​, and player 2 pays player 1 the amount H(τ1,τ2)\mathcal H(\tau_1, \tau_2)H(τ1​,τ2​). Matrix games are the base case of non-cooperative game theory, the prototype of every minimax statement in optimization,…

11 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Numerical Techniques for Stochastic Optimization II: Logarithmic Concavity of Probabilistic ConstraintsTextbook

Many engineering and economic planning problems must meet random requirements with a prescribed reliability: a reservoir must satisfy demand with probability at least 0.950.950.95, a power system must cover load except on rare days, an inventory must avoid shortage with high probability. Probabilistic constrained programming (also called chance-constrained…

9 thms4 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization+1·Captain: mikedeng1

Numerical Techniques for Stochastic Optimization I: Edmundson–Madansky Bounds for Independent Random Data and Simple RecourseTextbook

In a two-stage stochastic linear program a decision xxx is taken before random data ξ\xiξ are observed, and a corrective recourse decision yyy is taken afterwards at a cost. The objective contains the expectation of an optimal value of a linear program, ∫Q(x,ξ(ω)) P(dω)\int Q(x,\xi(\omega))\,P(d\omega)∫Q(x,ξ(ω))P(dω), and for continuous or high-dimensional ξ\xiξ that integral cannot be evaluated…

13 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Random Gradient-Free Minimization of Convex Functions III: Accelerated Random SearchResearch Paper

Many optimization problems in engineering, simulation-based design and machine learning give access only to function values: the objective is the output of a simulator or a black-box program, and its gradient is unavailable or too expensive. Derivative-free (or zeroth-order) methods address this setting. Nesterov and Spokoiny (Found. Comput. Math. 17 (2017))…

16 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Random Gradient-Free Minimization of Convex Functions II: Random Gradient Descent for Smooth and Strongly Convex ProblemsResearch Paper

Many optimization problems in engineering, simulation-based design and machine learning give access to the objective only through its values: the function is computed by a black-box code, and derivatives are unavailable or too expensive to program. Zeroth-order (derivative-free) methods address this setting. Classical derivative-free methods (pattern…

14 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Random Gradient-Free Minimization of Convex Functions I: Random Search for Nonsmooth Convex ProblemsResearch Paper

Many optimization problems in engineering, simulation-based design and machine learning give access to the values of an objective function but not to its gradient: the function is computed by a black-box program, by a simulator, or by a model whose derivatives are unavailable or too expensive. Zeroth-order (or derivative-free) methods use only function…

14 thms4 active usersReviewed
🏆Completed
CombinatoricsDiscrete GeometryOperations Research+1·Captain: Shuze Chen

Discrete Convex Analysis XX: Integral Convexity of L-Convex SetsTextbook

Shortest-path distances and network potentials are among the oldest objects in combinatorial optimization: a directed graph with arc lengths, its shortest-path distances, and the "feasible potentials" (vertex labels consistent with those lengths) underlie duality in min-cost flow, scheduling, and difference-constraint systems. Murota's Discrete Convex…

23 thms4 active usersReviewed
🏆Completed
Discrete GeometryOperations ResearchOptimization·Captain: Shuze Chen

Discrete Convex Analysis XVI: Substitutes and Complements in Network FlowsTextbook

In economics, a pair of goods are substitutes if raising the price of one increases demand for the other, and complements if it decreases it; formally, a utility or value function is submodular in the substitutes case and supermodular in the complements case. A natural question is which of these two regimes a given optimization problem's value function…

41 thms4 active usersReviewed
🏆Completed
Graph TheoryLinear algebraOperations Research+1·Captain: mikedeng1

Lifts of Convex Sets and Cone Factorizations III: Stable Set Polytopes Have No Small Semidefinite LiftsResearch Paper

Many polytopes of combinatorial optimization have exponentially many facets, yet linear optimization over them is tractable because they are projections of simpler convex sets: affine slices of a nonnegative orthant (linear programming) or of the cone of positive semidefinite matrices (semidefinite programming). The size of such a representation, the number…

19 thms4 active usersReviewed
🏆Completed
Machine LearningOptimizationProbability+1·Captain: mikedeng1

Learnability, Stability and Uniform Convergence II: Tikhonov-Regularized ERM Learns Convex Lipschitz Stochastic Optimization in Hilbert Space with High ProbabilityResearch Paper

Statistical learning theory asks when a rule that sees only an i.i.d. sample z1,…,zmz_1,\dots,z_mz1​,…,zm​ from an unknown distribution DDD can return a hypothesis whose expected loss is close to the best possible. In supervised classification the classical answer is uniform convergence: learnability holds exactly when empirical risks converge to expected risks uniformly…

9 thms4 active usersReviewed
🏆Completed
Machine LearningOptimizationStatistics·Captain: mikedeng1

A Unified Framework for High-Dimensional Analysis of M-Estimators with Decomposable Regularizers: Error Bounds under Decomposability and Restricted Strong ConvexityResearch Paper

High-dimensional statistics studies estimation when the number of parameters ppp is comparable to, or larger than, the number of observations nnn. The standard estimators in this regime are regularized M-estimators: minimise an empirical loss plus a penalty that encodes structure, such as the Lasso (ℓ1\ell_1ℓ1​ penalty, sparse vectors), the group Lasso (block norms,…

5 thms4 active usersReviewed
🏆Completed
Functional AnalysisOperations Research·Captain: mikedeng1

Proximité et dualité dans un espace hilbertien II: Proximal Maps Are the Nonexpansive Subgradient Selections of Convex FunctionsResearch Paper

The proximal map of a convex function is the basic building block of proximal-point, forward–backward, Douglas–Rachford and ADMM methods, which are used throughout large-scale convex optimization, signal processing and operator splitting. All of these methods treat prox⁡g\operatorname{prox}_gproxg​ as a nonexpansive operator and use the fact that it is a gradient. The…

12 thms4 active usersReviewed
🏆Completed
Functional AnalysisOperations Research·Captain: mikedeng1

Proximité et dualité dans un espace hilbertien I: Moreau's Decomposition into Proximal Points of a Function and Its DualResearch Paper

Proximal maps are the basic building block of first-order methods for nonsmooth convex optimization: the proximal point algorithm, forward–backward splitting (ISTA/FISTA), Douglas–Rachford splitting and ADMM all proceed by evaluating maps of the form z↦argmin⁡u[12∥u−z∥2+f(u)]z \mapsto \operatorname{argmin}_u \big[\tfrac12\|u - z\|^2 + f(u)\big]z↦argminu​[21​∥u−z∥2+f(u)]. The notion and its name come from…

8 thms4 active usersReviewed
🏆Completed
Functional AnalysisOptimization·Captain: mikedeng1

Strong Convergence of a Proximal-Type Algorithm in a Banach Space: The Algorithm Converges Strongly to the Generalized Projection of x0 onto the Zeros of a Maximal Monotone OperatorResearch Paper

Many problems in optimization and variational analysis reduce to finding a zero of a maximal monotone operator TTT: minimizers of a proper convex lower semicontinuous function are the zeros of its subdifferential, and saddle points and solutions of variational inequalities are zeros of associated monotone operators. The classical tool is Rockafellar's proximal…

13 thms4 active usersReviewed
🏆Completed
Linear algebraOperations ResearchOptimization·Captain: mikedeng1

Robust Solutions to Uncertain Semidefinite Programs III: Quadratic Growth and Uniqueness of the Robust SDP SolutionResearch Paper

A semidefinite program (SDP) minimizes a linear objective cTxc^TxcTx subject to a linear matrix inequality F(x)=F0+∑ixiFi⪰0F(x) = F_0 + \sum_i x_i F_i \succeq 0F(x)=F0​+∑i​xi​Fi​⪰0. When the data FiF_iFi​ are uncertain, El Ghaoui, Oustry and Lebret (SIAM J. Optim. 9(1), 1998) proposed to optimize against the worst case over a norm-bounded family of perturbations: the robust SDP. Their Theorem 3.1 shows…

10 thms4 active usersReviewed
🏆Completed
Linear algebraNumerical AnalysisOperations Research+1·Captain: mikedeng1

Robust Solutions to Least-Squares Problems with Uncertain Data III: Structured Robust Least Squares Is Solved Exactly by a Semidefinite ProgramResearch Paper

Least squares fits a model Ax≈bAx \approx bAx≈b as if the data (A,b)(A, b)(A,b) were exact. In practice they are measured, rounded or estimated, and the least-squares solution can be very sensitive to such errors. El Ghaoui and Lebret (SIAM J. Matrix Anal. Appl. 18(4), 1997) proposed to treat the errors as deterministic, unknown but bounded, and to choose xxx minimizing the wor…

14 thms4 active users
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

The Generalized Quasi-Variational Inequality Problem I: Existence for the Generalized Implicit Complementarity Problem under Strong CopositivityResearch Paper

Variational inequalities and complementarity problems are the standard formulation of equilibrium in operations research and mathematical economics: traffic equilibria, spatial price equilibria, Nash equilibria of convex games, and the optimality conditions of constrained optimization all take this form. Many applications have two features that the…

17 thms4 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: mikedeng1

On Polyhedral Approximations of the Second-Order Cone I: A Compact Polyhedral Approximation of the Lorentz ConeResearch Paper

Conic quadratic programs (second-order cone programs) minimize a linear objective subject to linear constraints and constraints of the form ∥Aℓx−bℓ∥2≤cℓTx−dℓ\|A_\ell x-b_\ell\|_2\le c_\ell^Tx-d_\ell∥Aℓ​x−bℓ​∥2​≤cℓT​x−dℓ​. They model robust linear programs with ellipsoidal uncertainty, truss topology design, contact problems with Coulomb friction, and convex quadratically constrained quadratic…

13 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

On Minimizing a Convex Function Subject to Linear Inequalities I: Beale's Simplex Method for a Convex Quadratic Function TerminatesResearch Paper

Quadratic programming, the minimization of a convex quadratic function subject to linear constraints, is the simplest nonlinear extension of linear programming. It arises in least-squares estimation with sign constraints, in portfolio selection, and as the subproblem solved at each iteration of Newton-type methods for general smooth convex programs. E. M.…

12 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

An Exact Duality Theory for Semidefinite Programming and Its Complexity Implications: The Extended Lagrange–Slater Dual Has Zero Duality Gap and Attains Its OptimumResearch Paper

Semidefinite programming (SDP) optimizes a linear function over the intersection of the cone of positive semidefinite matrices with an affine subspace. It contains linear programming as the diagonal case and is the computational core of relaxations in combinatorial optimization, control theory and polynomial optimization. Its standard duality theory,…

14 thms4 active usersReviewed
🏆Completed
Machine LearningOperations ResearchOptimization·Captain: mikedeng1

First-Order and Stochastic Optimization Methods for Machine Learning VII: Gradient Sliding for Composite OptimizationTextbook

Composite convex programs — objectives split into a smooth piece and a nonsmooth piece — are ubiquitous in data analysis: LASSO-type inverse problems, regularized empirical-risk minimization, and total-variation-type image reconstruction all minimize f(x)+h(x)+χ(x)f(x)+h(x)+\chi(x)f(x)+h(x)+χ(x) over a convex set, where fff is smooth (a data-fidelity term, often expensive to…

5 thms4 active usersReviewed
🏆Completed
Machine LearningOperations ResearchOptimization·Captain: mikedeng1

First-Order and Stochastic Optimization Methods for Machine Learning III: Stochastic Mirror DescentTextbook

Machine learning's canonical training objective — minimize an expected or empirical risk over a data distribution — is almost never observed exactly: at each step an algorithm sees only a noisy gradient sample (a minibatch gradient, a single-example gradient, a simulation draw). Stochastic mirror descent (Nemirovski, Juditsky, Lan & Shapiro 2009) is the…

5 thms4 active users
🏆Completed
Machine LearningOptimization·Captain: mikedeng1

Introduction to Online Convex Optimization XIII: Blackwell's Approachability Theorem and Online Convex OptimizationTextbook

Von Neumann's minimax theorem (Chapter VIII) settles two-player zero-sum games with scalar payoffs. In 1956, Blackwell asked the natural generalization: what can a player guarantee in a repeated game with vector-valued payoffs, where "winning" means driving the average payoff into a target set rather than above a target value? For decades the resulting…

12 thms4 active users
🏆Completed
Machine LearningOptimization·Captain: mikedeng1

Introduction to Online Convex Optimization XII: The Online Boosting MethodTextbook

Chapter XI boosted a weak learner into a strong one for a single offline fit to a fixed sample. Chapter 12 asks the analogous question online: when the pool of experts is too large to run Hedge over directly (the contextual-learning setting, where "experts" are policies mapping contexts to actions and their number is exponential), can black-box access to a…

12 thms4 active users
🏆Completed
Machine LearningOptimization·Captain: mikedeng1

Introduction to Online Convex Optimization IX: From Online Convex Optimization to PAC LearningTextbook

Every algorithm in Chapters I–VIII minimizes regret, an online, adversarial performance measure with no reference to a data-generating distribution. Chapter 9 asks what regret minimization buys in the classical statistical learning setting, where examples are drawn i.i.d. from a fixed distribution and the goal is a hypothesis that generalizes well to unseen…

7 thms4 active users
PreviousPage 7 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