An algorithm for maximizing entropy subject to simple bounds
From MaRDI portal
An unusual form of the maximum entropy problem is considered that includes simple bound constraints on the Fourier coefficients of the required image as well as nonnegativity conditions on the image intensities. An algorithm is presented, a proof of convergence is given and there are some remarks on numerical results.
Recommendations
Cited in
(10)- A sequential quadratic programming-based algorithm for the optimization of gas networks
- On the convergence of the coordinate descent method for convex differentiable minimization
- Proximal minimization algorithm with \(D\)-functions
- Entropy conservation for comparison-based algorithms
- An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem
- scientific article; zbMATH DE number 3938413 (Why is no real title available?)
- A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
- Minimal Entropy Approximations and Optimal Algorithms
- On Thurston’s core entropy algorithm
- Alternating direction method for maximum entropy subject to simple constraint sets.
This page was built for publication: An algorithm for maximizing entropy subject to simple bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106103)
