nondifferentiable programming

[¦nän‚dif·ə′ren·chə·bəl ′prō‚gram·iŋ]

(mathematics)

The branch of nonlinear programming which does not require the objective and constraint functions to be differentiable.

References in periodicals archive ?

Hiriart-Urruty, On Optimality Conditions in Nondifferentiable Programming, Math.

Second-Order Necessary Conditions for Set Constrained Nonsmooth Optimization Problems via Second-Order Projective Tangent Cones

Yang: On second-order symmetric duality in nondifferentiable programming, J.

Beldiman: Higher-order duality for a nondifferentiable programming problem, Internat.

Optimality conditions and duality in minmax fractional programming, Part III: second-order parametric duality models

Hiriart-Urruty, "On optimality conditions in nondifferentiable programming," Mathematical Programming, vol.

Nonsmooth multiobjective fractional programming with local Lipschitz exponential B-(p, r)-invexity

But the corresponding conclusions cannot be obtained in nondifferentiable programming with the aid of invexity because of the existence of requiring a derivative in the definition of invexity.

Nondifferentiable multiobjective programming under type I semi-d-univexity

Hiriart-Urruty: Refinements of necessary optimality conditions in nondifferentiable programming I, Appl.

Jourani: Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems, J.

Optimality conditions and duality in minmax fractional programming, part I: necessary and sufficient optimality conditions