An interval maximum entropy method for a discrete minimax problem (Q1126620): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0096-3003(96)00220-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2019500668 / rank | |||
Normal rank | |||
Latest revision as of 11:28, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An interval maximum entropy method for a discrete minimax problem |
scientific article |
Statements
An interval maximum entropy method for a discrete minimax problem (English)
0 references
18 February 1999
0 references
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.
0 references
entropy function
0 references
interval maximum entropy method
0 references
discrete minimax problem
0 references
0 references
