Cohypomonotone Root Finding with Adjoints
Descriptions may be stale. Consult the linked Lean sources.
Cohypomonotone Root Finding with Adjoints
We seek a zero of a differentiable map
The root-finding problem is to find
Our assumptions:
Assumption 1 (Differentiability and Lipschitz
bounds). The map
Assumption 2 (Cohypomonotonicity). For every
Assumption 3 (Initial distance to a zero). There
exists
Oracle queries may use any
Results
On a finite-dimensional real inner-product space,
| Result | Oracle complexity | Novelty | Limitations |
|---|---|---|---|
| (1) AdjointAcceleratedCohypomonotone
(Ours) |
|||
| (2) AdjointAnchoredCohypomonotone
(Ours) |
|||
| (3) Inexact Halpern (Alacaoglu et al.
2026), Thm. 2.1, Cor. 2.2; |
(1),
(2): Scope extends to every |
(1), (2)
need adjoints and known |
|
| (4) EAG (Yoon and Ryu
2021), Cor. 1 and monotone-operator extension; |
(1),
(2): No established improvement on |
(1), (2)
add |
|
| (5) Exact proximal point
(Gorbunov et al.
2023), Thm. 3.1; maximally |
(1), (2)
implement inexact resolvents with finite |
(1), (2)
require Lipschitz |
Abbr: