Skip to main content
Log in

Strong Duality for Generalized Convex Optimization Problems

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

In this paper, strong duality for nearly-convex optimization problems is established. Three kinds of conjugate dual problems are associated to the primal optimization problem: the Lagrange dual, Fenchel dual, and Fenchel-Lagrange dual problems. The main result shows that, under suitable conditions, the optimal objective values of these four problems coincide.

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

  1. Wanka G., Boţ R.I., On the Relations between Different Dual Problems in Convex Mathematical Programming, Operations Research Proceedings 2001, Edited by P. Chamoni, R. Leisten, A. Martin, J. Minnemann, and H. Stadtler, Springer Verlag, Heidelberg, Germany, pp. 255–262, 2002.

  2. J. W. Green W. Gustin (1950) ArticleTitleQuasiconvex Sets Canadian Journal of Mathematics 2 489–507

    Google Scholar 

  3. Gherman L.F. and Soltan V. Quasiconvexity in Linear and Metric Spaces, Investigations in Functional Analysis and Differential Equations, Ştiinţa, Chişinău, Moldavia, pp. 19–24, 1981 (in Russian).

  4. Muntean, I., Support Points of p-Convex Sets, Procedings of the Colloquium on Approximation and Optimization, Cluj, Romania, pp. 293–302, 1984.

  5. A. Aleman (1985) ArticleTitleOn Some Generalizations of Convex Sets and Convex Functions Mathematica - Revue d’Analyse Numérique et de la Théorie de l’Approximation 14 1–6

    Google Scholar 

  6. I. Ekeland R. Temam (1976) Convex Analysis and Variational Problems North-Holland Publishing Company Amsterdam, Netherlands

    Google Scholar 

  7. J. B. G. Frenk G. Kassay (1999) ArticleTitleOn Classes of Generalized Convex Functions, Gordan-Farkas Type Theorems, and Lagrangian Duality Journal of Optimization Theory and Applications 102 315–343 Occurrence Handle10.1023/A:1021780423989

    Article  Google Scholar 

  8. W. W. Breckner G. Kassay (1997) ArticleTitleA Systematization of Convexity Concepts for Sets and Functions Journal of Convex Analysis 4 1–19

    Google Scholar 

  9. Hamel G., A Basis of All Numbers and the Noncontinuous Solutions of the Functional Equation f(x+y)=f(x)+f(y), Mathematische Annalen, Vol. 60, pp. 459–462, 1905 (in German).

  10. Frenk, J. B. G., and Kassay, G., Lagrangian Duality and Cone Convexlike Functions, Journal of Optimization Theory and Applications (to appear).

  11. R. T. Rockafellar (1970) Convex Analysis Princeton University Press Princeton, New Jersey

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

The first author was supported in part by Gottlieb Daimler and Karl Benz Stiftung 02-48/99.

This research has been performed while the second author visited Chemnitz University of Technology under DAAD (Deutscher Akademischer Austauschdienst) Grant A/02/12866.

Communicated by T. Rapcsák

Rights and permissions

Reprints and permissions

About this article

Cite this article

Boţ, R.I., Kassay, G. & Wanka, G. Strong Duality for Generalized Convex Optimization Problems. J Optim Theory Appl 127, 45–70 (2005). https://doi.org/10.1007/s10957-005-6392-5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-005-6392-5

Keywords

Navigation