arbiter
JournalsPricingAccount

Superiorization on solution sets of common fixed point problems with countable families of maps

Zaslavski Alexander J.

Pacific Journal of Optimization2025https://doi.org/10.61208/pjo-2025-008article
AJG 1
Weight
0.50

What the paper says

In this work using subgradient algorithm we study a minimization problem with a convex objective function on a domain, which is the solution set of a common fixed point problem with a countable family of quasi-nonexpansive mappings. Our algorithm generates a sequence of iterates which are approximate solutions of the corresponding fixed point problem. Additionally, also either this sequence converges to a solution of our minimization problem or the sequence is strictly Fejer monotone regarding the solution set of the common fixed point problem.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.61208/pjo-2025-008

Or copy a formatted citation

@article{zaslavski2025,
  title        = {{Superiorization on solution sets of common fixed point problems with countable families of maps}},
  author       = {Zaslavski Alexander J.},
  journal      = {Pacific Journal of Optimization},
  year         = {2025},
  doi          = {https://doi.org/https://doi.org/10.61208/pjo-2025-008},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Superiorization on solution sets of common fixed point problems with countable families of maps

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.