arXiv (All)
open access
Anchored Extra-Proximal Methods: Optimal Higher-Order Methods for Monotone Inclusion Problems
We study the deterministic oracle complexity of finding approximate solutions to composite monotone inclusion problems, formed by the sum of a smooth single-valued monotone operator and a maximally monotone set-valued operator, under the tangent-residual criterion. We introduce the Anchored Extra-Pr
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Complexities of Weak Proximal Oracle Methods for Composite Convex Optimization#1050601
- Type-Directed Discretization of Probabilistic Programs (Extended Version)#620509
- Type-Directed Discretization of Probabilistic Programs (Extended Version)#618830
- First-order approximations of multifunctions defined implicitly by "split" feasibility problems with applications to optimization#792332
- First-order approximations of multifunctions defined implicitly by "split" feasibility problems with applications to optimization#788332
Record · ID 1078283
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive