Convex subcones of the contingent cone in nonsmooth calculus and optimization
Doug Ward
Abstract
Doug Ward
Abstract
The tangential approximants most useful in nonsmooth analysis and optimization are those which lie "between" the Clarke tangent cone and the Bouligand contigent cone. A study of this class of tangent cones is undertaken here. It is shown that although no convex subcone of the contingent cone has the isotonicity property of the contingent cone, there are such convex subcones which are more "accurate" approximants than the Clarke tangent cone and possess an associated subdifferential calculus that is equally strong. In addition, a large class of convex subcones of the contingent cone can replace the Clarke tangent cone in necessary optimality conditions for a nonsmooth mathematical program. However, the Clarke tangent cone plays an essential role in the hypotheses under which these calculus rules and optimality conditions are proven. Overall, the results obtained here suggest that the most complete theory of nonsmooth analysis combines a number of different tangent cones.
OpenAlex reports 44 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The tangential approximants most useful in nonsmooth analysis and optimization are those which lie "between" the Clarke tangent cone and the Bouligand contigent cone. A study of this class of tangent cones is undertaken here. It is shown that although no convex subcone of the contingent cone has the isotonicity property of the contingent cone, there are such convex subcones which are more "accurate" approximants than the Clarke tangent cone and possess an associated subdifferential calculus that is equally strong. In addition, a large class of convex subcones of the contingent cone can replace the Clarke tangent cone in necessary optimality conditions for a nonsmooth mathematical program. However, the Clarke tangent cone plays an essential role in the hypotheses under which these calculus rules and optimality conditions are proven. Overall, the results obtained here suggest that the most complete theory of nonsmooth analysis combines a number of different tangent cones.
Key concepts: Tangent cone, Mathematics, Cone (formal languages), Tangent, Dual cone and polar cone, Subderivative, Conic optimization, Convex cone