Maximum Entropy and Feasibility Methods for Convex and Nonconvex Inverse Problems

@inproceedings{Bragg2011MaximumEA,
  title={Maximum Entropy and Feasibility Methods for Convex and Nonconvex Inverse Problems},
  author={William Lawrence Bragg},
  year={2011}
}
We discuss informally two approaches to solving convex and nonconvex feasibility problems — via entropy optimization and via algebraic iterative methods. We shall highlight the advantages and disadvantages of each and give various related applications and limiting-examples. While some of the results are very classical, they are not as well known to… CONTINUE READING