On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle
2021
In this paper, we study convex semi-infinite programming involving minimax problems. One of the difficulties in solving these problems is that the maximum type functions are not differentiable. Due...
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
51
References
0
Citations
NaN
KQI