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
Theoretical Computer Science·Captain: marwahaha

Exponential PSD rank of positively shifted matching matricesOpen Problem

Semidefinite representations may be smaller than linear descriptions of a polytope. Lower bounds for their matrix size require a factorization obstruction that applies to arbitrary positive-semidefinite factors. The source manuscript presents the surrounding research claim.

79 thms2 active usersReviewed
🏆Completed
Algebra·Captain: marwahaha

A nonspectrahedral hyperbolicity coneOpen Problem

Hyperbolic polynomials define convex optimization regions through real-rooted line restrictions. A spectrahedral representation would describe the same region by one finite symmetric positive-semidefinite matrix inequality. The source manuscript presents the surrounding research claim.

35 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

On Implementing a Primal-Dual Interior-Point Method for Conic Quadratic Optimization III: A Newton Step Scales the Homogeneous Residuals and the Complementarity Gap by 1 − α(1 − γ)Research Paper

Conic quadratic optimization — linear optimization over products of quadratic (second-order, Lorentz) cones — covers robust linear programming, portfolio problems with risk constraints, norm minimization and many engineering design problems. Andersen, Roos and Terlaky describe the primal-dual interior-point method implemented in the MOSEK optimizer for this…

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

Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion 4: With Random Right-Hand Side and Known Dual Extreme Points, a Distribution in 𝒫 Attains Ẑ(x) = Ẑ_DD(x)Research Paper

Two-stage stochastic linear programs model decisions taken before uncertainty is revealed (a first-stage plan xxx) followed by a corrective recourse action once it is. The classical model needs the full probability distribution of the uncertain data. In practice usually only estimates of a few moments are available, and the computed plan can be sensitive to…

10 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
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Worst-Case Conditional Value-at-Risk with Application to Robust Portfolio Management 2: For a Compact Convex Set of Discrete Distributions, Worst-Case CVaR Equals min_α max_π G_β(x, α, π)Research Paper

Conditional value-at-risk (CVaR) is the standard coherent measure of tail risk in portfolio selection and risk-averse optimization: for a confidence level β\betaβ it is, roughly, the expected loss in the worst (1−β)(1-\beta)(1−β) fraction of outcomes. Its practical appeal comes from the representation of Rockafellar and Uryasev (2000, 2002), which writes CVaR as the…

7 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Worst-Case Conditional Value-at-Risk with Application to Robust Portfolio Management 1: Under Mixture Distribution Uncertainty, Worst-Case CVaR Equals the Minimum over α of max_i F^i_β(x, α)Research Paper

Conditional value-at-risk (CVaR) is the standard coherent measure of tail risk in portfolio selection, insurance and stochastic programming. Its practical appeal comes from a variational formula of Rockafellar and Uryasev (J. Risk 2000; J. Banking Finance 2002): CVaR at level β\betaβ is the minimum over a scalar α\alphaα of a convex function, so that minimizing…

11 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Some Theoretical Aspects of Road Traffic Research III: Minimum Average Journey Time on Alternative Routes — Equal Marginal Times ε and the Closed Forms (32)–(33)Research Paper

J. G. Wardrop's 1952 paper Some theoretical aspects of road traffic research (DOI 10.1680/ipeds.1952.11259) introduced the two criteria that still organise traffic assignment. When a flow of traffic can choose between several routes from one origin to one destination, the paper (p. 345) considers two ways the traffic might divide:

8 thms2 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem I: A Point x Solves the D.C. Program min(g − h) if and only if ∂_εh(x) ⊂ ∂_εg(x) for Every ε > 0Research Paper

