Identification of Active Subfunctions in Finite-Max Minimisation via a Smooth Reformulation
arXiv2404.10326MaRDI QIDQ6530747FDOQ6530747
Authors: C. J. Ras, Matthew K. Tam, Daniel J. Uteda 
Convex programming (90C25) Complexity and performance of numerical algorithms (65Y20) Minimax problems in mathematical programming (90C47) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Optimality conditions for minimax problems (49K35) Numerical methods for variational inequalities and related problems (65K15) Acceleration of convergence in numerical analysis (65B99)
This page was built for publication: Identification of Active Subfunctions in Finite-Max Minimisation via a Smooth Reformulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6530747)
