2020
DOI: 10.1080/02331934.2019.1711085
|View full text |Cite
|
Sign up to set email alerts
|

Directional openness for epigraphical mappings and optimality conditions for directional efficiency

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…While it cannot be possible to have a directional openness at an approximate efficiency point, after making a careful choice of some constants, we focus on proving that F can be directional open at an arbitrary point (x, y) ∈ Gr F . The Theorem 3.10 from [9] is the key to the proof of the next result. Before moving forward, we will briefly recall some construction introduced by Mordukhovich and his collaborators (see [12]).…”
Section: Optimality Conditions For Approximate Minimamentioning
confidence: 86%
See 2 more Smart Citations
“…While it cannot be possible to have a directional openness at an approximate efficiency point, after making a careful choice of some constants, we focus on proving that F can be directional open at an arbitrary point (x, y) ∈ Gr F . The Theorem 3.10 from [9] is the key to the proof of the next result. Before moving forward, we will briefly recall some construction introduced by Mordukhovich and his collaborators (see [12]).…”
Section: Optimality Conditions For Approximate Minimamentioning
confidence: 86%
“…Proof. The hypotheses (i) and (ii), together with our fixed framework, allow us to obtain the conclusion of Theorem 3.10 from [9], that is, for every a ∈ (0, d), there exists θ > 0 such that, for every ρ ∈ (0, θ) and for all (x, y) ∈ Gr for some r > 0. In particular, the above inclusion holds for (x, y) ∈ Gr F .…”
Section: Optimality Conditions For Approximate Minimamentioning
confidence: 99%
See 1 more Smart Citation