Cao-zong Cheng, Bor-Luh Lin
Abstract
minimax theorem involving two functions is derived, where the convexity assumptions on two functions are given by mixed conditions, and in which we answer the open question raised by Forg´o and Jo´o in [2]. Simons’s upward-downward minimax theorem and Lin-Quan’s two functions symmetric minimax theorem are generalized.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
minimax theorem involving two functions is derived, where the convexity assumptions on two functions are given by mixed conditions, and in which we answer the open question raised by Forg´o and Jo´o in [2]. Simons’s upward-downward minimax theorem and Lin-Quan’s two functions symmetric minimax theorem are generalized.
Key concepts: Minimax theorem, Minimax, Mathematics, Convexity, Minimax approximation algorithm, Danskin's theorem, Pure mathematics, Combinatorics