ISSN:
1436-4646
Keywords:
Constraint qualification
;
tangent cone
;
directional derivative
;
subgradient
;
upper convex approximate
;
nondifferentiable programming
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract We show that a familiar constraint qualification of differentiable programming has “nonsmooth” counterparts. As a result, necessary optimality conditions of Kuhn—Tucker type can be established for inequality-constrained mathematical programs involving functions not assumed to be differentiable, convex, or locally Lipschitzian. These optimality conditions reduce to the usual Karush—Kuhn—Tucker conditions in the differentiable case and sharpen previous results in the locally Lipschitzian case.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01580871
Permalink
