Skip to main content
SpringerLink
Log in

On Convex Generalized Systems

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

Abstract

In this paper, the set-convexity and mapping-convexity properties of the extended images of generalized systems are considered. By using these image properties and tools of topological linear spaces, separation schemes ensuring the impossibility of generalized systems are developed. Then, special problem classes are investigated.

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. Giannessi, F., and RapcsÁk, T., Images, Separation of Sets, and Extremum Problems, Recent Trends in Optimization Theory and Applications, World Scientific Series in Applicable Analysis, Singapore, Republic of Singapore, Vol. 5, pp. 79–106, 1995.

    Google Scholar 

  2. Castellani, M., Mastroeni, G., and Pappalardo, M., On Regularity for Generalized Systems and Applications, Nonlinear Optimization and Applications, Edited by G. Di Pillo and F. Giannessi, Plenum Publishing Corporation, New York, NY, pp. 13–26, 1996.

    Google Scholar 

  3. BRECKNER, W. W., and Kassay, G., A Systematization of Convexity Concepts for Sets and Functions, Journal of Convex Analysis, Vol. 4, pp. 109–127, 1997.

    Google Scholar 

  4. IllÉs, T., and Kassay, G., Farkas Type Theorems for Generalized Convexities, Pure Mathematics and Applications, Vol. 5, pp. 225–239, 1994.

    Google Scholar 

  5. Paeck, S., Convexlike and Concavelike Conditions in Alternative, Minimax, and Minimization Theorems, Journal of Optimization Theory and Applications, Vol. 74, pp. 317–332, 1992.

    Google Scholar 

  6. Yu, P. L., Cone Convexity, Cone Extreme Points, and Nondominated Solutions in Decision Problems with Multiobjectives, Journal of Optimization Theory and Applications, Vol. 14, pp. 319–377, 1974.

    Google Scholar 

  7. Aleman, A., On Some Generalizations of Convex Sets and Convex Functions, Mathematica-Revue d'Analyse Numérique et de Theórie de l'Approximation, Vol. 14, pp. 1–6, 1985.

  8. Gwinner, J., and Jeyakumar, V., Inequality Systems and Optimization, Journal of Mathematical Analysis and Applications, Vol. 159, pp. 51–71, 1991.

    Google Scholar 

  9. Yang, X. M., and Liu, S. Y., Three Kinds of Generalized Convexity, Journal of Optimization Theory and Applications, Vol. 86, pp. 501–513, 1995.

    Google Scholar 

  10. Blaga, L., and KolumbÁn, J., Optimization on Closely Convex Sets, Generalized Convexity, Edited by S. Komlósi, T. Rapcsák, and S. Schaible, Springer Verlag, Berlin, Germany, pp. 19–34, 1994.

    Google Scholar 

  11. Pellegrini, L., Coercivity and Image of Constrained Extremum Problems, Journal of Optimization Theory and Applications, Vol. 89, pp. 175–188, 1996.

    Google Scholar 

  12. MARTI, J. T., Konvexe Analysis, Birkhaüser Verlag, Basel, Switzerland, 1977.

    Google Scholar 

  13. Fan, K., Minimax Theorems, Proceedings of the National Academy of Sciences of the USA, Vol. 39, pp. 42–47, 1953.

    Google Scholar 

  14. Weir, T., and Jeyakumar, V., A Class of Nonconvex Functions and Mathematical Programming, Bulletin of the Australian Mathematical Society, Vol. 38, pp. 177–189, 1988.

    Google Scholar 

  15. Craven, B. D., and Jeyakumar, V., Alternative and Duality Theorems with Weakened Convexity, Utilitas Mathematica, Vol. 31, pp. 149–159, 1987.

    Google Scholar 

  16. Jeyakumar, V., Convexlike Alternative Theorems and Mathematical Programming, Optimization, Vol. 16, pp. 643–652, 1985.

    Google Scholar 

  17. KÖNIG, H., Ñber das von Neumannsche Minimax Theorem, Archiv de Mathematik, Vol. 19, pp. 482–487, 1968.

    Google Scholar 

  18. Tardella, F., On the Image of a Constrained Extremum Problem and Some Applications to the Existence of a Minimum, Journal of Optimization Theory and Applications, Vol. 60, pp. 93–104, 1989.

    Google Scholar 

  19. Borwein, J. M., and Jeyakumar, V., On Convexlike Lagrangian and Minimax Theorems, Research Report 24, University of Waterloo, Waterloo, Ontario, Canada, 1988.

    Google Scholar 

  20. RapcsÁk, T., Smooth Nonlinear Optimization in ∝n, Kluwer Academic Publishers, Dordrecht, Holland, 1997.

    Google Scholar 

  21. Tardella, F., Some Topological Properties in Optimization Theory, Journal of Optimization Theory and Applications, Vol. 60, pp. 105–116, 1989.

    Google Scholar 

  22. Giannessi, F., Theorems of the Alternative and Optimality Conditions, Journal of Optimization Theory and Applications, Vol. 42, pp. 331–365, 1984.

    Google Scholar 

  23. Krein, M. G., and Rutman, M. A., Linear Operators Leaving Invariant a Cone in a Banach Space, Uspekhi Mathematicheskikh Nauk, Vol. 3, pp. 3–95, 1956 (in Russian). English translation available in American Mathematical Society Translations, Vol. 10, pp. 199-325, 1956.

    Google Scholar 

  24. Berman, A., Cones, Matrices, and Mathematical Programming, Lecture Notes in Economics and Mathematical Systems, Springer Verlag, Berlin, Germany, Vol. 79, 1973.

    Google Scholar 

  25. Halmos, P. R., A Hilbert Space Problem Book, Van Nostrand, London, England, 1967.

    Google Scholar 

  26. Barvinok, A. I., Problems of Distance Geometry and Convex Properties of Quadratic Maps, Discrete and Computer Geometry, Vol. 13, pp. 189–202, 1995.

    Google Scholar 

  27. Hayashi, M., and Komiya, H., Perfect Duality for Convexlike Programs, Journal of Optimization Theory and Applications, Vol. 38, pp. 179–189, 1982.

    Google Scholar 

  28. Elster, K. H., and Nehse, R., Optimality Conditions for Some Nonconvex Problems, Springer Verlag, New York, NY, 1980.

    Google Scholar 

  29. Jeyakumar, V., and Wolkowicz, H., Zero Duality Gaps in Infinite-Dimensional Programming, Journal of Optimization Theory and Applications, Vol. 67, pp. 87–108, 1990.

    Google Scholar 

  30. Hanson, M. A., On Sufficiency of Kuhn-Tucker Conditions, Journal of Mathematical Analysis and Applications, Vol. 30, pp. 545–550, 1981.

    Google Scholar 

  31. Kaul, R. N., and Kaur, S., Optimality Criteria in Nonlinear Programming Involving Nonconvex Functions, Journal of Mathematical Analysis and Applications, Vol. 105, pp. 104–112, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica, Universitá di Pisa, Pisa, Italy

    G. Mastroeni (Researcher)

  2. Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, Hungary

    T. Rapcsák (Senior Researcher)

Authors
  1. G. Mastroeni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. Rapcsák
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mastroeni, G., Rapcsák, T. On Convex Generalized Systems. Journal of Optimization Theory and Applications 104, 605–627 (2000). https://doi.org/10.1023/A:1004641726264

Download citation

  • Issue Date:

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

Search

Navigation