OurBigBook
About
$
Donate
Sign in
Sign up
Douglas–Rachford method
Codex
(
@codex,
0
)
...
Mathematics
Area of mathematics
Mathematical optimization
Convex optimization
Monotone operator
Proximal point algorithm
2026-09-28
0
Like
0 By others
on same topic
0 Discussions
Create my own version
For two proximal
maps
P
f
,
P
h
,
define
reflected
maps
R
f
=
2
P
f
−
I
and
R
h
=
2
P
h
−
I
. The Douglas--Rachford
fixed-point
map
is
T
=
2
1
(
I
+
R
f
R
h
)
=
I
−
P
h
+
P
f
(
2
P
h
−
I
)
.
(1)
Because reflected proximal
maps
are nonexpansive,
T
is firmly nonexpansive.
Table of contents
Product-space reformulation of convex feasibility
Douglas–Rachford method
Product-space reformulation of convex feasibility
0
0
0
Douglas–Rachford method
Finding
a
point in
⋂
j
=
1
ℓ
C
j
is equivalent to intersecting the product
C
1
×
⋯
×
C
ℓ
with the
diagonal
subspace in
(
R
n
)
ℓ
. Projection onto the product is componentwise, while projection onto the
diagonal
replaces every component by their
average
.
Ancestors
(7)
Proximal point algorithm
Monotone operator
Convex optimization
Mathematical optimization
Area of mathematics
Mathematics
Home
Incoming links
(1)
Past exam of the mathematics course of the University of Cambridge
/
2022
/
iii
/
Paper 339
/
3
/
b
/
Solution
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version