arXiv (All)
open access
Right Bregman proximal gradient with application to Poisson inverse problems *
We introduce a novel Bregman proximal algorithm for convex composite optimization by applying the standard Bregman proximal gradient (BPG) method to a mirror-coordinate reparameterization of the objective. In primal variables, the resulting algorithm alternates between a preconditioned gradient step
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
- Accelerated Bregman Proximal Gradient Methods from Dual Geometric Perspectives#1129394
- On the Complexity of BFGS Method for Smooth Convex Optimization#617683
- On the Complexity of BFGS Method for Smooth Convex Optimization#617183
- A splitting proximal method in portfolio optimization with entropic value-at-risk#1325260
- Sampled-Max Subgradient Method for Convex Finite-Max Optimization#1117585
Record · ID 1215677
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