An optimality condition for a nondifferentiable convex program

DOI10.1002/NAV.3800300306zbMATH Open0535.90072OpenAlexW1983736233MaRDI QIDQ3320133FDOQ3320133

Authors Henry Wolkowicz 

Publication date 1983

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800300306

zbMATH Keywords

directional derivativesconesubdifferentialKarush-Kuhn-Tucker conditionsbinding constraintsNecessary optimality conditionsnondifferentiable convex program

Mathematics Subject Classification ID

Convex programming (90C25) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Recommendations

• Optimality conditions for nonsmooth convex programming problems
• Optimality Conditions for Nonconvex Constrained Optimization Problems
• scientific article; zbMATH DE number 4072728
• scientific article; zbMATH DE number 4051368
• scientific article; zbMATH DE number 24411
• Sufficient optimality conditions in nondifferentiable optimization^∗
• scientific article; zbMATH DE number 169212
• A sufficient and necessary condition for nonconvex constrained optimization
• scientific article; zbMATH DE number 1805987
• Optimality conditions for a nonconvex set-valued optimization problem

Cited in

(22)

• scientific article; zbMATH DE number 1805987 (Why is no real title available?)
• Duality and existence theory for nondifferentiable programming
• Optimality conditions for a class of nondifferentiable minmax programming problems
• scientific article; zbMATH DE number 682553 (Why is no real title available?)
• Higher order duality in multiobjective fractional programming with square root term under generalized higher order \((F, \alpha, \beta, \rho, \sigma, d)\)-V-type I univex functions
• scientific article; zbMATH DE number 3932824 (Why is no real title available?)
• Generalized convexity in nondifferentiable programming
• Duality for a Class of Nondifferentiable Multiple Objective Programming Problems
• Higher-Order Duality in Nondifferentiable Multiobjective Programming
• scientific article; zbMATH DE number 4062008 (Why is no real title available?)
• Convex composite non-Lipschitz programming
• Characterizing the contingent cone's convex kernel
• Generalized concavity and duality with a square root term
• Second-Order Duality for Nondifferentiable Multiobjective Programming Problems
• Optimality conditions of \(E\)-convex programming for an \(E\)-differentiable function
• Second order duality for nondifferentiable multiobjective programming problem involving \((F, \alpha , \rho , d)-V\)-type I functions
• Duality for a non-differentiable programming problem
• Necessary and sufficient conditions for regularity of constraints in convex programming
• A necessary optimality condition for nondifferentiable constrained extremum problems
• An existence theorem for a nonlinear nondifferentiable programming problem
• scientific article; zbMATH DE number 3887448 (Why is no real title available?)
• Properties of regular mathematical programming problems

This page was built for publication: An optimality condition for a nondifferentiable convex program

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