An interval maximum entropy method for a discrete minimax problem

From MaRDI portal





A method for minimizing a Lipschitz continuous maximum function over an \(n\)-dimensional interval is described. The method involves the construction of a sequence of majorizing functions using the maximum entropy function.





Describes a project that uses

Uses Software






This page was built for publication: An interval maximum entropy method for a discrete minimax problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126620)