1980
DOI: 10.1016/0041-5553(80)90269-4
|View full text |Cite
|
Sign up to set email alerts
|

Minimization of a quasi-differentiable function in a quasi-differentiable set

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

1985
1985
2021
2021

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(6 citation statements)
references
References 1 publication
0
6
0
Order By: Relevance
“…The known results for necessary and sufficient optimality conditions for QD functions by [16], [19, Chap. V, Theorem 3.1] carry over to the directed subdifferential.…”
Section: Optimality Conditions Descent and Ascent Directionsmentioning
confidence: 99%
See 1 more Smart Citation
“…The known results for necessary and sufficient optimality conditions for QD functions by [16], [19, Chap. V, Theorem 3.1] carry over to the directed subdifferential.…”
Section: Optimality Conditions Descent and Ascent Directionsmentioning
confidence: 99%
“…We now state sufficient optimality conditions for the directed subdifferential (see [16], [19,Secs. V.1 and V.3] and [20]). Proposition 4.4.…”
Section: Optimality Conditions Descent and Ascent Directionsmentioning
confidence: 99%
“…One important advantage of this approach is that all the tools and methods can be built and used not only theoretically but also in practical problems. The approach goes back to the early 80-th when Demyanov, Rubinov and Polyakova proposed and studied the notion of quasidifferentials [2][3][4][5]. Quasidifferentials are pairs of convex compact sets that enable one to represent the directional derivative of a function at a point in a form of sum of maximum and minimum of a linear functions.…”
Section: Introductionmentioning
confidence: 99%
“…Necessary and sufficient conditions for an unconstrained local minimum in terms of quasidifferentials were first obtained in [10,54]. In [9], Demyanov and Polyakova studied optimality conditions in terms of quasidifferentials for the problem min f 0 (x) subject to h(x) ≤ 0.…”
Section: Introductionmentioning
confidence: 99%
“…[46, Example 1]), optimality conditions for quasidifferentiable programming problems cannot be formulated in the traditional way involving the Lagrangian function, which results in the fact that optimality conditions for such problems can be stated in several non-equivalent forms. Optimality conditions for problem (1) from [9] were formulated in geometric terms and involved some cones generated by a quasidifferential of the constraint. Optimality conditions for problem (1) similar to Fritz John and KKT conditions in which Lagrange multipliers depend on individual elements of quasidifferentials were studied in [43,46,59].…”
Section: Introductionmentioning
confidence: 99%