No CrossRef data available.
Article contents
Characterizations of optimality for continuous convex mathematical programs. Part I. Linear constraints
Published online by Cambridge University Press: 17 February 2009
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.
Recently we have developed a completely symmetric duality theory for mathematical programming problems involving convex functionals. Here we set our theory within the framework of a Lagrangian formalism which is significantly different to the conventional Lagrangian. This allows various new characterizations of optimality.
Information
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1979
References
[1]Rockafellar, R. T., “Integrals which are convex functionals”, Pacific J. Math. 24 (1968), 525–539.CrossRefGoogle Scholar
[2]Rockafellar, R. T., “Convex integral functionals and duality”, in Contributions to nonlinear functional analysis (New York: Academic Press, 1971), pp. 215–236.CrossRefGoogle Scholar
[3]Rockafellar, R. T., “Conjugate duality and optimization”, SIAM Regional Conference Series in Applied Mathematics, 16 (1974).Google Scholar
[4]Scott, C. H. and Jefferson, T. R., “A generalization of geometric programming with an application to information theory”, Information Sciences 12 (1977), 263–269.CrossRefGoogle Scholar
[5]Scott, C. H. and Jefferson, T. R., “Duality in infinite-dimensional mathematical programming: Convex integral functionals”, J. Math. Anal. Appl. 61 (1977), 251–261.CrossRefGoogle Scholar
[6]Scott, C. H. and Jefferson, T. R., “Characterizations of optimality for continuous convex mathematical programs. Part 2. Nonlinear constraints” (in preparation).Google Scholar
You have
Access
- 1
- Cited by