Computational aspects of general minimax optimization

DOI10.1007/BF01432810zbMATH Open0823.90117OpenAlexW2059310549MaRDI QIDQ4698115FDOQ4698115

Shinji Tanimoto

Publication date: 14 May 1995

Published in: ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01432810

zbMATH Keywords

exchange algorithmoptimality conditionsminimax theoremChebyshev approximation

Mathematics Subject Classification ID

Nonlinear programming (90C30) Programming in abstract spaces (90C48) Existence of solutions for minimax problems (49J35)

Cites Work

• A course on optimization and best approximation
• Title not available (Why is that?)
• Duality for a class of nondifferentiable mathematical programming problems
• A Structure-Exploiting Algorithm for Nonlinear Minimax Problems
• Uniform approximation and a generalized minimax theorem

Cited In (3)

• Computational method for minimax optimization in the time domain
• Computational experience concerning payoff tables and minimum criterion values over the efficient set
• On uniform constants of strong uniqueness in Chebyshev approximations and fundamental results of N. G. Chebotarev

   Recommendations

• Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan 👍 👎
• Title not available (Why is that?) 👍 👎
• Solution of minimax problems using equivalent differentiable functions 👍 👎
• Computational method for minimax optimization in the time domain 👍 👎

This page was built for publication: Computational aspects of general minimax optimization

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