A duality theorem for nondifferentiable convex programming with operatorial constraints

DOI10.1017/S0004972700006419zbMath0428.90058MaRDI QIDQ3865855

Sundaram M. A. Sastry, P. Kanniappan

Publication date: 1980

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

duality theoremsubgradientsnondifferentiable convex programminglocally convex topological linear spaceoperatorial constraintsregularly subdifferential constraint

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48) General theory of locally convex spaces (46A03)

Related Items (1)

Optimality for set functions with values in ordered vector spaces

Cites Work

• A subgradient duality theorem
• Extension of Fenchel's duality theorem for convex functions
• A programming problem with an L_p norm in the objective function
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development

This page was built for publication: A duality theorem for nondifferentiable convex programming with operatorial constraints