Hostname: page-component-5db6c4db9b-fdz9p Total loading time: 0 Render date: 2023-03-24T22:17:14.039Z Has data issue: true Feature Flags: { "useRatesEcommerce": false } hasContentIssue true

Facial reduction for a cone-convex programming problem

Published online by Cambridge University Press:  09 April 2009

Jon M. Borwein
Department of Mathematics, Dalhousie University, Halifax, Canada
Henry Wolkowicz
Department of Mathematics, University of Alberta, Edmonton, Canada
Rights & Permissions[Opens in a new window]


HTML view is not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper we study the abstract convex program

where S is an arbitrary convex cone in a finite dimensional space, Ω is a convex set and p and g are respectively convex and S (on Ω). We use the concept of a minimal cone for (P) to correct and strengthen a previous characterization of optimality for (P), see Theorem 3.2. The results presented here are used in a sequel to provide a Lagrange multiplier theorem for (P) which holds without any constraint qualification.

MSC classification

Research Article
Copyright © Australian Mathematical Society 1981


Abrams, R. A., and Kerzner, L. (1978), ‘A simplified test for optimality’, J. Optimization Theory Appl. 25, 161170.CrossRefGoogle Scholar
Barker, G. P. (1973), ‘The lattice of faces of a finite dimensional cone’, Linear Algebra and Appl. 7, 7182.CrossRefGoogle Scholar
Barker, G. and Carlson, D. (1975), ‘Cones of diagonally dominant matrices’, Pacific J. Math. 57, 1532.CrossRefGoogle Scholar
Ben-Israel, A., Ben-Tal, A. and Zlobec, S. (1976), ‘Optimality conditions in convex programming’, The IX International Symposium of Mathematical Programming (Budapest, Hungary, 08).Google Scholar
Ben-Tal, A. and Ben-Israel, A. (1979), ‘Characterization of optimality in convex programming: the nondifferentiable case’, Applicable Anal. 9, 137156.CrossRefGoogle Scholar
Berman, A. and Ben-Israel, A. (1969), ‘Linear equations over cones with interior: a solvability theorem with applications to matrix theory’, (Report No. 69–1, Series in Applied Math., Northwestern University).Google Scholar
Borwein, J. (1978), ‘Weak tangent cones and optimization in a Banach space’, SIAM J. Control Optimization 16, 512522.CrossRefGoogle Scholar
Borwein, J. (1980), ‘Continuity and differentiability of convex operators’, Proc. London Math. Soc., to appear.Google Scholar
Borwein, J. M. and Wolkowicz, H. (1979a), ‘Regularizing the abstract convex program’, J. Math. Anal. Appl., to appear.Google Scholar
Borwein, J. and Wolkowicz, H. (1979b), ‘Characterizations of optimality without constraint qualification for the abstract convex program’, (Research Report No. 14, Dalhousie University, Canada).Google Scholar
Borwein, J. M. and Wolkowicz, H. (1980), ‘Characterization of optimality for the abstract convex program with finite dimensional range space’, J. Austral. Math. Soc., to appear.Google Scholar
Craven, B. D. and Zlobec, S. (1980), ‘Complete characterization of optimality for convex programming in Banach spaces’, Applicable Anal. 11, 6178.CrossRefGoogle Scholar
Gould, F. J. and Tolle, J. W. (1972), ‘Geometry of optimality conditions and constraint qualifications’, Math. Programming 2, 118.CrossRefGoogle Scholar
Holmes, R. B. (1975), Geometric functional analysis and its applications (Springer-Verlag).CrossRefGoogle Scholar
Massam, H. (1979), ‘Optimality conditions for a cone-convex programming problem’, J. Austral. Math. Soc. Ser. A. 27, 141162.CrossRefGoogle Scholar
Peressini, A. L. (1967), Ordered topological vector spaces (Harper and Row).Google Scholar
Robertson, A. P. and Robertson, W. J. (1964), Topological vector spaces (Cambridge University Press).Google Scholar
Rockafellar, R. T. (1970), Convex analysis (Princeton University Press).CrossRefGoogle Scholar
Zowe, J. (1974), ‘Subdifferentiability of convex functions with values in an ordered vector space’, Math Scand. 34, 6983.CrossRefGoogle Scholar
Zowe, J. (1975), ‘Linear maps majorized by a sublinear map’, Arch. Math. (Basel), 26, 637645.CrossRefGoogle Scholar