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

Adaptive Cubic Regularisation Methods for Unconstrained Optimization. Part II: Worst-Case Function- and Derivative-Evaluation Complexity 1: Basic ARC Reaches ‖g‖ ≤ ε in O(ε^(−2)) IterationsResearch Paper

Methods for smooth unconstrained minimization, min⁡x∈Rnf(x)\min_{x\in\mathbb R^n} f(x)minx∈Rn​f(x), are compared by how many evaluations of fff and of its gradient they need, in the worst case, to reach an approximately first-order critical point, an iterate with ∥∇f(xk)∥≤ϵ\|\nabla f(x_k)\|\le\epsilon∥∇f(xk​)∥≤ϵ. For steepest descent with a Lipschitz gradient the answer is O(ϵ−2)O(\epsilon^{-2})O(ϵ−2) (Nesterov, Int…

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

Variable Metric Method for Minimization: Davidon's Rank-One Variable-Metric Update Recovers the Inverse Hessian of a Quadratic in N Steps and Then Steps to the Exact MinimumResearch Paper

Quasi-Newton methods minimize a smooth function f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R using gradients only, while building up an approximation to the inverse of the Hessian matrix from the changes of gradient they observe. They are the default algorithms of unconstrained nonlinear optimization: BFGS and its limited-memory variant L-BFGS sit inside most numerical…

7 thms3 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

First-Order Optimization Algorithms via Inertial Systems with Hessian Driven Damping VI: For µ-Strongly Convex f, (IGAHD-SC) Satisfies f(x_k) − min f = O(q^k) and ‖x_k − x⋆‖ = O(q^{k/2})Research Paper

First-order methods use function gradients to minimize an objective without solving a second-order subproblem at each iteration. Inertial methods also use the previous iterate, which can improve the convergence rate but complicates the choice of momentum and step size. Attouch, Chbani, Fadili, and Riahi study a family of such methods derived from continuous…

9 thms3 active usersReviewed
Operations ResearchOptimization·Captain: mikedeng1

The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates 2: Finite, Linear or Sublinear Rates for the Iterates Under the Łojasiewicz PropertyResearch Paper

The alternating direction method of multipliers (ADMM) is one of the standard splitting methods for problems of the form min⁡x{g(Ax)+h(x)}\min_x\{g(Ax) + h(x)\}minx​{g(Ax)+h(x)}, in which a nonsmooth term acts on a linear image of the variable. It is used in signal and image processing, statistical learning and matrix completion, and in many of these applications ggg or hhh is nonconvex:…

14 thms3 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

First-Order Optimization Algorithms via Inertial Systems with Hessian Driven Damping V: For µ-Strongly Convex f, (IPAHD-SC) Satisfies f(x_k) − min f ≤ E₁q^{k−1}, q = 1/(1 + ½√(µs))Research Paper

Many first-order optimization methods are discretizations of second-order differential equations. In the continuous system the velocity carries the momentum, and the damping terms decide how fast the trajectory settles at a minimizer. Attouch, Chbani, Fadili and Riahi study inertial systems with Hessian driven damping: a friction term proportional to …

11 thms3 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

First-Order Optimization Algorithms via Inertial Systems with Hessian Driven Damping II: The Inertial Proximal Algorithm (IPAHD) Satisfies f(x_k) − min f = O(1/δ_k)Research Paper

Accelerated first-order methods, such as Nesterov's method and FISTA, reach a convergence rate of O(1/k2)\mathcal O(1/k^2)O(1/k2) on the objective values of a smooth convex function, against O(1/k)\mathcal O(1/k)O(1/k) for plain gradient descent. Since the work of Su, Boyd and Candès (arXiv:1503.01243), these methods are studied through their continuous-time limits, second-order…

9 thms3 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

First-Order Optimization Algorithms via Inertial Systems with Hessian Driven Damping III: The Inertial Gradient Algorithm (IGAHD) Satisfies f(x_k) − min f = O(1/k²) and Σ k²‖∇f(x_k)‖² < ∞Research Paper

Accelerated gradient methods use information from earlier iterates to reduce the objective gap of a smooth convex optimization problem faster than ordinary gradient descent. Their behavior depends on the precise momentum rule. Attouch, Chbani, Fadili, and Riahi study a discrete rule with an additional difference of consecutive gradients, motivated by an…

8 thms3 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms II: Iterative Hard Thresholding for Sparse Least Squares Converges to an L-Stationary PointResearch Paper

Many estimation problems ask for a vector with few nonzero entries that fits data well. The best-known case is compressed sensing: recover a sparse x∈Rnx\in\mathbb R^nx∈Rn from m≪nm\ll nm≪n noisy linear measurements b≈Axb\approx Axb≈Ax. Fitting such data under an explicit sparsity budget leads to the sparse least-squares problem

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

Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems 3: For Block-Constrained Problems, Uniform Coordinate Descent Has Rate n/(n + k), Linear Under Strong ConvexityResearch Paper

Coordinate descent methods update one block of variables at a time. They are the method of choice when the number of variables is so large that even one full gradient is too expensive, while a single partial derivative is cheap: support vector machines, ℓ1\ell_1ℓ1​-regularized regression, and large sparse least-squares problems are the standard examples. Yu.…

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

Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems 4: Accelerated Coordinate Descent ACDM Has Expected Error at Most (n/(k + 1))²·(2‖x₀ − x*‖₁² + (f(x₀) − f*)/n²)Research Paper

Coordinate descent methods update one block of variables at a time. For problems with millions or billions of variables, where even one full gradient is too expensive to compute or store, a step that touches a single block can be orders of magnitude cheaper than a full gradient step. Nesterov's Efficiency of coordinate descent methods on huge-scale…

11 thms3 active usersReviewed
🏆Completed
Differential GeometryOptimization·Captain: mikedeng1

Optimization Methods on Riemannian Manifolds and Their Application to Shape Space 2: Riemannian Fletcher-Reeves Conjugate Gradient with Strong Wolfe Steps Has liminf of the Gradient Norm ZeroResearch Paper

Many optimization problems in shape analysis, computer vision, numerical linear algebra and statistics have a nonlinear search space: a sphere, a Stiefel or Grassmann manifold, a space of curves modulo reparametrization. Projecting iterates of a Euclidean method back onto the constraint set loses the geometry, so one designs methods that move along the…

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

Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems 2: On a Regularized Objective, RCDM(1, x₀) Finds an ε-Solution with Probability ≥ β Within the Iteration Bound (3.11)Research Paper

Randomized coordinate descent updates one block of variables per iteration, chosen at random. For problems whose dimension makes even one full gradient expensive (the "huge-scale" problems of the title, such as sparse least squares or truss topology design), a coordinate step can cost a tiny fraction of a gradient step. Nesterov's paper (CORE Discussion…

6 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems 1: Random Block Coordinate Descent RCDM(α, x₀) Has Expected Error at Most 2·S_α·R²_{1−α}(x₀)/(k + 4)Research Paper

Many large optimization problems arising in machine learning, statistics and network analysis have so many variables that computing a single full gradient is already expensive, while a single partial derivative, or a gradient with respect to a small block of variables, is cheap. Coordinate descent methods exploit this: at each iteration they update one…

11 thms3 active usersReviewed
🏆Completed
Number TheoryOptimization·Captain: mikedeng1

Nonsmooth Optimization via Quasi-Newton Methods III: The Secant Method on |x| Generates the Alternating Binary Expansion of x₀Research Paper

Quasi-Newton methods such as BFGS were designed for smooth objectives, yet in practice they are routinely run on nonsmooth functions and they often work well there: on many nonsmooth problems the iterates converge to a minimizer at a linear rate, measured against the total number of function evaluations. Lewis and Overton (Math. Program. 141 (2013) 135–163)…

7 thms3 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Nonsmooth Optimization via Quasi-Newton Methods I: With an Exact Line Search on the Euclidean Norm in ℝ², Quasi-Newton Iterates Converge Q-Linearly at Rate 1/2, Turning by π/3Research Paper

Quasi-Newton methods, BFGS above all, are the standard tool for smooth unconstrained minimization. They are also used directly on nonsmooth functions, where in practice they often converge to stationary points with linearly converging function values; the paper documents applications such as the design of low-order controllers (Lewis–Overton 2013, abstract…

8 thms3 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

On the Convergence of the Proximal Algorithm for Nonsmooth Functions Involving Analytic Features: Bounded Proximal Sequences of Łojasiewicz Functions Have Finite Length and a Critical LimitResearch Paper

The proximal algorithm is the basic implicit scheme for minimizing a function fff: from the current point xkx^kxk it moves to a minimizer of fff plus a quadratic penalty on the distance travelled. For convex fff its convergence theory is classical (Martinet 1970, Rockafellar 1976). For nonconvex, nonsmooth fff the situation is different: descent and boundedness give…

12 thms3 active usersReviewed
Linear algebraOptimization·Captain: mikedeng1

The Primal-Dual Active Set Strategy as a Semismooth Newton Method IV: Global Convergence for Small Perturbations of M-MatricesResearch Paper

Obstacle problems, contact problems and control-constrained optimal control problems lead, after discretization, to complementarity systems of the form "find y≤ψy \le \psiy≤ψ and λ≥0\lambda \ge 0λ≥0 with Ay+λ=fAy + \lambda = fAy+λ=f and λi(yi−ψi)=0\lambda_i(y_i - \psi_i) = 0λi​(yi​−ψi​)=0". The primal-dual active set strategy solves such systems by guessing which constraints are active, solving one linear…

10 thms3 active usersReviewed
🏆Completed
Linear algebraOptimization·Captain: mikedeng1

The Primal-Dual Active Set Strategy as a Semismooth Newton Method II: Global Convergence and Monotonicity for M-MatricesResearch Paper

Obstacle problems, contact problems and box-constrained quadratic programs share one finite-dimensional core: the linear complementarity problem "find y≤ψy \le \psiy≤ψ and λ≥0\lambda \ge 0λ≥0 with Ay+λ=fAy + \lambda = fAy+λ=f and λi(yi−ψi)=0\lambda_i(y_i - \psi_i) = 0λi​(yi​−ψi​)=0". After discretization by finite differences or piecewise linear finite elements, the matrix AAA is typically an M-matrix,…

9 thms3 active usersReviewed
Optimization·Captain: mikedeng1

The Primal-Dual Active Set Strategy as a Semismooth Newton Method I: Local Superlinear Convergence for P-Matrix Complementarity ProblemsResearch Paper

Many problems in optimization and in the discretization of partial differential equations reduce to a linear complementarity problem with an obstacle: find y,λ∈Rny, \lambda \in \mathbb{R}^ny,λ∈Rn with

8 thms3 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem III: The DCA Step x^{k+1} = P_E(x^k − (Ax^k + b)/ρ) Is a Descent Method Whose Limit Points Are Kuhn–Tucker PointsResearch Paper

The trust-region subproblem asks for the minimum of a quadratic function over a Euclidean ball,

16 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

A Coordinate Gradient Descent Method for Nonsmooth Separable Minimization 2: Under a Local Lipschitzian Error Bound, CGD with the Restricted Gauss–Seidel Rule Converges LinearlyResearch Paper

Many problems in statistics, signal processing and machine learning minimize the sum of a smooth loss and a convex, nonsmooth, separable regularizer: smooth optimization with ℓ1\ell_1ℓ1​-regularization, bound-constrained optimization, the group Lasso and, through duality, support vector regression are special cases listed in §1 of the paper discussed below. For…

10 thms3 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Convergence Properties of the Nelder–Mead Simplex Method in Low Dimensions III: In Dimension 2, the Standard Method's Vertex Values Share One Limit and Simplex Diameters Tend to ZeroResearch Paper

The Nelder–Mead simplex method (Nelder and Mead, 1965) minimizes a function f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R using function values only. It is among the most widely used derivative-free methods in practice, built into standard numerical libraries, and for decades it had essentially no convergence theory. Lagarias, Reeds, Wright and Wright (1998) gave the first…

12 thms3 active usersReviewed
🏆Completed
Convex OptimizationFunctional AnalysisOperations Research+1·Captain: mikedeng1

Régularisation d'inéquations variationnelles par approximations successives II: The Proximal Regularization of a Convex Minimization Problem Is a Minimizing SequenceResearch Paper

The proximal point algorithm replaces a hard optimization or equilibrium problem by a sequence of better-conditioned ones: from the current point xnx^nxn it solves the original problem with a quadratic penalty ∥x−xn∥2\|x-x^n\|^2∥x−xn∥2 added, and takes the solution as xn+1x^{n+1}xn+1. The method is a building block of modern convex optimization. Augmented Lagrangian methods,…

6 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Fixed Point and Bregman Iterative Methods for Matrix Rank Minimization: The Matrix Shrinkage Fixed Point Iteration Converges to an Optimal Solution of the Nuclear Norm Regularized ProblemResearch Paper

Many estimation problems ask for a matrix of low rank that is consistent with a small number of linear measurements: completing a partially observed ratings matrix, identifying a low-order linear system, or embedding points from a few pairwise distances. Rank minimization under linear constraints is NP-hard, and the standard convex surrogate replaces the…

10 thms3 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations II: A Semismooth, Strongly BD-Regular Zero That Is a Limit Point of the Damped Newton Method Attracts It with Unit StepsResearch Paper

Many problems of optimization and equilibrium reduce to a system of nonsmooth equations F(x)=0F(x)=0F(x)=0 with F:Rn→RnF:\mathbb R^n\to\mathbb R^nF:Rn→Rn locally Lipschitz but not differentiable: nonlinear complementarity problems written as min⁡{h(x),f(x)}=0\min\{h(x),f(x)\}=0min{h(x),f(x)}=0, variational inequalities through the normal map, and Karush–Kuhn–Tucker systems of constrained programs. Newton's method…

8 thms3 active usersReviewed
PreviousPage 4 of 11Next

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