Pith. Sign in

RECORD

A Bregman projection method for approximating fixed points of quasi-Bregman nonexpansive mappings

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Heinz H. Bauschke, Jiawei Chen, Xianfu Wang

Functional Analysis · Submitted 25 Sep 2013

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim As an application, the asymptotic behaviour of an iterative method for finding a fixed point of a quasi Bregman nonexpansive mapping with the fixed-point closedness property is analyzed.

how it is stated · asserted 0.98 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1309.6402 (version 1)
Pith IDVR2OHMEN, Pith's permanent record of this paper and its review
CitationHeinz H. Bauschke, Jiawei Chen, Xianfu Wang. "A Bregman projection method for approximating fixed points of quasi-Bregman nonexpansive mappings." arXiv:1309.6402 (2013). https://pith.science/paper/VR2OHMEN
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 2,903 input tokens, $0.0001 reported.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.08 · human participants 0.02 · controlled comparison 0.01 · randomized assignment 0.01 · states quantitative result 0.04 · compares with prior results 0.06 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

We introduce an abstract algorithm that aims to find the Bregman projection onto a closed convex set. As an application, the asymptotic behaviour of an iterative method for finding a fixed point of a quasi Bregman nonexpansive mapping with the fixed-point closedness property is analyzed. We also show that our result is applicable to Bregman subgradient projectors.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We introduce an abstract algorithm that aims to find the Bregman projection onto a closed convex set. contribution 0.87 0.92 0.12 asserted 0.95
s1 As an application, the asymptotic behaviour of an iterative method for finding a fixed point of a quasi Bregman nonexpansive mapping with the fixed-point closedness property is analyzed. contribution 0.79 0.81 0.42 asserted 0.98
s2 We also show that our result is applicable to Bregman subgradient projectors. result 0.48 0.93 0.13 asserted 1.00

What kind of paper the classifier reports this is: method or tool 0.93 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

We introduce an abstract algorithm that aims to find the Bregman projection onto a closed convex set. As an application, the asymptotic behaviour of an iterative method for finding a fixed point of a quasi Bregman nonexpansive mapping with the fixed-point closedness property is analyzed. We also show that our result is applicable to Bregman subgradient projectors.

Human review

How Pith checks papers → · Full audit of this paper →

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.