Abstract

A general approach is developed to solvability theorems involving a broad class of functions, here called H-convex functions and inf-H-convex functions. The concept of Minkowski duality is exploited to provide dual characterizations for certain infinite inequality systems. The results not only cover the recently developed solvability results involving DSL functions, concave functions and difference of sublinear and convex functions but also include a new dual characterization for systems with completely difference convex functions. Detailed examples are provided to illustrate the broad nature of the results. Applications to global optimization are also given.

Author information

Contact details are reproduced from the original publication and may be historical.

A. M. Rubinov

Department of Mathematics and Computing Sciences, Ben Gurion University of the Negev, Beer Sheva, Israel.

B. M. Glover

School of Information Technology and Mathematical Sciences, University of Ballarat, Ballarat, Victoria, Australia.

V. Jeyakumar

Department of Applied Mathematics, University of New South Wales, Sydney, NSW, Australia.

Keywords

  • Generalized conjugates
  • convex analysis
  • global optimization
  • Farkas’ lemma
  • solvability theorems
  • Minkowski duality

References

  1. T. M. Abasov: Normal sets and monotone functions and their applications, J. Comput. Mathematics and Mathematical Physics, 3(7), 1004–1011, 1993 (in Russian).Google Scholar
  2. T. M. Abasov and A. M. Rubinov: On a class of H -convex functions, Doklady RAN (Soviet Math. Doklady), 331(4), 391–392, 1993 (in Russian).Google Scholar
  3. T. M. Abasov and A. M. Rubinov: Subdifferentials of some classes of nonsmooth functions, in Nonsmooth Optimization, V. Dem’yanov (editor), 1995 (in Russian).Google Scholar
  4. E. J. Balder: An extension of duality-stability results to nonconvex optimization problems, SIAM Journal of Control and optimization, 15(2), 329–343, 1977.https://doi.org/10.1137/0315022Google Scholar
  5. G. Birkhoff: Lattice Theory, American Mathematical Society, Providence, R. I. 2nd Edition, 1948.Google Scholar
  6. J.-P. Crouzeix: About differentiability of order one of quasiconvex functions on IR n, Journal of Optimization Theory and Applications, 36(3), 367–385, 1982.https://doi.org/10.1007/BF00934352Google Scholar
  7. W. Fenchel: On conjugate convex functions, Canadian Journal of Mathematics, 1, 73–77, 1949.https://doi.org/10.4153/CJM-1949-007-xGoogle Scholar
  8. B. M. Glover: A generalized Farkas lemma with applications to quasidifferentiable programming, Zeitschrift für Operations Research, 26, 125–141, 1982.https://doi.org/10.1007/BF01917106Google Scholar
  9. B. M. Glover: On quasidifferentiable functions and nondifferentiable programming, Optimization, 24, 253–268, 1990.https://doi.org/10.1080/02331939208843794Google Scholar
  10. B. M. Glover, V. Jeyakumar, Y. Ishizuka and H. D. Tuan: Complete characterizations of global optimality of DC minimization problems, to appear SIAM Journal of Optimization, 1995.Google Scholar
  11. B. M. Glover, V. Jeyakumar and W. Oettli: A Farkas lemma for difference sublinear systems and quasidifferentiable programming, Mathematical Programming, Series A, 63, 109–125, 1994.https://doi.org/10.1007/BF01582061Google Scholar
  12. B. M. Glover, V. Jeyakumar and W. Oettli: Solvability theorems for classes of difference convex functions, Nonlinear Analysis, Theory, Methods and Applications, 22(10), 1191–1200, 1994.https://doi.org/10.1016/0362-546X(94)90104-XGoogle Scholar
  13. B. M. Glover, A. M. Rubinov and B. D. Craven: Solvability theorems involving inf-convex functions, Journal of Mathematical Analysis and Applications, 191, 305–330, 1995.https://doi.org/10.1006/jmaa.1995.1132Google Scholar
  14. J. Gwinner: Results of Farkas type, Numerical Functional Analysis and Optimization, 9, 471–520, 1987.https://doi.org/10.1080/01630568708816244Google Scholar
  15. Chung-wei Ha: On systems of convex inequalities, Journal of Mathematical Analysis and Applications, 68, 25–34, 1979.https://doi.org/10.1016/0022-247X(79)90098-2Google Scholar
  16. J.-P. Hiriart-Urruty: From convex to nonconvex minimization: Necessary and sufficient conditions for global optimality, in Nonsmooth Optimization and Related Topics, 219–240, Plenum, New York, 1989.https://doi.org/10.1007/978-1-4757-6019-4_13Google Scholar
  17. J.-B. Hiriart-Urruty and C. Lemarechal: Testing necessary and sufficient conditions for global optimality in the problem of maximizing a convex quadratic function over a convex polyhedron, Preliminary Report, University of Paul Sabatier, Toulouse, 1990.Google Scholar
  18. J.-B. Hiriart-Urruty and C. Lemarechal: Convex Analysis and Minimization Algorithms, Volumes I and II, Springer-Verlag, Berlin Heidelberg, 1993.https://doi.org/10.1007/978-3-662-02796-7Google Scholar
  19. R. Horst and H. Tuy: Global Optimization, Springer-Verlag, Berlin, 1990.https://doi.org/10.1007/978-3-662-02598-7Google Scholar
  20. Y. Ishizuka: Farkas’ theorem of nonconvex type and its application to a min-max problem, Journal of Optimization Theory and Applications, 57, 341–354, 1988.https://doi.org/10.1007/BF00938544Google Scholar
  21. Y. Ishizuka: Optimality conditions for quasidifferentiable programs with application to two-level optimization, SIAM Journal of Control and Optimization, 26(6), 1388–1398, 1988.https://doi.org/10.1137/0326079Google Scholar
  22. V. Jeyakumar and B. M. Glover: A new Farkas lemma and global convex maximization, Applied Mathematics Letters, 6(5), 39–43, 1993.https://doi.org/10.1016/0893-9659(93)90097-7Google Scholar
  23. V. Jeyakumar and B. M. Glover: Nonlinear extensions of Farkas’ lemma with applications to global optimization and least squares, to appear Mathematics of Operations Research, 1995.https://doi.org/10.1287/moor.20.4.818Google Scholar
  24. V. Jeyakumar and H. Wolkowicz: Generalizations of Slater’s constraint qualifications for infinite convex programming, Mathematical Programming, Series A, 57, 85–101, 1992.https://doi.org/10.1007/BF01581074Google Scholar
  25. S. S. Kutateladze and A. M. Rubinov: Minkowski duality and applications, Russian Mathematical Surveys, 27(3), 137–192, 1972.https://doi.org/10.1070/RM1972v027n03ABEH001380Google Scholar
  26. V. L. Makarov and A. M. Rubinov: Mathematical Theory of Economic Dynamics and Equilibria, Springer-Verlag, 1977.https://doi.org/10.1007/978-1-4612-9886-1Google Scholar
  27. J. E. Martinez-Legaz: Quasiconvex duality theory by generalized conjugation methods, Optimization, 19, 603–652, 1988.https://doi.org/10.1080/02331938808843379Google Scholar
  28. J. E. Martinez-Legaz: General conjugation and related topics, in Generalized Convexity and Fractional Programming with Economic Applications, Lecture Notes in Economics and Mathematical Systems, 345, 198–218, Springer-Verlag, Berlin, 1990.https://doi.org/10.1007/978-3-642-46709-7_13Google Scholar
  29. J. J. Moreau: Inf-convolution des fonctions numerique sur un espace vectorial, C. R. Acad. Sci. Paris, 256, 5047–5049, 1963.Google Scholar
  30. J.-P. Penot and M. Volle: On quasiconvex duality, Mathematics of Operations Research, 15(4), 597–625, 1990.https://doi.org/10.1287/moor.15.4.597Google Scholar
  31. R. T. Rockafellar: Convex Analysis, Priceton University Press, 1970.https://doi.org/10.1515/9781400873173Google Scholar
  32. R. T. Rockafellar: Conjugate Duality and Optimization, SIAM Regional Conference Series in Applied Mathematics, 1974.https://doi.org/10.1137/1.9781611970524Google Scholar
  33. S. Rolewicz: Convex analysis without linearity, Control and Cybernetics, 23, 247–256, 1994.Google Scholar
  34. S. Rolewicz and D. Pallaschke: Foundations of Optimization, to appear, 1994.Google Scholar
  35. A. M. Rubinov: Superlinear Multivalued Mappings and their Applications to Problems of Mathematical Economics, Leningrad, Nauka, 1980 (in Russian).Google Scholar
  36. A. M. Rubinov and B. Shimshek: Conjugate quasiconvex nonnegative functions, to appear, Optimization, 1995.https://doi.org/10.1080/02331939508844124Google Scholar
  37. A. P. Shveidel: Support sets of linear functionals and separation of star-shaped sets, unpublished manuscript, Karaganda State University, Kazakhstan, 1988.Google Scholar

Suggested citation

A. M. Rubinov, B. M. Glover, V. Jeyakumar. “A General Approach to Dual Characterizations of Solvability of Inequality Systems with Applications.” Journal of Convex Analysis 2 (1995), No. 1&2, 309–344. https://doi.org/10.68381/jca02021

Download BibTeXPublished by Heldermann Verlag.

Published by Heldermann Verlag, 1995. Rights now held by Banach Press.