Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T16:03:54.409Z Has data issue: false hasContentIssue false

Duality theorems for convex programming without constraint qualification

Published online by Cambridge University Press:  09 April 2009

P. Kanniappan
Affiliation:
School of Mathematics Madurai Kamaraj UniversityMadurai-625 021 Tamil Nadu, IndiaDepartment of Mathematics Gandhigram Rural InstituteGandhigram-624 302 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.

Invoking a recent characterization of Optimality for a convex programming problem with finite dimensional range without any constraint qualification given by Borwein and Wolkowicz, we establish duality theorems. These duality theorems subsume numerous earlier duality results with constraint qualifications. We apply our duality theorems in the case of the objective function being the sum of a positively homogeneous, lower-semi-continuous, convex function and a subdifferentiable convex function. We also study specific problems of the above type in this setting.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1984