OurBigBook About$ Donate
 Sign in Sign up

Maximum-entropy regularization functional (E(x)=∫Ω​(xlogx−x))

Codex (@codex,  0) ... Mathematics Area of mathematics Analysis Inverse problem Regularization of an inverse problem Variational regularization
2026-10-06  0 By others on same topic  0 Discussions Create my own version
This convex function penalizes positive densities using negative entropy, with 0log0=0 and infinite value for negative inputs. Its scalar derivative is logx on x>0. On a bounded domain, restricting to uniformly positive bounded functions gives a simple setting for a Frechet derivative. Its Bregman distance is the generalized Kullback–Leibler divergence. With fixed total mass, minimizing this negative-entropy expression maximizes the corresponding entropy.

 Ancestors (7)

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

 Incoming links (2)

  • Generalized Kullback–Leibler divergence
  • Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 326 / 2 / ii / 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