Skip to main content
Log in

Duality for Anticonvex Programs

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

Abstract

Calling anticonvex a program which is either a maximization of a convex function on a convex set or a minimization of a convex function on the set of points outside a convex subset, we introduce several dual problems related to each of these problems. We give conditions ensuring there is no duality gap. We show how solutions to the dual problems can serve to locate solutions of the primal problem.

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. Atteia, M. and Elqortobi, A. (1981), Quasi-convex duality, in A. Auslender et al. (eds.), Optimization and Optimal Control, Proc. Conference Oberwolfach March 1980, Lecture notes in Control and Inform. Sci. 30, 3–8, Springer-Verlag, Berlin.

    Google Scholar 

  2. Attouch, H. and Brézis, H. (1986), Duality for the sum of convex functions in general Banach spaces. in: J.A. Barroso (ed.), Aspects of Mathematics and its Applications, North Holland, Amsterdam 125–133.

    Google Scholar 

  3. Balder, E.J. (1977), An extension of duality-stability relations to non-convex optimization problems, SIAM J. Control Opt. 15: 329–343.

    Google Scholar 

  4. Burkard, R.E., Oettli, W. and Thach, P.T. (1991), Dual solutions methods for two discrete optimization problems in the space, preprint, Univ. of Graz, Austria.

    Google Scholar 

  5. Castaing, C. and Valadier, M. (1977), Convex analysis and measurable multifunctions, Lecture notes in Maths. 580, Springer Verlag.

  6. Crouzeix, J.-P. (1977), Contribution à l'étude des fonctions quasi-convexes, Thèse d'Etat, Univ. de Clermont II.

  7. Crouzeix, J.-P. (1983), Duality between direct and indirect utility functions, J. Math. Econ. 12: 149–165.

    Google Scholar 

  8. Diewert, W.E. (1982), Duality approaches to microeconomics theory, in: K.J. Arrow and M.D. Intriligator (eds), Handbook of Mathematical Economics, vol. 2, North Holland, Amsterdam, 535–599.

    Google Scholar 

  9. Elqortobi, A. (1992), Inf-convolution quasi-convexe des fonctionnelles positives, Rech. Oper. 26: 301–311.

    Google Scholar 

  10. Elqortobi, A. (1993), Conjugaison quasi-convexe des fonctionnelles positives, Annales Sci. Math. Québec 17(2): 155–167.

    Google Scholar 

  11. Horst, R. and Tuy, H. (1990), Global optimization, Springer Verlag.

  12. Jouron, C. (1979), On some structural design problems, in: Analyse non convexe, Pau, 1979, Bulletin Soc. Math. France, Mémoire 60: 87–93.

    Google Scholar 

  13. Lemaire, B. (1995), Duality in reverse convex optimization, in: M. Sofonea and J.-N. Corvellec (eds.), Proceedings of the second Catalan Days on Applied Mathematics, Presses Universitaires de Perpignan, Perpignan, 173–182.

    Google Scholar 

  14. Lemaire, B. and Volle, M. (1998), Duality in DC programming, in: J.-P. Crouzeix, J.E. Martinez-Legaz and M. Volle (eds), Generalized convexity, generalized monotonicity: recent results, Kluwer, Dordrecht, 331–345.

    Google Scholar 

  15. Lemaire, B. and Volle, M. (1998), A general duality scheme for nonconvex minimization problems with a strict inequality constraint, J. Global Opt. 13(3): 317–327.

    Google Scholar 

  16. Martinez-Legaz, J.-E. (1998), On lower subdifferentiable functions, in: K.H. Hoffmann et al. (eds), Trends in Mathematical Optimization, Int. Series Numer. Math. 84, Birkhauser, Basel, 197–232.

    Google Scholar 

  17. Martinez-Legaz, J.-E. (1991), Duality between direct and indirect utility functions under minimal hypothesis, J. Math. Econ. 20: 199–209.

    Google Scholar 

  18. Martinez-Legaz, J.-E. and Santos, M.S. (1993), Duality between direct and indirect preferences, Econ. Theory 3: 335–351.

    Google Scholar 

  19. Moreau, J.-J. (1970), Inf-convolution, sous-additivité, convexité des fonctions numériques, J. Math. Pures et Appl. 49: 109–154.

    Google Scholar 

  20. Pallaschke D. and Rolewicz, S. (1998), Foundations of mathematical optimization. Convex analysis without linearity, Maths. and its appl., vol. 388, Kluwer, Dordrecht.

    Google Scholar 

  21. Penot J.-P. (1997), Duality for radiant and shady problems, Acta Math. Vietnamica 22(2): 541-566.

    Google Scholar 

  22. Penot, J.-P., What is quasiconvex analysis?, Optim. 47(1) (2000)

  23. Penot, J.-P. and Volle, M. (1987), Dualité de Fenchel et quasi-convexité, C.R. Acad. Sci. Paris Série I 304(13): 371–374.

    Google Scholar 

  24. Penot, J.-P. and Volle, M. (1990), On quasi-convex duality, Math. Oper. Research 15: 597–625.

    Google Scholar 

  25. Penot, J.-P. and Volle, M. (1988), Another duality scheme for quasiconvex problems, in: K.H. Hoffmann et al. (eds), Trends in Mathematical Optimization, Int. Series Numer. Math. 84, Birkhaüser, Basel, 259–275.

    Google Scholar 

  26. Phong, T.Q., Tao, P.D. and Hoai An, L.T. (1995), A method for solving D.C. programming problems. Application to fuel mixture nonconvex optimization problem, J. Global Opt. 6: 87–105.

    Google Scholar 

  27. Pini, R. and Singh, C. (1997), A survey of recent advances in generalized convexity with applications to duality theory and optimality conditions (1985-1995), Optimization, 39(4): 311–360.

    Google Scholar 

  28. Rubinov, A. (1995), Antihomogeneous conjugacy operators in convex analysis, J. Convex Anal. 2: 291–307.

    Google Scholar 

  29. Rubinov, A.M. and Glover, B.M. (1997), On generalized quasiconvex conjugation, Contemporary Math. 204: 199–216.

    Google Scholar 

  30. Rubinov, A.M. and Simsek, B. (1995a), Conjugate quasiconvex nonnegative functions, Optimization 35: 1–22.

    Google Scholar 

  31. Rubinov, A.M. and Simsek, B. (1995b), Dual problems of quasiconvex maximization, Bull. Aust. Math. Soc. 51: 139–144.

    Google Scholar 

  32. Singer, I. (1979a), Maximization of lower semi-continuous convex functionals on bounded subsets of locally convex spaces. I: Hyperplane theorems, Appl. Math. Opt. 5: 349–362.

    Google Scholar 

  33. Singer, I. (1979b), A Fenchel-Rockafellar type theorem for maximization, Bull. Austral. Math. Soc. 20: 193–198.

    Google Scholar 

  34. Singer, I. (1980), Maximization of lower semi-continuous convex functionals on bounded subsets of locally convex spaces. II: quasi-Lagrangian duality theorems, Result. Math. 3: 235–248.

    Google Scholar 

  35. Singer, I. (1986), Some relations between dualities, polarities, coupling functions and conjugations, J. Math. Anal. Appl. 115: 1–22.

    Google Scholar 

  36. Singer, I. (1997), Abstract convex analysis, Wiley, New York.

    Google Scholar 

  37. Tao, P.D. and El Bernoussi, S. (1988), Duality in D.C. (difference of convex functions). Optimization. Subgradient methods, Trends in Mathematical Optimization, K.H. Hoffmann et al. eds, Int. Series Numer. Math. 84, Birkhauser, Basel, 277–293.

    Google Scholar 

  38. Tao, P.D. and El Bernoussi, S. (1989), Numerical methods for solving a class of global nonconvex optimization problems, in: J.-P. Penot (ed.), New methods in optimization and their industrial uses, Int. Series Numer. Math. 97 Birkhaüser, Basel, 97–132.

    Google Scholar 

  39. Tao, P.D. and Hoai An, Le Thi (1997), Lagrangian stability and global optimality in nonconvex quadratic minimization over Euclidean balls and spheres. Solution by D.C. optimization algorithms, preprint, Univ. Rouen.

  40. Thach, P.T. (1991), Quasiconjugate of functions, duality relationships between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint and application, J. Math. Anal. Appl. 159: 299–322.

    Google Scholar 

  41. Thach, P.T. (1993), Global optimality criterion and a duality with a zero gap in nonconvex optimization, SIAM J. Math. Anal. 24(6): 1537–1556.

    Google Scholar 

  42. Thach, P.T. (1994), A nonconvex duality with zero gap and applications, SIAM J. Optim. 4(1): 44–64.

    Google Scholar 

  43. Thach, P.T., Burkard, R.E. and Oettli, W. (1991), Mathematical programs with a twodimensional reverse convex constraint, J. Global Opt. 1: 145–154.

    Google Scholar 

  44. Traoré, S. and Volle, M. (1996), On the level sum of two convex functions on Banach spaces, J. of Convex Anal. 3(1): 141–151.

    Google Scholar 

  45. Tuy, H. (1987), Convex programs with an additional reverse convex constraint, J. Optim. Theory Appl. 52: 463–486.

    Google Scholar 

  46. Tuy, H. (1991), Polyhedral annexation, dualization and dimension reduction technique in global optimization, J. Global Opt. 1: 229–244.

    Google Scholar 

  47. Tuy, H., (1992a), The complementary convex structure in global optimization, J. Global Opt. 2 21–40

    Google Scholar 

  48. Tuy, H. (1995), D.C. optimization: theory, methods and algorithms, in: R. Horst and P.M. Pardalos, (eds), Handbook of Global Optimization, Kluwer, Dordrecht, Netherlands 149–216.

  49. Tuy, H. (1992b), On nonconvex optimization problems with separated nonconvex variables, J. Global Optim. 2: 133–144.

    Google Scholar 

  50. Tuy, H. (1998), Convex Analysis and Global Optimization, Kluwer, Dordrecht, Netherlands.

    Google Scholar 

  51. Volle, M. (1984), Convergence en niveaux et en é pigraphes, C.R. Acad. Sci. Paris 299(8): 295–298.

    Google Scholar 

  52. Volle, M. (1985), Conjugaison par tranches, Annali Mat. Pura Appl. 139: 279–312.

    Google Scholar 

  53. Volle, M. (1987), Conjugaison par tranches et dualité de Toland, Optimization 18: 633–642.

    Google Scholar 

  54. Volle, M. (1997), Quasiconvex duality for the max of two functions, in: Grizmann, R. Horst, E. Sachs and R. Tichatschke (eds), Recent advances in optimization P. Lecture Notes in Econ. and Math. Systems 452, Springer Verlag, Berlin 365–379.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Penot, JP. Duality for Anticonvex Programs. Journal of Global Optimization 19, 163–182 (2001). https://doi.org/10.1023/A:1008327614099

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008327614099

Navigation