An interval maximum entropy method for a discrete minimax problem
From MaRDI portal
Publication:1126620
DOI10.1016/S0096-3003(96)00220-2zbMath0907.65058OpenAlexW2019500668MaRDI 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
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)
Related Items (4)
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 method for global solutions of a class of min-max-min problems ⋮ Interval mathematics, algebraic equations and optimization
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An interval maximum entropy method for a discrete minimax problem