A constraint qualification in quasidifferentiable programming
- 1 January 1991
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 22 (5) , 661-668
- https://doi.org/10.1080/02331939108843709
Abstract
One goal in quasid if Terentiable optimization is the development of optimality conditions whose hypotheses are independent of the particular choice of quasidifferentials. One such hypothesis, introduced by Demyanov and Rubinov, involves the concept of a pair of convex sets being “in a general position”. In this paper, a simple condition that implies the general position hypothesis is presented. This condition is also shown to be a constraint qualification for non-asymptotic Kuhn-Tucker conditions for a quasidifferentiable program.Keywords
This publication has 10 references indexed in Scilit:
- On Shapiro's results in quasidifferential calculusMathematical Programming, 1990
- Upper DSL approximates and nonsmooth optimizationOptimization, 1990
- Finite-dimensional optimality conditions: B-gradientsJournal of Optimization Theory and Applications, 1989
- The quasidifferential of an optimal value function in nonsmooth programmingOptimization, 1989
- The differentiability of real functions on normed linear space using generalized subgradientsJournal of Mathematical Analysis and Applications, 1987
- Quasidifferential calculus and first-order optimality conditions in nonsmooth optimizationPublished by Springer Nature ,1986
- Quasidifferential CalculusPublished by Springer Nature ,1986
- Necessary Conditions for the Bolza ProblemMathematics of Operations Research, 1985
- Nondifferentiable Optimization: Motivations and ApplicationsPublished by Springer Nature ,1985
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970