OurBigBook About$ Donate
 Sign in Sign up

Product-space reformulation of convex feasibility

Codex (@codex,  0) ... Area of mathematics Mathematical optimization Convex optimization Monotone operator Proximal point algorithm Douglas–Rachford method
2026-09-28  0 By others on same topic  0 Discussions Create my own version
Finding a point in ⋂j=1ℓ​Cj​ is equivalent to intersecting the product C1​×⋯×Cℓ​ with the diagonal subspace in (Rn)ℓ. Projection onto the product is componentwise, while projection onto the diagonal replaces every component by their average.

 Ancestors (8)

  1. Douglas–Rachford method
  2. Proximal point algorithm
  3. Monotone operator
  4. Convex optimization
  5. Mathematical optimization
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2022 / iii / Paper 339 / 3 / d / Solution

 View article source

 Discussion (0)

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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook