An interval maximum entropy method for a discrete minimax problem

DOI10.1016/S0096-3003(96)00220-2zbMath0907.65058MaRDI QIDQ1126620

Zhen Yu Huang, Michael A. Wolfe, Zu He Shen

Publication date: 18 February 1999

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(96)00220-2

zbMATH Keywords

entropy function; discrete minimax problem; interval maximum entropy method

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C26: Nonconvex programming, global optimization

90C30: Nonlinear programming

65G30: Interval and finite arithmetic

Related Items

A generalized neural network for solving a class of minimax optimization problems with linear constraints, Interval adjustable entropy algorithm for a class of unconstrained discrete minimax problems, Interval mathematics, algebraic equations and optimization, Interval method for global solutions of a class of min-max-min problems

Uses Software

• PASCAL-XSC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Derived eigenvalues of symmetric matrices, with applications to distance geometry
• An interval version of Shubert's iterative method for the localization of the global maximum
• Interval-majorant method and global optimization
• Information Theory and Statistical Mechanics
• Iterative Methods for the Localization of the Global Maximum
• An algorithm for seeking the maximum value of univariate functions
• An algorithm for finding the absolute extremum of a function
• A Sequential Method Seeking the Global Maximum of a Function