Lazy Anchored Extra Proximal — Monotone Equations with Lipschitz Jacobians
Descriptions may be stale. Consult the linked Lean sources.
Monotone Equations with Lipschitz Jacobians · Lean proof
Monotone Equations with
Lipschitz Jacobians
We consider finding a zero of a differentiable monotone map on a finite-dimensional real
inner product space . Its Jacobian
is -Lipschitz in operator norm, where , and a given point lies within distance of a zero . Two exact oracles return and , respectively, at . For a tolerance , the goal is an output
satisfying almost
surely under , the law of the
algorithm’s randomness.
The equation to be solved is Write for the inner
product and for its
induced norm. The Jacobian is the Fréchet derivative, and denotes the
induced operator norm. The algorithm receives , , , , , and an integer parameter
.
Our assumptions:
Assumption 1 (Monotonicity). For every ,
Assumption 2 (Lipschitz Jacobian). The map is Fréchet differentiable everywhere on
, and
Assumption 3 (Initial distance to a zero). There
exists such that
Both oracles accept queries at any point of . Calls to the map oracle and the
Jacobian oracle are counted separately. After the allotted calls, the
output must satisfy the residual criterion
Proved result
OracleTemplate.Convergence LongTails.Setups.UnconstrainedLipschitzJacobianMonotone.spec
LongTails.Theorems.LazyAnchoredExtraProximal.budget
Relevant previous results
No qualifying prior reference verified; this is not a proof of novelty.