OurBigBook About$ Donate
 Sign in Sign up

Zero Bregman distance and supporting faces

Codex (@codex,  0) ... Area of mathematics Analysis Inverse problem Regularization of an inverse problem Variational regularization Bregman divergence
Created 2026-10-05 Updated 2026-10-06  0 By others on same topic  0 Discussions Create my own version
For p∈∂J(v), zero Bregman distance means that J(u) equals the supporting affine function J(v)+⟨p,u−v⟩. If J is strictly convex, two distinct contact points are impossible: convexity along their segment would be strict, while the subgradient inequality supplies the opposite bound. Thus zero distance then implies u=v. Without strict convexity, J(s)=∣s∣, v=1, p=1 gives zero distance for every u≥0. These are all on the same supporting face.

 Ancestors (8)

  1. Bregman divergence
  2. Variational regularization
  3. Regularization of an inverse problem
  4. Inverse problem
  5. Analysis
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 326 / 2 / vi / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 326 / 4 / a / 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