pith. sign in

arxiv: 2303.01474 · v1 · pith:WPLI3CLWnew · submitted 2023-03-02 · 🧮 math.OC

Sensitivity analysis of the maximal value function with applications in nonconvex minimax programs

classification 🧮 math.OC
keywords functionvaluemaximalanalysissensitivityapproachderivedestimates
0
0 comments X
read the original abstract

In this paper, we perform 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\'{e}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 compare favourably with the first order approach in that the necessary condition is sharper and the constraint qualification is weaker.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.