Skip to main content
Log in

On the relations between different duals assigned to composed optimization problems

  • Original Article
  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

For an optimization problem with a composed objective function and composed constraint functions we determine, by means of the conjugacy approach based on the perturbation theory, some dual problems to it. The relations between the optimal objective values of these duals are studied. Moreover, sufficient conditions are given in order to achieve equality between the optimal objective values of the duals and strong duality between the primal and the dual problems, respectively. Finally, some special cases of this problem are presented.

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

  • Bauer FL, Stoer J, Witzgall C (1961) Absolute and monotonic norms. Numer Math 3:257–264

    Article  MATH  Google Scholar 

  • Boţ RI, Wanka G (2003) Duality for composed convex functions with applications in location theory. In: Habenicht W, Scheubrein B, Scheubrein R (eds) Multi-Criteria-und Fuzzy-Systeme in Theorie und Praxis. Deutscher Universitäts-Verlag, Wiesbaden, pp 1–18

    Google Scholar 

  • Burke JV, Poliquin RA (1992) Optimality conditions for non-finite valued convex composite functions. Math Program 57:103–120

    Article  Google Scholar 

  • Combari C, Laghdir M, Thibault L (1994) Sous-différentiels de fonctions convexes composées. Ann Sci Math Que 18(2):119–148

    MATH  Google Scholar 

  • Ekeland I, Temam R (1976) Convex analysis and variational problems. North-Holland, Amsterdam

    MATH  Google Scholar 

  • Goh CJ, Yang XQ (2002) Duality in optimization and variational inequalities. Taylor and Francis Inc, New York

    MATH  Google Scholar 

  • Jeyakumar V (1991) Composite nonsmooth programming with Gâteaux differentiability. SIAM J Optim 1:30–41

    Article  MATH  Google Scholar 

  • Jeyakumar V, Yang XQ (1993) Convex composite multi-objective nonsmooth programming. Math Program 59:325–343

    Article  Google Scholar 

  • Jeyakumar V, Yang XQ (1995) Convex composite minimization with C 1,1 functions. J Optim Theory Appl 86:631–648

    Article  MATH  Google Scholar 

  • Kutateladze SS (1977) Changes of variables in the Young transformation. Sov Math Dokl 18(2):545–548

    MATH  Google Scholar 

  • Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton

    MATH  Google Scholar 

  • Wanka G, Boţ RI (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, Berlin, pp 255–262

    Google Scholar 

  • Wanka G, Boţ RI, Vargyas E (2007) Duality for location problems with unbounded unit balls. Eur J Oper Res 179(3):1252–1265

    Article  MATH  Google Scholar 

  • Yang XQ (1998) Second-order global optimality conditions for convex composite optimization. Math Program 81:327–347

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gert Wanka.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wanka, G., Boţ, R.I. & Vargyas, E. On the relations between different duals assigned to composed optimization problems. Math Meth Oper Res 66, 47–68 (2007). https://doi.org/10.1007/s00186-007-0169-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00186-007-0169-6

Keywords

Mathematics Subject Classification (2000)

Navigation