A constraint qualification in quasidifferentiable programming (Q3979519)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 20098
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A constraint qualification in quasidifferentiable programming |
scientific article; zbMATH DE number 20098 |
Statements
A constraint qualification in quasidifferentiable programming (English)
0 references
26 June 1992
0 references
recession function
0 references
quasidifferentiable optimization
0 references
general position hypothesis
0 references
constraint qualification
0 references
0 references
0 references
0.8708009719848633
0 references
0.8698791861534119
0 references
0.8690572381019592
0 references
0.8521499633789062
0 references
In quasidifferentiable optimization people should be careful in deriving optimality conditions because a quasidifferentiable function has generally a multitude of possible quasidifferentials. A good optimality condition should not depend on a particular choice of quasidifferentials. Demyanov and Rubinov presented a condition which is independent of the particular choice of quasidifferentials but involves the hypothesis of a pair of convex sets being ``in a general position''. This paper gives a simple condition implying that the general position hypothesis is satisfied. This condition, a Slater-type condition, is also shown to be a constraint qualification for non-asymptotic Kuhn-Tucker conditions for an inequality-constrained quasidifferentiable program.
0 references
