Back to Search Start Over

Sensitivity Analysis of the Maximal Value Function with Applications in Nonconvex Minimax Programs.

Authors :
Guo, Lei
Ye, Jane J.
Zhang, Jin
Source :
Mathematics of Operations Research; Feb2024, Vol. 49 Issue 1, p536-556, 21p
Publication Year :
2024

Abstract

In this paper, we perform a sensitivity analysis for the maximal value function, which is the optimal value function for a parametric maximization problem. Our aim is to study various subdifferentials for the maximal value function. We obtain upper estimates of Fréchet, limiting, and horizon subdifferentials of the maximal value function by using some sensitivity analysis techniques sophisticatedly. The derived upper estimates depend only on the union of all solutions and not on its convex hull or only one solution from the solution set. Finally, we apply the derived results to develop some new necessary optimality conditions for nonconvex minimax problems. In the nonconvex-concave setting, our Wolfe duality approach compares favorably with the first-order approach in that the necessary condition is sharper and the constraint qualification is weaker. Funding: L. Guo was supported by the National Natural Science Foundation of China [Grants 72131007, 72140006, and 12271161] and the Natural Science Foundation of Shanghai [Grant 22ZR1415900]. J. J. Ye was partially supported by the Natural Sciences and Engineering Research Council of Canada. J. Zhang was supported by the National Natural Science Foundation of China [Grant 12222106], the Shenzhen Science and Technology Program [Grant RCYX20200714114700072], and the Guangdong Basic and Applied Basic Research Foundation [Grant 2022B1515020082]. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
0364765X
Volume :
49
Issue :
1
Database :
Complementary Index
Journal :
Mathematics of Operations Research
Publication Type :
Academic Journal
Accession number :
175301332
Full Text :
https://doi.org/10.1287/moor.2023.1366