Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-18T05:26:41.995Z Has data issue: false hasContentIssue false

Duality theorems and an optimality condition for non-differentiable convex programming

Published online by Cambridge University Press:  09 April 2009

P. Kanniappan
Affiliation:
School of Mathematics, Madurai Kamaraj University, Madurai-625 021, Tamil Nadu, India
Sundaram M. A. Sastry
Affiliation:
School of Mathematics, Madurai Kamaraj University, Madurai-625 021, Tamil Nadu, India
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Necessary and sufficient optimality conditions of Kuhn-Tucker type for a convex programming problem with subdifferentiable operator constraints have been obtained. A duality theorem of Wolfe's type has been derived. Assuming that the objective function is strictly convex, a converse duality theorem is obtained. The results are then applied to a programming problem in which the objective function is the sum of a positively homogeneous, lower-semi-continuous, convex function and a continuous convex function.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1982