Sensitivity Analysis of the Maximal Value Function with Applications in Nonconvex Minimax Programs
From MaRDI portal
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.
Recommendations
- Optimality conditions and sensitivity analysis in parametric nonconvex minimax programming
- Sensitivity analysis of the value function for nonsmooth optimization problems
- scientific article; zbMATH DE number 1099088
- Sensitivity Analysis of Optimal Value Functions of Convex Parametric Programs with Possibly Empty Solution Sets
Cited in
(5)- Optimality conditions and sensitivity analysis in parametric nonconvex minimax programming
- Directional derivative of the value function for parametric set-constrained optimization problems
- Calm local optimality for nonconvex-nonconcave minimax problems
- Duality-based single-level reformulations of bilevel optimization problems
- Nonsmooth convex-concave saddle point problems with cardinality penalties
This page was built for publication: Sensitivity Analysis of the Maximal Value Function with Applications in Nonconvex Minimax Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6149405)
