Hanson's duality theorem in nonsmooth programming

DOI10.1080/02331939408843921zbMath0819.90098OpenAlexW2072238653MaRDI QIDQ3835639

Stefan Mititelu

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939408843921

zbMATH Keywords

subdifferentialsLipschitzian functionsreal Banach spaceKuhn-Tucker optimality conditionsWolfe dualitynonsmoth analysis

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items (3)

Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions ⋮ Optimality and duality for multiobjective fractional programming involving nonsmooth($si:F$esi:ρ)–convex functions ⋮ Ekeland Duality as a Paradigm

Cites Work

• Unnamed Item
• A subgradient duality theorem
• Invexity at a point: generalisations and classification
• A DUALITY THEOREM IN NON-LINEAR PROGRAMMING WITH NON-LINEAR CONSTRAINTS1
• Optimization and nonsmooth analysis
• A New Approach to Lagrange Multipliers

This page was built for publication: Hanson's duality theorem in nonsmooth programming