Skip to main content
Log in

Partially finite convex programming, Part I: Quasi relative interiors and duality theory

  • Published:
Mathematical Programming Submit manuscript

Abstract

We study convex programs that involve the minimization of a convex function over a convex subset of a topological vector space, subject to a finite number of linear inequalities. We develop the notion of the quasi relative interior of a convex set, an extension of the relative interior in finite dimensions. We use this idea in a constraint qualification for a fundamental Fenchel duality result, and then deduce duality results for these problems despite the almost invariable failure of the standard Slater condition. Part II of this work studies applications to more concrete models, whose dual problems are often finite-dimensional and computationally tractable.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • A. Ben-Tal, J.M. Borwein and M. Teboulle, “A dual approach to multidimensionalL p spectral estimation problems,”SIAM Journal on Control and Optimization 26 (1988) 985–996.

    Google Scholar 

  • A. Ben-Tal, J.M. Borwein and M. Teboulle, “Spectral estimation via convex programming,” to appear in:Systems and Management Science by Extremal Methods: Research Honoring Abraham Charnes at Age 70 (Kluwer Academic Publishers, Dordrecht, 1992).

    Google Scholar 

  • J.M. Borwein, “Convex relations in analysis and optimization,” in: S. Schaible and W.T. Ziemba, eds.,Generalized Concavity in Optimization and Economics (Academic Press, New York, 1981) pp. 335–377.

    Google Scholar 

  • J.M. Borwein, “Continuity and differentiability properties of convex operators,”Proceedings of the London Mathematical Society 44 (1982) 420–444.

    Google Scholar 

  • J.M. Borwein, “Subgradients of convex operators,”Mathematische Operationsforschung und Statistik, Series Optimization 15 (1984) 179–191.

    Google Scholar 

  • J.M. Borwein and A.S. Lewis, “Practical conditions for Fenchel duality in infinite dimensions,” in: J.-B. Baillon and M.A. Théra, eds.,Fixed Point Theory and Applications (Longman, Harlow, UK, 1991) pp. 83–89.

    Google Scholar 

  • I. Ekeland and R. Temam,Convex Analysis and Variational Problems (North-Holland, Amsterdam, 1976).

    Google Scholar 

  • R.B. Holmes,Geometric Functional Analysis and Applications (Springer, New York, 1975).

    Google Scholar 

  • L.D. Irvine, S.P. Marin and P.W. Smith, “Constrained interpolation and smoothing,”Constructive Approximation 2 (1986) 129–151.

    Google Scholar 

  • G.J.O. Jameson,Topology and Normed Spaces (Chapman and Hall, London, 1974).

    Google Scholar 

  • K.O. Kortanek and M. Yamasaki, “Semi-infinite transportation problems,”Journal of Mathematical Analysis and Applications 88 (1982) 555–565.

    Google Scholar 

  • T.J. Lowe and A.P. Hurter Jr., “The generalized market area problem,”Management Science 22 (1976) 1105–1115.

    Google Scholar 

  • A.L. Peressini,Ordered Topological Vector Spaces (Harper and Row, New York, 1967).

    Google Scholar 

  • R.T. Rockafellar, “Duality and stability in extremum problems involving convex functions,”Pacific Journal of Mathematics 21 (1967) 167–187.

    Google Scholar 

  • R.T. Rockafeller,Convex Analysis (Princeton University Press, Princeton, NJ, 1970).

    Google Scholar 

  • H.H. Schaefer,Topological Vector Spaces (Springer, New York, 1971).

    Google Scholar 

  • H.H. Schaefer,Banach Lattices and Positive Operators (Springer, Berlin, 1974).

    Google Scholar 

  • Y.-C. Wong and K.-F. Ng,Partially Ordered Topological Vector Spaces (Clarendon Press, Oxford, 1973).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Borwein, J.M., Lewis, A.S. Partially finite convex programming, Part I: Quasi relative interiors and duality theory. Mathematical Programming 57, 15–48 (1992). https://doi.org/10.1007/BF01581072

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01581072

AMS 1985 Subject Classifications

Key words

Navigation