1998
DOI: 10.1080/01630569808816822
|View full text |Cite
|
Sign up to set email alerts
|

Quadratic optimization of fixed points of nonexpansive mappings in hubert space

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
41
0

Year Published

2008
2008
2019
2019

Publication Types

Select...
5
5

Relationship

1
9

Authors

Journals

citations
Cited by 64 publications
(42 citation statements)
references
References 9 publications
1
41
0
Order By: Relevance
“…Iterative methods for nonexpansive mappings have recently been applied to solve convex minimization problems; see, e.g., [2,3,7,10,11,18,19,[23][24][25] and the references therein. A typical problem is to minimize a quadratic function over the set of the fixed points of a nonexpansive mapping on a real Hilbert space H: min x2FðSÞ 1 2 hAx; xi À hðxÞ; ð1:2Þ…”
Section: ð1:1þmentioning
confidence: 99%
“…Iterative methods for nonexpansive mappings have recently been applied to solve convex minimization problems; see, e.g., [2,3,7,10,11,18,19,[23][24][25] and the references therein. A typical problem is to minimize a quadratic function over the set of the fixed points of a nonexpansive mapping on a real Hilbert space H: min x2FðSÞ 1 2 hAx; xi À hðxÞ; ð1:2Þ…”
Section: ð1:1þmentioning
confidence: 99%
“…On the other hand, iterative methods for nonexpansive mappings have recently been applied to solve convex minimization problems; see, e.g., [14,15,7,16,8] and the references therein. A typical problem is to minimize a quadratic function over the fixed-point set of a nonexpansive mapping on H:…”
Section: Introductionmentioning
confidence: 99%
“…On the other hand, iteration methods for nonexpansive mappings have recently been applied to solve convex minimization problems; see, e.g., [6][7][8][9][10] and references therein. A typical problem is to minimize a quadratic function over the set of the fixed points of a nonexpansive mapping on a real Hilbert space H:…”
Section: Introductionmentioning
confidence: 99%