Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
The paper deals with the following mathematical program: (MPEC) \[ \min \{f(x,y) \mid y \in S(x), x \in W \} \] where \(S(x)= \{y \in \mathbb{R} ^n \mid F(x,y) \geq 0 (1)\), \(y \geq 0\), \(y^TF(x,y) =0\}. \) \(F(f)\) are assumed locally Lipschitz (continuously differentiable). The set of \((x,\;y)\) with \(y \in S(x)\) is denoted by \(\Omega\) hence feasible set of (MPEC) is described as \(\Omega \bigcap (W \times \mathbb{R}^n_+)\) and denoted by \(\Pi\): \(y \in S(x)\) iff \(y \geq 0\) and \(y\) solves the generalized equation: \(0 \in F(x,y) + N_{ \mathbb{R}{^n}_+}(y)\), (where \(N_{ \mathbb{R}{^n}_+}(y)\), denotes the standard normal cone at \(y\) if \(y \geq 0\) and empty otherwise). In the paper \(K_{A}(z)\) denotes the generalized normal cone of the subset \(A\) at \(z\). In this paper Mordukhovich's generalized differential calculus is applied to derive necessary conditions in terms of upper approximations of the generalized normal cone of the feasible set of (MPEC), \(K_{\Pi}(y)\), and the subdifferential of \(f\), \( \partial^- f\). At first the author gives a constraint qualification condition (CQ), under which an upper approximation of \(K_{\Omega}(z)\) is obtained. It is proved that (CQ) is implied by linear independence constraint qualification condition (LICQ) and by the strong regularity of Robinson. Another constraint qualification (CQ*), which implies (CQ), is also proposed. It guarantees the required assumption [\textit{B. S. Mordukhovich}, Approximation methods in problems of optimization and control. Nauka, Moscow (1988; Zbl 0643.49001)] to obtain \(K_{ A \cup B}(z) \subset K_A + K_B\), \(A,B \subset \mathbb{R}^n\). Applying that result and the above upper approximation of \(K_{\Omega}(z)\) , the elements of \(K_\Pi\) can be written in a more suitable way . In the paper, different lemmas and propositions are also proven in order to express the constraints qualifications conditions and the results in a more workable form. Assuming that \(W\) is described by inequalities involving continuously differentiable functions and that Mangasarian -Fromowitz constraint qualification is fulfilled for \(W\), the author proves that the necessary and sufficient condition (CQ*) holds and that (CQ*) is implied by the so-called piecewise MFCQ. Besides if \(f\) is continuously differentiable it is remarked that the necessary optimality condition given in this paper is stronger that the one resulting of applying the generalized calculus of Clarke with the complementarity constraint replaced by the equality system: \[ \min \{F_i (x,y),x_i) \}, \quad i=1\dots n. \]
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints
- New sharp necessary optimality conditions for mathematical programs with equilibrium constraints
- Notes on some constraint qualifications for mathematical programs with equilibrium constraints
- scientific article; zbMATH DE number 6147934
- Partial exact penalty for mathematical programs with equilibrium constraints
- Characterizations of linear suboptimality for mathematical programs with equilibrium constraints
- Suboptimality conditions for mathematical programs with equilibrium constraints
- Saddle point optimality criteria for mathematical programming problems with equilibrium constraints
- MPCC: strong stability of \(m\)-stationary points
- Some results on mathematical programs with equilibrium constraints
- Coderivatives and Aubin property of efficient point and efficient solution set-valued maps in parametric vector optimization
- Optimality conditions for nonsmooth multiobjective bilevel optimization problems
- New sharp necessary optimality conditions for mathematical programs with equilibrium constraints
- On approximate stationary points of the regularized mathematical program with complementarity constraints
- Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation
- Strongly stable C-stationary points for mathematical programs with complementarity constraints
- On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach
- Two new weak constraint qualifications for mathematical programs with equilibrium constraints and applications
- Linearized M-stationarity conditions for general optimization problems
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- On M-stationarity conditions in MPECs and the associated qualification conditions
- Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints
- Characterization of strong stability for C-stationary points in MPCC
- Necessary conditions in multiobjective optimization with equilibrium constraints
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- On M-stationary points for mathematical programs with equilibrium constraints
- Coderivatives of gap function for minty vector variational inequality
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- Optimality conditions for mathematical programs with orthogonality type constraints
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
- On efficiency conditions for nonsmooth vector equilibrium problems with equilibrium constraints
- Towards M-stationarity for optimal control of the obstacle problem with control constraints
- On computation of limiting coderivatives of the normal-cone mapping to inequality systems and their applications
- A note on stability of stationary points in mathematical programs with generalized complementarity constraints
- Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
- Optimality conditions for disjunctive programs based on generalized differentiation with application to mathematical programs with equilibrium constraints
- Optimality conditions for nonsmooth equilibrium problems via Hadamard directional derivative
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
- On the Guignard constraint qualification for mathematical programs with equilibrium constraints
- A relaxed constant positive linear dependence constraint qualification for mathematical programs with equilibrium constraints
- Shape optimization in 2D contact problems with given friction and a solution-dependent coefficient of friction
- On a special class of mathematical programs with equilibrium constraints
- A Generalized Mathematical Program with Equilibrium Constraints
- Improved convergence properties of the relaxation schemes of Kadrani et al. and Kanzow and Schwartz for MPEC
- New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints
- The limiting normal cone of a complementarity set in Sobolev spaces
- Enhanced Karush-Kuhn-Tucker conditions for mathematical programs with equilibrium constraints
- scientific article; zbMATH DE number 6147934 (Why is no real title available?)
- On directional metric regularity, subregularity and optimality conditions for nonsmooth mathematical programs
- MPEC methods for bilevel optimization problems
- Sequential linearization method for bound-constrained mathematical programs with complementarity constraints
- A note on the paper “Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints”
- Semicontinuity of the solution maps to vector equilibrium problems with equilibrium constraints
- On the relation between MPECs and optimization problems in abs-normal form
- Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints
- Solution of bilevel optimization problems using the KKT approach
- Mathematical programs with equilibrium constraints: A brief survey of methods and optimality conditions
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
- A note on a class of equilibrium problems with equilibrium constraints.
- Equilibrium problems with complementarity constraints: case study with applications to oligopolistic markets
- Active set algorithm for mathematical programs with linear complementarity constraints
- Sensitivity analysis of gap functions for vector variational inequality via coderivatives
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- New constraint qualifications for mathematical programs with equilibrium constraints via variational analysis
- Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences
- Optimality conditions for mathematical programs with equilibrium constraints using directional convexificators
- Comparison of optimality systems for the optimal control of the obstacle problem
- On some optimality conditions for a class of problems in mathematical programming with equilibrium constraints
- Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications
- Approximation methods for a class of non-Lipschitz mathematical programs with equilibrium constraints
- MPCC: strong stability of weakly nondegenerate S-stationary points
- Augmented Lagrangian neural network for solving mathematical programs with equilibrium constraints
- New sufficient and necessary conditions for constrained and unconstrained Lipschitzian error bounds
- Limiting normal cones to the union of two convex sets and M-stationarity: local uniqueness and stability in mathematical programming
- Second-order Studniarski derivatives: computation and application
- Solving mathematical programs with complementarity constraints arising in nonsmooth optimal control
- Partial augmented Lagrangian method for non-Lipschitz mathematical programs with complementarity constraints
- Optimization problems with equilibrium constraints and their numerical solution.
- Proximal penalty method for sparse optimization with complementarity constraints
- Limiting normal cone to quadric surfaces, local uniqueness and error bound in M-stationarity
- A Lasry-Lions envelope approach for mathematical programs with complementarity constraints
- On stability of M-stationary points in mpccs
- Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints
- Convergence properties of a smoothing approach for mathematical programs with second-order cone complementarity constraints
- Constraint qualifications for nonsmooth mathematical programs with equilibrium constraints
- Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints
- Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties
- On sharp necessary optimality conditions in control of contact problems with strings
- Existence of minimizers and necessary conditions in set-valued optimization with equilibrium constraints.
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
This page was built for publication: Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4951042)