Representation of convex sets
*Stefan M. StefanovCorresponding authorstefm@swu.bgDepartment of InformaticsNeofit Rilski South-West UniversityBlagoevgrad, 2700, BulgariaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 May 2025
- Published Online:
- 12 May 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIM-2401
- Pages:
- 1–9
Abstract
Keywords
Subject Classifications
References
[1] C. D. Aliprantis and K. C. Border, Infinite Dimensional Analysis: A Hitchhiker’s Guide, 3rd ed., Berlin-Heidelberg-New York: Springer (2006).
[2] V. G. Boltyanski, H. Martini, and P. Soltan, Excursions into Combinatorial Geometry, Berlin-Heidelberg-New York: Springer (1997).
[3] S. Boyd, L. Vandenberghe, Convex Optimization, Cambridge: Cambridge University Press (2004).
[4] C. J. Goh, X. Q. Yang, Duality in Optimization and Variational Inequalities, London-New York: Taylor & Francis (2002).
[5] B. Grünbaum, Convex Polytopes, 2nd ed., New York-Berlin-Heidelberg: Springer (2003).
[6] B. Iochum, Cônes autopolaires et algèbres de Jordan, Berlin-Heidelberg-New York-Tokio: Springer (1984).
[7] L. Narici and E. Beckenstein, Topological Vector Spaces, 2nd ed., Boca Raton: Chapman and Hall / CRC Press (2010).
[8] A. G. Ramm, P. N. Shivakumar, and A. V. Strauss (Eds.), Operator Theory and Its Applications, Providence: American Mathematical Society (2000).
[9] R. T. Rochafellar, Convex Analysis, Princeton: Princeton Unoversity Press (1970).
[10] H. H. Schaefer and M. P. Wolff, Topological Vector Spaces, 2nd ed., New York: Springer (1999).
[11] V. Soltan, “Support and separation properties of convex sets in finite dimension”, Extracta Mathematicae, vol. 36, no. 2, pp. 241-278 (2021).
[12] S. M. Stefanov, “Valid inequalities and cutting planes for some polytopes”, Mathematical Inequalities and Applications, vol. 1, no. 2, pp. 285-294 (1998).
[13] S. M. Stefanov, Convex Separable Programming, Dordrecht: Kluwer Academic Publishers (2000).
[14] S. M. Stefanov, Separable Programming: Theory and Methods, Dordrech–Boston–London: Kluwer Academic Publishers (2001).
[15] S. M. Stefanov, “Valid inequalities, cutting planes and integrality of the knapsack polytope”, Journal of Interdisciplinary Mathematics, vol. 14, no. 4, pp. 389-406 (2011).
[16] S. M. Stefanov, “On the solution of quadratic programming problem with a feasible region defined as a Minkowski sum of a compact set and finitely generated convex closed cone”, Journal of Information and Optimization Sciences, vol. 39, no. 6, pp. 1223-1230 (2018).
[17] S. M. Stefanov, Separable Optimization: Theory and Methods, Cham: Springer (2021).
[18] S. M. Stefanov, “Continuous linear knapsack problems revisited”, Journal of Information and Optimization Sciences, vol. 44, no. 5, pp. 909-922 (2023).
[19] S. M. Stefanov, “On the properties of cones and polar cones”, Journal of Interdisciplinary Mathematics, published online.
[20] S. M. Stefanov, “On the separation of sets”, Journal of Interdisciplinary Mathematics, published online.
[21] S. M. Stefanov, “Supporting hyperplanes and support of sets”, Journal of Interdisciplinary Mathematics, to appear.
[22] S. M. Stefanov, “On the extreme points of the sets”, Journal of Interdisciplinary Mathematics, published online.
