Skip to main content
SpringerLink
Log in

Duality for almost convex optimization problems via the perturbation approach

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from the convex analysis are extended to the case of almost convex sets and functions. The duality for some classes of primal-dual problems is derived as a special case of the general approach. The sufficient regularity conditions we need for guaranteeing strong duality are proved to be similar to the ones in the convex case.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Beoni C.: : A generalization of Fenchel duality theory. J. Optim. Theor. Appl. 49(3), 375–387 (1986)

    Article  Google Scholar 

  2. Boţ, R.I., Kassay, G., Wanka, G.: Strong duality for generalized convex optimization problems. J. Optim. Theor. Appl. 127(1), 45–70 (2005)

    Article  Google Scholar 

  3. Boţ, R.I., Grad, S.M., Wanka, G.: Almost convex functions: conjugacy and duality. In: Konnov, I., Luc, D.T., Rubinov, A.(eds) Generalized Convexity and Related Topics, Lecture Notes in Economics 583, pp. 101–114. Springer-Verlag, Berlin Heidelberg (2007)

    Google Scholar 

  4. Boţ, R.I., Grad, S.M., Wanka, G.: Fenchel’s duality theorem for nearly convex functions. J. Optim. Theor. Appl. 132(3), 509–515 (2007)

    Article  Google Scholar 

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

    Google Scholar 

  6. Frenk, J.B.G., Kassay, G.: Lagrangian duality and cone convexlike functions. J. Optim. Theor. Appl. 134(2), 207–222 (2007)

    Article  Google Scholar 

  7. Frenk, J.B.G., Kassay, G.: On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangian duality. J. Optim. Theor. Appl. 102(2), 315–343 (1999)

    Article  Google Scholar 

  8. Frenk, J.B.G., Kassay, G.: Introduction to convex and quasiconvex analysis. In: Hadjisavvas, N., Komlósi, S., Schaible, S.(eds) Handbook of Generalized Convexity and Generalized Monotonicity, Nonconvex Optimization and and its Applications 76, pp. 3–87. Springer-Verlag, New York (2005)

    Google Scholar 

  9. Giannessi, F., Rapcsák, T.: Images, separation of sets and extremum problems. In: Agarwal, R.P.(eds) Recent Trends in Optimization Theory and Applications, World Scientific Series in Applicable Analysis 5, pp. 79–106. World Scientific, River Edge (1995)

    Google Scholar 

  10. John, R.: Uses of generalized convexity and generalized monotonicity in economics. In: Hadjisavvas, N., Komlósi, S., Schaible, S.(eds) Handbook of Generalized Convexity and Generalized Monotonicity, Nonconvex Optimization and and its Applications 76, pp. 619–666. Springer-Verlag, New York (2005)

    Google Scholar 

  11. Kanniappan, P.: Fenchel–Rockafellar type duality for a nonconvex nondifferential optimization problem. J. Math. Anal. Appl. 97(1), 266–276 (1983)

    Article  Google Scholar 

  12. Martinez-Legaz, J.E.: Generalized convex duality and its economic applications. In: Hadjisavvas, N., Komlósi, S., Schaible, S.(eds) Handbook of Generalized Convexity and Generalized Monotonicity, Nonconvex Optimization and and its Applications 76, pp. 237–292. Springer-Verlag, New York (2005)

    Google Scholar 

  13. Mastroeni, G., Rapcsák, T.: On convex generalized systems. J. Optim. Theor. Appl. 104(3), 605–627 (2000)

    Article  Google Scholar 

  14. Penot, J.P., Volle, M.: On quasi-convex duality. Math. Oper. Res. 15(4), 597–625 (1987)

    Article  Google Scholar 

  15. Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)

    Google Scholar 

  16. Wanka, G., Boţ, R.I. (2002). On the relations between different dual problems in convex mathematical programming. In: Chamoni, P., Leisten, R., Martin, A., Minnemann, J., Stadtler, H. (eds.) Operations Research Proceedings 2001. Springer-Verlag, Heidelberg, pp. 255–262

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics, Chemnitz University of Technology, 09107, Chemnitz, Germany

    Radu Ioan Boţ & Gert Wanka

  2. Faculty of Mathematics and Computer Science, Babeş-Bolyai University, Str. M. Kogălniceanu 1, 400084, Cluj-Napoca, Romania

    Gábor Kassay

Authors
  1. Radu Ioan Boţ
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gábor Kassay
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gert Wanka
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gábor Kassay.

Additional information

The research of the first and third authors was partially supported by DFG (German Research Foundation), project WA 922/1. The research of the second author was supported by the grant PN II, ID 523/2007.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Boţ, R.I., Kassay, G. & Wanka, G. Duality for almost convex optimization problems via the perturbation approach. J Glob Optim 42, 385–399 (2008). https://doi.org/10.1007/s10898-008-9300-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-008-9300-3

Keywords

AMS Subject Classification (2000)

Search

Navigation