Interval adjustable entropy algorithm for a class of unconstrained discrete minimax problems

DOI10.1007/s11766-004-0019-8zbMath1049.65051OpenAlexW1983423302MaRDI QIDQ1430634

Subei Li, Kazhong Deng, Hai-Jun Wang, De-Xin Cao

Publication date: 27 May 2004

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-004-0019-8

zbMATH Keywords

convergencediscrete minimax probleminterval algorithmadjustable entropy function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Minimax problems in mathematical programming (90C47) General methods in interval analysis (65G40)

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An interval version of Shubert's iterative method for the localization of the global maximum
• An interval maximum entropy method for a discrete minimax problem
• An interval algorithm for nondifferentiable global optimization
• On discrete minimax problems in \(\mathbb{R}\) using interval arithmetic