2020
DOI: 10.12988/ijma.2020.9737
|View full text |Cite
|
Sign up to set email alerts
|

Proximal point algorithms for fixed point problem and convex minimization problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
7
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(8 citation statements)
references
References 14 publications
1
7
0
Order By: Relevance
“…Lemma 2.2. (see, e.g., [10], [15]) Let H be defined as in Assumption 2.1. Then, for every s, t ∈ H and for every µ ∈ [0, 1], the following inequality holds…”
Section: Preliminarymentioning
confidence: 99%
See 3 more Smart Citations
“…Lemma 2.2. (see, e.g., [10], [15]) Let H be defined as in Assumption 2.1. Then, for every s, t ∈ H and for every µ ∈ [0, 1], the following inequality holds…”
Section: Preliminarymentioning
confidence: 99%
“…29) Lemma 2.7. (see, e.g., [15], [37] ) Let {s n } be a sequence of real numbers that does not decrease at infinity in the sense that there exists a subsequence s n k of {s n } such that…”
Section: Preliminarymentioning
confidence: 99%
See 2 more Smart Citations
“…The fixed-point algorithm (19) for solving problem (18) was first introduced in 1970 by Martinet [14], and was called a proximinal point algorithm (for short, PPA). In recent times, many researchers have studied and generalized (19), and many interesting results have been obtained for different classes of nonlinear single-valued and multivalued mappings: Rockfeller [15] solved problem ( 18) using ( 19); Marino and Xu [12], and subsequently Phuengrattan and Lerkchaiyaphum [16], obtained weak and strong convergence to the common solution of the minimization problem and fixed-point problem using the modified version of (19) in the setting of real Hilbert spaces.…”
Section: Introductionmentioning
confidence: 99%