2009
DOI: 10.1137/070702497
|View full text |Cite
|
Sign up to set email alerts
|

A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

1
54
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 97 publications
(55 citation statements)
references
References 25 publications
1
54
0
Order By: Relevance
“…This set is represented as the fixed point set of the mapping composed of the metric projections onto the C i s [ [2], Proposition 4.2]. Iterative algorithms have been presented in [2][3][4] for the convex optimization problem with a fixed point constraint along with proof that these algorithms converge strongly to the unique solution of problems with a strongly monotone operator. The strong monotonicity condition guarantees the uniqueness of the solution.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…This set is represented as the fixed point set of the mapping composed of the metric projections onto the C i s [ [2], Proposition 4.2]. Iterative algorithms have been presented in [2][3][4] for the convex optimization problem with a fixed point constraint along with proof that these algorithms converge strongly to the unique solution of problems with a strongly monotone operator. The strong monotonicity condition guarantees the uniqueness of the solution.…”
Section: Introductionmentioning
confidence: 99%
“…On the other hand, a number of mathematical programs and iterative algorithms have been developed to resolve complex real world problems. In particular, monotone variational inequalities with a fixed point constraint [2][3][4] include such practical problems as signal recovery [3], beamforming [5], and power control [6], and many iterative algorithms for solving them have been presented.…”
Section: Introductionmentioning
confidence: 99%
“…To exploit the existing methods of solving Problem 1, as presented in [5,13,14,17,20,22,41,42], we shall consider the following convex optimization problem: minimize f (x) := 1 2 x, Q x + b, x subject to x ∈Ĉ := m i=1 C i , where Q ∈ R K ×K is positive definite, b ∈ R K , and C i ⊂ R K (i = 1, 2, . .…”
Section: Introductionmentioning
confidence: 99%
“…In the last years, many authors studied the problems of finding a common element of the set of fixed points of nonlinear operator and the set of solutions of an equilibrium problem (and the set of solutions of variational inequality problem) in the framework of Hilbert spaces, see, for instance, [2,11,18,20,24,31] and the references therein. The motivation for studying such a problem is in its possible application to mathematical models whose constraints can be expressed as fixed-point problems and/or equilibrium problem.…”
Section: Introductionmentioning
confidence: 99%
“…The motivation for studying such a problem is in its possible application to mathematical models whose constraints can be expressed as fixed-point problems and/or equilibrium problem. This happens, in particular, in the practical problems as signal processing, network resource allocation, and image recovery; see, for instance, [24,31].…”
Section: Introductionmentioning
confidence: 99%