Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Numerical Analysis

254 missions · 180 completed

Missions

Open74Completed180All254
🏆Completed
Convex OptimizationPartial Differential Equations·Captain: mikedeng1

Mean Field Games: Numerical Methods for the Planning Problem II: Solutions of the Penalized Scheme Converge to a Solution of the Discrete Planning Scheme as ε → 0Research Paper

Mean field games (MFG), introduced by Lasry and Lions and by Huang, Caines and Malhamé, describe Nash equilibria of very large populations of identical rational agents. The equilibrium is a coupled system: a backward Hamilton–Jacobi–Bellman equation for the value function uuu of a representative agent and a forward Fokker–Planck equation for the density mmm of…

11 thms2 active usersReviewed
🏆Completed
Linear algebraOptimization·Captain: mikedeng1

Projection-like Retractions on Matrix Manifolds V: Within Distance σ_m(X̄) of the Stiefel Manifold, the Polar Factor Is the Unique Nearest Orthonormal FrameResearch Paper

Optimization problems with orthonormality constraints arise throughout numerical linear algebra and its applications: computing a few eigenvectors or singular vectors, Procrustes problems in statistics and shape analysis, orthogonal factor rotation, independent component analysis, and the orthogonality constraints of electronic-structure calculations. The…

10 thms2 active usersReviewed
🏆Completed
AnalysisFunctional Analysis·Captain: mikedeng1

Theory of Reproducing Kernels VI: The Projection onto the Closed Sum of Two Subspaces as a Series in the Two ProjectionsResearch Paper

An orthogonal projection onto a closed subspace is straightforward to describe when that subspace is given directly. It is less straightforward when the subspace is specified as the closed sum of two others: a vector can have contributions from both, and the two component projections generally do not commute. In §12 of Aronszajn's 1950 paper, this problem…

6 thms2 active usersReviewed
🏆Completed
Markov ChainOperations ResearchProbability+1·Captain: mikedeng1

Fundamentals of Queueing Theory X: Uniformization of Continuous-Time Markov ChainsTextbook

Most Markovian queueing models have no closed-form transient solution. The M/M/1 queue already needs modified Bessel functions (Chapter 2 of the book), and a finite-capacity or multi-class model with state-dependent rates has no closed form at all. What an analyst can always write down is the system of forward equations p′(t)=p(t)Qp'(t)=p(t)Qp′(t)=p(t)Q for the state…

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

A New Projection Method for Variational Inequality Problems: The Hyperplane Projection Method Converges to a Solution Under Continuity and Generalized MonotonicityResearch Paper

A variational inequality asks for a point of a convex set at which a vector field points "inward" against every feasible direction. The format covers the first-order optimality conditions of constrained optimization, nonlinear complementarity problems, traffic and economic equilibria (Wardrop, Walrasian, Nash–Cournot), and systems of nonlinear equations;…

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

Conjugate Gradient Methods with Inexact Searches: The Self-Scaled Direction Is a Multiple of Beale's Restart DirectionResearch Paper

Conjugate gradient methods minimize a smooth function f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R using only gradients and a handful of stored vectors. This makes them the standard choice when nnn is too large for Newton or quasi-Newton methods, which store an n×nn\times nn×n matrix. On a strictly convex quadratic with exact line searches the classical method of Hestenes and Stiefel…

18 thms2 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

The Relaxation Method for Linear Inequalities III: Reflexion in a Closed Bounded Convex Set Terminates or Ends in OscillationResearch Paper

The relaxation method for a system of linear inequalities, introduced by Agmon and by Motzkin and Schoenberg in back-to-back papers of the Canadian Journal of Mathematics (1954), solves ∑jaijxj+bi≥0\sum_j a_{ij}x_j + b_i \ge 0∑j​aij​xj​+bi​≥0 by repeatedly moving a point towards, or across, the most violated half-space. It is the ancestor of the perceptron algorithm, of Kaczmarz-type…

11 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations: The Stabilized Type-I Anderson Acceleration Converges to a Fixed Point of Every Nonexpansive MapResearch Paper

