Optimality conditions and sensitivity analysis in parametric nonconvex minimax programming
The authors consider the following parametric nonconvex minimax programming problem (PNMPP) on Banach spaces \(X,Y\):\N\[\N\min_{y \in G(x)} \max_{k \in K} \phi_k(x,y),\N\]\Nwhere \(x \in X\) is a parameter, \(G:X \rightarrow K\) is a given multi-function, \(K\) is a finite set, \( \phi_k: X \times Y \rightarrow R \cup \{-\infty, \infty \},~k \in K \).\N\NConcepts of local and global optimal solutions of PNMPP are defined. The corresponding necessary and sufficient optimality conditions are proved using Morduchovich subdifferential. The results are applied further to multi-objective optimization problems. An illustrative example demonstrating the obtained theoretical results is provided.
- An Easy Path to Convex Analysis and Applications
- Approximate subdifferentials and applications 3: the metric theory
- Chain rules for coderivatives of multivalued mappings in Banach spaces
- Convex analysis and beyond. Volume I. Basic theory
- Differential stability of convex optimization problems under inclusion constraints
- Generalized fractional programming duablity: a ratio game approach
- Geometric approach to convex subdifferential calculus
- scientific article; zbMATH DE number 986619 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 1552282 (Why is no real title available?)
- scientific article; zbMATH DE number 2174310 (Why is no real title available?)
- Intersection formulae and the marginal function in Banach spaces
- Metric inequality, subdifferential calculus and applications
- Metric regularity and subdifferential calculus
- Metric regularity and subdifferential calculus in Banach spaces
- Minimax programming as a tool for studying robust multi-objective optimization problems
- Necessary optimality conditions for minimax programming problems with mathematical constraints
- Nondifferentiable minimax programming problems with applications
- Nonlinear optimization.
- Nonsmooth sequential analysis in Asplund spaces
- On metric and calmness qualification conditions in subdifferential calculus
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
- Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications
- Sensitivity Analysis of the Maximal Value Function with Applications in Nonconvex Minimax Programs
- Subdifferentials of optimal value functions under metric qualification conditions
- Subdifferentials of the marginal functions in parametric convex optimization via intersection formulas
- Subgradients of marginal functions in parametric mathematical programming
- Variational geometric approach to generalized differential and conjugate calculi in convex analysis
- Existence and sensitivity analysis for nonconvex cubic optimization problems
- Sensitivity Analysis of the Maximal Value Function with Applications in Nonconvex Minimax Programs
- Approximate optimality conditions and sensitivity analysis in nearly convex optimization
- Optimality conditions at infinity for nonsmooth minimax programming problems with some applications
This page was built for publication: Optimality conditions and sensitivity analysis in parametric nonconvex minimax programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6607020)
