A General Sufficiency Theorem for Nonsmooth Nonlinear Programming

DOI10.2307/1999429MaRDI QIDQ4741295zbMATH OpenOpenAlexFDO

Authors Robin W. Chaney

Publication date 1983

Full work available at URL https://doi.org/10.2307/1999429

zbMATH Keywords

generalized gradientsnonsmooth optimizationsecond-order conditions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Continuity and differentiation questions (26B05) Optimality conditions (49K99) Optimality conditions for free problems in two or more independent variables (49K10)

Cites work

• scientific article; zbMATH DE number 3655665 (Why is no real title available?)
• scientific article; zbMATH DE number 3662899 (Why is no real title available?)
• scientific article; zbMATH DE number 3496814 (Why is no real title available?)
• scientific article; zbMATH DE number 3513549 (Why is no real title available?)
• scientific article; zbMATH DE number 3276736 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• A New Approach to Lagrange Multipliers
• Clarke's tangent cones and the boundaries of closed sets in Rn
• Directionally Lipschitzian Functions and Subdifferential Calculus
• First and second order conditions for a class of nondifferentiable optimization problems
• Generalized Directional Derivatives and Subgradients of Nonconvex Functions
• Generalized Gradients and Applications
• Generalized gradients of Lipschitz functionals
• Generic Differentiability of Lipschitzian Functions
• Lagrange multipliers and subderivatives of optimal value functions in nonlinear programming
• Necessary and Sufficient Conditions for a Local Minimum. 3: Second Order Conditions and Augmented Duality
• On Sufficient Conditions in Nonsmooth Optimization
• Refinements of necessary optimality conditions in nondifferentiable programming. I
• Second-Order Sufficiency Conditions for Nondifferentiable Programming Problems
• Second-order optimality conditions for a class of nonlinear programming problems
• Semismooth and Semiconvex Functions in Constrained Optimization
• Submonotone Subdifferentials of Lipschitz Functions
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints

Cited in

(6)

• On second derivatives for nonsmooth functions
• First- and Second-Order Epi-Differentiability in Nonlinear Programming
• Exact penalty functions and stability in locally Lipschitz programming
• Generalized Second Derivatives of Convex Functions and Saddle Functions
• Optimality conditions in mathematical programming and composite optimization
• Second-order necessary and sufficient conditions in nonsmooth optimization

This page was built for publication: A General Sufficiency Theorem for Nonsmooth Nonlinear Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4741295)