Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-19T01:46:24.630Z Has data issue: false hasContentIssue false

Duality in finite dimensional complex space

Published online by Cambridge University Press:  17 April 2009

C.H. Scott
Affiliation:
School of Mechanical and Industrial Engineering, University of New South Wales, Kensington, New South Wales
T.R. Jefferson
Affiliation:
School of Mechanical and Industrial Engineering, University of New South Wales, Kensington, New South Wales
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.

The idea of duality is now a widely accepted and useful idea in the analysis of optimization problems posed in real finite dimensional vector spaces. Although similar ideas have filtered over to the analysis of optimization problems in complex space, these have mainly been concerned with problems of the linear and quadratic programming variety. In this paper we present a general duality theory for convex mathematical programs in finite dimensional complex space, and, by means of an example, show that this formulation captures all previous results in the area.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1978