Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-22T06:50:21.886Z Has data issue: false hasContentIssue false
  • English
  • Français

Duality in finite dimensional complex space

Published online by Cambridge University Press:  17 April 2009

C.H. Scott  and
T.R. Jefferson
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.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 18 , Issue 1 , February 1978 , pp. 65 - 75
Copyright
Copyright © Australian Mathematical Society 1978

References

[1]Abrams, Robert A., “Nonlinear programming in complex space: sufficient conditions and duality”, J. Math. Anal. Appl. 38 (1972), 619–632.CrossRefGoogle Scholar
[2]Abrams, Robert A. and Ben-Israel, Adi, “Nonlinear programming in complex space: necessary conditions”, SIAM J. Control 9 (1971), 606–620.CrossRefGoogle Scholar
[3]Ben-Israel, Adi, “Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory”, J. Math. Anal. Appl. 27 (1969), 367–389.CrossRefGoogle Scholar
[4]Fenchel, W., Convex cones, sets, and functions (Department of Mathematics Logistics Research Project, Princeton University, Princeton, New Jersey, 1953).Google Scholar
[5]Hanson, Morgan A. and Mond, Bertram, “Duality for nonlinear programming in complex space”, J. Math. Anal. Appl. 28 (1969), 52–58.CrossRefGoogle Scholar
[6]Jain, O.P. and Saxena, P.C., “A duality theorem for a special class of programming problems in complex space”, J. Optimization Theory Appl. 16 (1975), 207–220.CrossRefGoogle Scholar
[7]Levinson, Norman, “Linear programming in complex space”, J. Math. Anal. Appl. 14 (1966), 44–62.CrossRefGoogle Scholar
[8]Mond, Bertram, “Nonlinear nondifferentiable programming in complex space”, nonlinear programming, 385–400 (Proc. Sympos. Mathematics Research Center, University Wisconsin, Madison, 1970. Academic Press, New York, London, 1970).CrossRefGoogle Scholar
[9]Peterson, Elmor L., “Geometric programming”, SIAM Rev. 18 (1976), 1–51.CrossRefGoogle Scholar
[10]Rockafellar, R. Tyrrell, Convex analysis (Princeton University Press, Princeton, New Jersey, 1970).CrossRefGoogle Scholar
[11]Wolfe, Philip, “A duality theorem for non-linear programming”, Quart. Appl. Math. 19 (1961), 239–244.CrossRefGoogle Scholar