Second-Order Sufficiency Conditions for Nondifferentiable Programming Problems
R. W. Chaney · SIAM Journal on Control and Optimization · 1982
Second-order conditions are given which are sufficient for a point to be a local minimizes for a finite-dimensional nonlinear programming problem with a finite number of constraints. In the most general theorem, the functions which comprise the problem are required only to be locally Lipschitz. The sufficiency conditions are given in terms of Clarke generalized gradients. These conditions assume a somewhat more familiar form when the functions in the problem are assumed to be both semismooth and subdifferentiably regular.