2014
DOI: 10.1080/02331934.2014.987776
|View full text |Cite
|
Sign up to set email alerts
|

Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 27 publications
(5 citation statements)
references
References 28 publications
0
5
0
Order By: Relevance
“…Clearly, (y, ξ L , ξ U , μ) = (0, 1, 1, 1) is a feasible solution to (IMWD) and objective value is [1,2]. We also note that x = 2 is a feasible solution to (IVP2) and corresponding objective value is [3,22].…”
Section: Theorem 41 (Weak Duality) Let X and (Y ξ L ξ U μ) Be Tmentioning
confidence: 94%
See 1 more Smart Citation
“…Clearly, (y, ξ L , ξ U , μ) = (0, 1, 1, 1) is a feasible solution to (IMWD) and objective value is [1,2]. We also note that x = 2 is a feasible solution to (IVP2) and corresponding objective value is [3,22].…”
Section: Theorem 41 (Weak Duality) Let X and (Y ξ L ξ U μ) Be Tmentioning
confidence: 94%
“…By using a Guignard constraint qualification, some stronger Kuhn-Tucker type necessary optimality conditions for efficiency in terms of convexifactors were established. Further, Ardali et al [2] used the notion of convexifactor to study constraint qualifications, stationary concepts and optimality conditions for a nonsmooth mathematical programs with equilibrium constraints. Golestani and Nobakhtian [13] presented optimality conditions for nonsmooth semidefinite programming via convexificators.…”
Section: Introductionmentioning
confidence: 99%
“…Utilizing the above notations, motivated by [37], we are ready to introduce the Abadie type constraint qualification in the form of convexificator which is very important to establish the optimality conditions. Definition 3.1.…”
Section: Optimality Conditions For Nonsmooth Mathematical Program With Vanishing Constraintsmentioning
confidence: 99%
“…If the GS-ACQ holds at x , then x is a GS stationary point. Now, we provide the following example to illustrate Theorem 3.1, this example is a modified version of Example 4.7 in [37].…”
Section: I I I K Cone Co G Cone Co H Cone Co H Cone Co H Cone Co G Cone Co Hmentioning
confidence: 99%
See 1 more Smart Citation