Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T19:14:07.120Z Has data issue: false hasContentIssue false

Saddle point and duality in the optimization theory of convex set functions

Published online by Cambridge University Press:  17 February 2009

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.

For a set function G on an atomless finite measure space (X, , m), we define the subgradient, conjugate set of and conjugate functional of G. It is proved that a minimization problem of set function G has an optimal solution if and only if the Lagrangian on × L1(X, , m)has a saddle point (Ω0, f0) such that

where f0 is an element of the conjugate set (for the definition, see the later context).

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1982