A d.c. program minimizes a difference of two convex functions. Many nonconvex problems of practical interest have this form: every function with a locally Lipschitz gradient on Rn\mathbb R^nRn is d.c., the class is closed under finite sums, products and finite suprema, and constrained problems enter through indicator functions. Pham Dinh Tao and Le Thi Hoai An (…

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

A Dual Approach to Solving Nonlinear Programming Problems by Unconstrained Optimization 3: Under Second-Order Conditions, Tolerances αₖ ≤ q[sup g_r − g_r(yᵏ)] Give |xᵏ − x̄| ≤ s|yᵏ − ȳ|Research Paper

The method of multipliers (augmented Lagrangian method), proposed independently by Hestenes and Powell in 1969, solves a constrained optimization problem by a sequence of unconstrained minimizations of a penalized Lagrangian, updating a multiplier estimate between them. It became one of the standard algorithms of nonlinear programming and is the ancestor of…

8 thms2 active usersReviewed
🏆Completed
Functional AnalysisOperations ResearchOptimization·Captain: mikedeng1

Duality and Stability in Extremum Problems Involving Convex Functions 2: The Dual Supremum Equals the Lower Limit of the Perturbed Infimum, sup (P*) = lim inf_{z→0} inf (P(z))Research Paper

A convex minimization problem comes with a dual maximization problem, and the dual value never exceeds the primal value. When the two values differ, a duality gap occurs. Dual bounds, Lagrangian relaxations and optimality certificates are then weaker than hoped. Conditions that rule the gap out are constraint qualifications such as Slater's condition and…

8 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: mikedeng1

Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming: The Set-Inclusive LP Has the Same Feasible Set as the LP of Support FunctionalsResearch Paper

A linear program max⁡c⋅x\max c\cdot xmaxc⋅x subject to Ax≤bAx\le bAx≤b, x≥0x\ge 0x≥0 assumes that the constraint matrix AAA is known exactly. In practice the columns of AAA — the activity vectors, describing how much of each resource one unit of activity jjj consumes — are estimates. A. L. Soyster's 1973 technical note in Operations Research (doi:10.1287/opre.21.5.1154) asked what a…

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

Scenarios and Policy Aggregation in Optimization Under Uncertainty 1: In the Convex Case Progressive Hedging Converges to Optimal Solutions of (P) and (D) Exactly When They ExistResearch Paper

Decisions under uncertainty are often modelled by a finite set of scenarios: possible futures s∈Ss\in Ss∈S with weights psp_sps​, each with its own optimization problem. Solving every scenario separately is easy but useless in practice, because the decision taken today cannot depend on which scenario will be revealed tomorrow. Progressive hedging, introduced by…

15 thms2 active usersReviewed
🏆Completed
Functional AnalysisOperations ResearchOptimization·Captain: mikedeng1

Régularisation d'inéquations variationnelles par approximations successives I: Every Weak Cluster Point of the Regularized Iterates Solves the Monotone Variational InequalityResearch Paper

The proximal point algorithm is a basic iterative scheme of convex optimization and monotone operator theory. To solve a problem governed by a monotone operator, it replaces the problem by a sequence of better-conditioned problems, each regularized by a quadratic term centred at the previous iterate. Augmented Lagrangian methods, the Douglas–Rachford and…

10 thms2 active usersReviewed
🏆Completed
Linear algebraOperations ResearchOptimization·Captain: mikedeng1

Strongly Regular Generalized Equations III: Reduced-Form Criterion — a Linear Generalized Equation over a Polyhedral Set Is Strongly Regular Iff Its Reduced Form Is Uniquely Solvable on LResearch Paper

Many problems in optimization and equilibrium modelling, among them linear and nonlinear complementarity problems, variational inequalities over polyhedra, and the Karush–Kuhn–Tucker conditions of nonlinear programs, can be written as a single generalized equation

6 thms2 active usersReviewed
🏆Completed
Functional AnalysisOptimization·Captain: mikedeng1

Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming 1: The Bregman Proximal Point Algorithm Converges to a Zero of a Maximal Monotone OperatorResearch Paper

The proximal point algorithm is a way to find a zero of a set-valued monotone operator by repeatedly solving a regularized version of that operator equation. Its classical regularizer is quadratic, so the distance from one iterate to the next is Euclidean. In convex optimization, that geometry can be poorly matched to the domain: the natural iterates may be…

8 thms2 active usersReviewed
🏆Completed
Machine LearningStatistics·Captain: mikedeng1

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers VI: The Group-Lasso Block Update Is Zero iff ‖Aᵢᵀv‖₂ ≤ λ/ρ, Otherwise Ridge with ν‖xᵢ‖₂ = λ/ρTextbook

Fitting a statistical model usually means solving a convex problem of the form

10 thms2 active usersReviewed
🏆Completed
Functional AnalysisOptimization·Captain: mikedeng1

Convex Programming in Hilbert Space: Gradient Projection x_{k+1} = P(x_k − ρ_k∇f(x_k)) with σ ≤ ρ_k ≤ 2ρ₀ − σ Stays in the Level Set, and for Convex f Drives f(x_k) to inf_C fResearch Paper

Minimizing a smooth function over a closed convex set is the basic problem of constrained continuous optimization. When the constraint set is simple enough that the nearest point of the set to any given point can be computed (a ball, a box, an orthant, an affine subspace), the most direct method is the gradient projection method: take a gradient step and…

14 thms2 active usersReviewed
🏆Completed
Linear algebraStatistics·Captain: mikedeng1

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers IV: The Covariance-Selection X-Update Is Q·diag((λᵢ + √(λᵢ² + 4ρ))/(2ρ))·QᵀTextbook

Many estimation problems in statistics, machine learning and signal processing minimize a smooth loss plus a nonsmooth ℓ1-type regularizer: the lasso, basis pursuit, least absolute deviations, Huber fitting, the group lasso, and ℓ1-penalized maximum likelihood for Gaussian graphical models. Chapter 6 of Boyd, Parikh, Chu, Peleato and Eckstein, Distributed…

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

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers V: Sharing ADMM — the z-Update Reduces to One n-Variable Problem and the Dual Variables AgreeTextbook

Many large optimization problems arising in statistics, machine learning, signal processing and resource allocation have an objective that is a sum of terms, each depending on data held by a different processor, or a coupling term that depends on the sum of the agents' decisions. Chapter 7 of Boyd, Parikh, Chu, Peleato and Eckstein's monograph on the alterna…

11 thms2 active usersReviewed
🏆Completed
Discrete GeometryLinear Optimization·Captain: mikedeng1

Integer Programming with a Fixed Number of Variables 2: A Simplex Satisfying (16) Rounds K, B(p,r) ⊂ τK ⊂ B(p,R) with R/r ≤ 2n^(3/2)Research Paper

In 1983 H. W. Lenstra, Jr. proved that integer linear programming with a fixed number of variables is solvable in polynomial time (Lenstra 1983). The algorithm became one of the founding results of algorithmic geometry of numbers: it introduced the strategy of making a convex body "round" by a linear change of coordinates, and then either finding a lattice…

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

A Numerically Stable Dual Method for Solving Strictly Convex Quadratic Programs: The Dual Algorithm Solves the QP or Detects Its Infeasibility in Finitely Many StepsResearch Paper

Strictly convex quadratic programs — minimize a positive definite quadratic subject to linear inequalities — are the subproblems solved at every iteration of successive quadratic programming (SQP) methods for nonlinear optimization, and they arise directly in least-squares estimation with constraints, portfolio selection and model predictive control. In SQP…

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

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers III: Parallel Projections — the Dual Average Vanishes and ADMM Reduces to Project-and-AverageTextbook

Many feasibility problems ask for a point satisfying several constraints at once. When each constraint set admits a manageable Euclidean projection, a parallel method can project onto all sets independently and combine the results. Chapter 5 of Boyd, Parikh, Chu, Peleato and Eckstein (2011) places this construction inside the alternating direction method of…

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

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers I: Under a Lagrangian Saddle Point, ADMM Residuals Vanish and Objective Values ConvergeTextbook

The alternating direction method of multipliers (ADMM) is one of the most widely used algorithms for large-scale convex optimization in statistics, machine learning and signal processing. Its appeal is decomposition: a problem whose objective splits into two parts, coupled only by a linear constraint, is solved by alternately minimizing over each part and…

13 thms2 active usersReviewed
🏆Completed
Numerical AnalysisOperations ResearchOptimization·Captain: mikedeng1

Projected Newton Methods for Optimization Problems with Simple Constraints: The Projected Newton Method Converges Superlinearly to the Minimum of a Convex Function over the Nonnegative OrthantResearch Paper

Smooth optimization with nonnegative variables appears when the variables are Lagrange multipliers for inequality constraints or when an objective incorporates an augmented Lagrangian or an exact penalty. Bertsekas studies how to retain a Newton-like convergence rate in this setting while using an iteration that projects a scaled gradient step onto the…

9 thms2 active usersReviewed
PreviousPage 26 of 30Next

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