Many first-order methods in optimization are fixed-point iterations xk+1=f(xk)x^{k+1}=f(x^k)xk+1=f(xk) of a nonexpansive map f:Rn→Rnf:\mathbb R^n\to\mathbb R^nf:Rn→Rn: proximal gradient descent, projected gradient descent, alternating projections, ISTA and Douglas–Rachford splitting (with the conic solver SCS as an instance) all have this form (Zhang, O'Donoghue, Boyd 2020, §4.2). The…

12 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

The Generalized Quasi-Variational Inequality Problem III: The Projection Map Is a Contraction and Its Iterates Converge to a SolutionResearch Paper

A variational inequality asks for a point xxx of a set K⊆RnK\subseteq\mathbb R^nK⊆Rn at which a vector field fff points "into" KKK: (x′−x)Tf(x)≥0(x'-x)^T f(x)\ge 0(x′−x)Tf(x)≥0 for every x′∈Kx'\in Kx′∈K. It is the common form of the first-order optimality conditions of constrained optimization, of complementarity problems, and of equilibrium models in economics and traffic networks. In many of these…

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

Projected Gradient Methods for Linearly Constrained Problems III: Finite Termination of a Gradient Projection Algorithm for Quadratic ProgrammingResearch Paper

Quadratic programming, the minimisation of a quadratic function subject to linear inequality constraints, is a basic subproblem of nonlinear optimisation (sequential quadratic programming, trust-region methods) and a model in its own right in portfolio selection, least-squares estimation and control. The classical solution methods are active-set methods:…

9 thms2 active usersReviewed
🏆Completed
Linear algebraProbabilityRandom Matrix Theory·Captain: mikedeng1

Randomized Algorithms for Estimating the Trace of an Implicit Symmetric Positive Semi-Definite Matrix V: Sample Bound for the Mixed Unit Vector Trace EstimatorResearch Paper

Many computations in numerical linear algebra, statistics and computational physics need the trace of a matrix AAA that is never formed explicitly: AAA may be an inverse, a matrix function f(B)f(B)f(B), or a product of large operators, and the only affordable access is a routine that returns AvAvAv or vTAvv^TAvvTAv for a given vector vvv. Monte Carlo trace estimators handle this…

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

A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization I: Global Convergence to Stationary PointsResearch Paper

Line searches are the step-size rules inside most methods for smooth unconstrained minimization min⁡x∈Rnf(x)\min_{x \in \mathbb{R}^n} f(x)minx∈Rn​f(x): steepest descent, conjugate gradient, quasi-Newton and limited-memory methods all choose a direction dkd_kdk​ and then a step αk\alpha_kαk​ along it. Classical Armijo and Wolfe rules are monotone: they require f(xk+1)<f(xk)f(x_{k+1}) < f(x_k)f(xk+1​)<f(xk​). Grippo,…

15 thms2 active usersReviewed
🏆Completed
Linear algebraProbabilityRandom Matrix Theory·Captain: mikedeng1

Randomized Algorithms for Estimating the Trace of an Implicit Symmetric Positive Semi-Definite Matrix III: Sample Bound for Normalized Rayleigh-Quotient Trace EstimatorsResearch Paper

Many computations in numerical linear algebra, statistics and computational physics need the trace of a matrix AAA that is never formed explicitly: AAA may be an inverse, a matrix function f(B)f(B)f(B), or a product of large operators, and the only affordable access is a routine that returns AvAvAv for a given vector vvv. Examples include log-determinants and the generalized…

11 thms2 active usersReviewed
🏆Completed
Linear algebraOptimizationTheoretical Computer Science·Captain: mikedeng1

Sparse Approximate Solutions to Linear Systems 1: The Column Bound for Greedy SelectionResearch Paper

Many problems in scientific computing and statistics ask for a solution of a linear system Ax≈bAx\approx bAx≈b that uses as few unknowns as possible. In statistics this is subset selection (Golub and Van Loan, Matrix Computations, 1983). In coding theory over binary matrices it is the minimum weight solution problem (Gallager, 1968). Natarajan's own motivation was r…

12 thms2 active usersReviewed
🏆Completed
Convex OptimizationLinear algebraOperations Research+1·Captain: mikedeng1

Robust Solutions to Least-Squares Problems with Uncertain Data II: Robust Least Squares as Tikhonov RegularizationResearch Paper

Least squares fits a linear model Ax≃bAx \simeq bAx≃b by minimizing ∥Ax−b∥\|Ax - b\|∥Ax−b∥, and its solution can be extremely sensitive to errors in the data (A,b)(A, b)(A,b) when AAA is ill-conditioned. The standard remedy is Tikhonov regularization (ridge regression): minimize ∥Ax−b∥2+μ∥x∥2\|Ax - b\|^2 + \mu\|x\|^2∥Ax−b∥2+μ∥x∥2, whose solution x=(A⊤A+μI)−1A⊤bx = (A^\top A + \mu I)^{-1}A^\top bx=(A⊤A+μI)−1A⊤b is stable but depends on a…

9 thms2 active usersReviewed
🏆Completed
Convex OptimizationLinear algebraOptimization·Captain: mikedeng1

A Singular Value Thresholding Algorithm for Matrix Completion 2: Convergence of the SVT Iteration under General Convex ConstraintsResearch Paper

Singular value thresholding (SVT) is a first-order method introduced by Cai, Candès and Shen (SIAM J. Optim. 20 (2010)) for recovering a low-rank matrix from incomplete or indirect information. Its basic form, for matrix completion, alternates a soft-thresholding of singular values with a gradient step on a dual variable, and needs only one sparse singular…

9 thms2 active usersReviewed
🏆Completed
Convex OptimizationLinear algebraOptimization·Captain: mikedeng1

A Singular Value Thresholding Algorithm for Matrix Completion 1: The SVT Iteration Converges to the Unique Solution of the Proximal ProblemResearch Paper

Matrix completion asks to recover an n1×n2n_1\times n_2n1​×n2​ matrix MMM from a subset Ω\OmegaΩ of its entries. When MMM has low rank, a standard convex surrogate is to minimize the nuclear norm ∥X∥∗\|X\|_*∥X∥∗​ (the sum of the singular values) subject to agreeing with MMM on Ω\OmegaΩ; Candès and Recht showed that this recovers MMM exactly under incoherence and sampling conditions (Candès–…

12 thms2 active usersReviewed
🏆Completed
Harmonic Analysis·Captain: LG

Fast Fourier Transform I: Correctness of the Radix-2 Cooley–Tukey AlgorithmTextbook

The discrete Fourier transform (DFT) is the basic spectral tool of digital signal processing, numerical analysis and computational number theory: it turns a finite sample of a signal into its frequency content, converts convolution into pointwise multiplication, and underlies fast integer and polynomial multiplication. Computed straight from its defining…

11 thms2 active usersReviewed
🏆Completed
Analysis·Captain: LG

Padé Approximants: Existence and Uniqueness of the [m/n] ApproximantTextbook

A Padé approximant is the "best" approximation of a function near a point by a rational function of prescribed numerator and denominator degrees. The idea goes back to Georg Frobenius (1881), who studied relations among the convergents of a power series, and was developed systematically by Henri Padé in his 1892 thesis. Unlike a truncated Taylor polynomial,…

10 thms2 active usersReviewed
🏆Completed
Algebra·Captain: LG

Métodos Numéricos (Freitas) II: Zeros de Polinômios e o Algoritmo de HornerTextbook

Polynomial equations are the special case of root finding where algebra says a great deal before analysis is needed: the number of roots is known, the roots of a real polynomial come in conjugate pairs, the rational candidates can be listed, and the whole complex plane can be narrowed down to an annulus that must contain every root. A numerical method that…

8 thms2 active usersReviewed
🏆Completed
Analysis·Captain: LG

Métodos Numéricos (Freitas) IV: Ajuste de Curvas e o Sistema Normal dos Mínimos QuadradosTextbook

Experimental data are not exact, and forcing a curve through every measured point reproduces the noise rather than the law behind it. Curve fitting replaces interpolation by approximation: choose a family of shapes — a straight line, a polynomial of low degree, a combination of prescribed base functions — and pick the member of the family that is closest to…

5 thms2 active usersReviewed
🏆Completed
Analysis·Captain: LG

Métodos Numéricos (Freitas) VI: Integração Numérica e o Erro da Fórmula de SimpsonTextbook

Many definite integrals cannot be evaluated in closed form — the normal distribution function is the standard example in the source — and many others are integrals of functions known only through a table of values. Numerical quadrature replaces the integrand by an interpolating polynomial on each subinterval and integrates that instead. The two classical…

10 thms2 active usersReviewed
🏆Completed
Analysis·Captain: LG

Métodos Numéricos (Freitas) VIII: Erros de Arredondamento e PropagaçãoTextbook

Every numerical computation is performed in a finite arithmetic: a real number is stored with a fixed number of decimal digits, and each stored value carries an error. Before any method is analysed, a course in numerical methods has to say how large that error can be and how it grows when approximate values are combined. The answers are the two rounding…

9 thms2 active usersReviewed
🏆Completed
Optimization·Captain: wenxinzhang

Vector Space Methods XIII: Conjugate-Gradient ConvergenceTextbook

The conjugate-gradient method in Luenberger's Chapter 10 is one of the most enduring consequences of Hilbert-space geometry in numerical optimization. For a bounded self-adjoint coercive operator, it solves the quadratic first-order equation Q x = b using only operator applications, inner products, and a short recurrence. Luenberger develops the method from…

6 thms2 active usersReviewed
🏆Completed
Optimization·Captain: wenxinzhang

Vector Space Methods XIV: Quadratic Penalty ConvergenceTextbook

Quadratic exterior penalties in Luenberger's §10.11 replace a constrained problem by a sequence of unconstrained minimizations. The method is simple enough to state in a few lines, yet Luenberger's convergence theorem is strikingly general: no convexity, differentiability, or convergence of the full minimizer sequence is required. If penalty weights…

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