An optimality condition for a nondifferentiable convex program

DOI10.1002/nav.3800300306zbMath0535.90072OpenAlexW1983736233MaRDI QIDQ3320133

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

conesubdifferentialKarush-Kuhn-Tucker conditionsdirectional derivativesbinding constraintsNecessary optimality conditionsnondifferentiable convex program

Mathematics Subject Classification ID

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

Related Items

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 ⋮ Necessary and sufficient conditions for regularity of constraints in convex programming ⋮ Duality for a non-differentiable programming problem ⋮ Duality for a Class of Nondifferentiable Multiple Objective Programming Problems ⋮ Second order duality for nondifferentiable multiobjective programming problem involving \((F, \alpha , \rho , d)-V\)-type I functions ⋮ Second-Order Duality for Nondifferentiable Multiobjective Programming Problems ⋮ Higher-Order Duality in Nondifferentiable Multiobjective Programming ⋮ Generalized concavity and duality with a square root term

Cites Work

• Unnamed Item
• Unnamed Item