Nonsmooth calculus, minimality, and monotonicity of convexificators
https://doi.org/10.1023/A:1021790120780Publisher, magazine: ,
Publication year: 1999
Lưu Trích dẫn Chia sẻAbstract
A continuous function may have several convexificators at a point. A minimal convexificator at a point is one that does not contain any other convexificator at the point. The question of finding conditions for minimal convexificators of a continuous function and also the question of guaranteeing uniqueness of minimal convexificators has, thus for, remained open. In Section 3, the authors answer this question by presenting conditions in terms of the set of extreme points for minimal convexificators and unique minimal convexificators.
Tags: upper convex approximations; lower concave approximations; nonsmooth analysis; extremality; mean-value conditions; quasi-convexity; quasimonotonicity; minimal convexificators
Các bài viết liên quan đến tác giả Jeya Jeyakumar
Global minimization of difference of quadratic and convex functions over box or binary constraints
Convex composite non-Lipschitz programming
Sharp variational conditions for convex composite nonsmooth functions
An open mapping theorem using unbounded generalized Jacobians
Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
Nonsmooth calculus, minimality, and monotonicity of convexificators
Global optimality of quadratic minimization over symmetric polytopes