arXiv (All)
open access
M-duality in fixed-point problems for general normed spaces
Solving fixed-point problems by reducing residual bounds is one of the central approaches in fixed-point iteration, and, in particular, the Halpern iteration is known to effectively reduce the residual. Recently, a new type of duality theorem has been discovered in the convex optimization and fixed-
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
- A Unified Theory of H-Duality in First-Order Methods#925628
- Convex optimization for actionable & plausible counterfactual explanations#779283
- Moment Relaxations for Data-Driven Wasserstein Distributionally Robust Optimization#927129
- A minimization problem for a cooperative system with a degenerate Bernoulli weight#1061182
- Basic Inequalities for First-Order Optimization with Applications to Statistical Risk Analysis#1084105
Record · ID 985533
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