Monotone Equations with Lipschitz Jacobians
Descriptions may be stale. Consult the linked Lean sources.
Monotone Equations with Lipschitz Jacobians
We consider finding a zero of a differentiable monotone map
The equation to be solved is
Our assumptions:
Assumption 1 (Monotonicity). For every
Assumption 2 (Lipschitz Jacobian). The map
Assumption 3 (Initial distance to a zero). There
exists
Both oracles accept queries at any point of
Results
On a finite-dimensional real inner-product space,
| Result | Oracle complexity | Novelty | Limitations |
|---|---|---|---|
| (1) LazyAnchoredExtraProximal
(Ours) |
|||
| (2) AEP Newton (Jiang and Yoon
2026), Thms. 4.4, 4.6; |
(1): polynomial cost
factor |
(1): more value calls;
extra logarithm at |
|
| (3) Derived bound (Zhang et al.
2026), Thm. 3.1 ( |
(1): cost gain |
(1): logarithmic overhead; does not cover constrained VIs. | |
| (4) LEN (Chen et al. 2025), Thm. 4.1; convex–concave minimax only | (1): general monotone
scope; last-iterate residual. If |
(1): gap conversion requires an output-distance bound absent from its statement; conversion is one-way. |
Abbr: