On the quasiconvex functions
*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 Aug 2025
- Published Online:
- 07 Apr 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIM-2447
- Pages:
- 1–6
Abstract
Keywords
Subject Classifications
References
[1] C. D. Aliprantis and K. C. Border, Infinite Dimensional Analysis: A Hitchhiker’s Guide, 3rd ed., Springer, Berlin-Heidelberg-New York (2006).
[2] V. G. Boltyanski, H. Martini, and P. Soltan, Excursions into Combinatorial Geometry, Springer, Berlin-Heidelberg-New York (1997).
[3] S. Boyd, and L. Vandenberghe, Convex Optimization, Cambridge University Press, Cambridge (2004).
[4] C. J. Goh, and X. Q. Yang, Duality in Optimization and Variational Inequalities, Taylor & Francis, London-New York (2002).
[5] B. Grünbaum, Convex Polytopes, 2nd ed., Springer, New York-Berlin-Heidelberg (2003).
[6] B. Iochum, Cônes autopolaires et algèbres de Jordan, Springer, Berlin-Heidelberg-New York-Tokio (1984).
[7] L. Narici and E. Beckenstein, Topological Vector Spaces, 2nd ed., Chapman and Hall / CRC Press, Boca Raton (2010).
[8] A. G. Ramm, P. N. Shivakumar, and A. V. Strauss (eds.), Operator Theory and Its Applications, American Mathematical Society, Providence (2000).
[9] R. T. Rochafellar, Convex Analysis, Princeton Unoversity Press, Princeton (1970).
[10] H. H. Schaefer and M. P. Wolff, Topological Vector Spaces, 2nd ed., Springer, New York (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, “Convex separable minimization subject to bounded variables”, Computational Optimization and Applications. An International Journal, vol. 18, no. 1, pp. 27-48 (2001).
[13] S. M. Stefanov, “Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in Rn”, Journal of Applied Mathematics, vol. 2004, no. 5, pp. 409-431 (2004).
[14] S. M. Stefanov, “Convex quadratic minimization subject to a linear constraint and box constraints”, Applied Mathematics Research Express AMRX, vol. 2004, no. 1, pp. 17-42 (2004).
[15] S. M. Stefanov, “An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality contraint”, Journal of Applied Mathematics and Decision Sciences, vol. 2006, 19 pages (2006) Article ID 89307.
[16] S. M. Stefanov, “Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear equality constraint and bounds on the variables”, Applied Mathematics Research eXpress, vol. 2006, no. 4, 24 pages (2006) Article ID 36581.
[17] S. M. Stefanov, “Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints”, Journal of Interdisciplinary Mathematics, vol. 12, no. 5, pp. 647-673 (2009).
[18] S. M. Stefanov, “Solution of some convex separable resource allocation and production planning problems with bounds on the variables”, Journal of Interdisciplinary Mathematics, vol. 13, no. 5, pp. 541-569 (2010).
[19] S. M. Stefanov, “Well-posedness and primal-dual analysis of some convex separable optimization problems”, Advances in Operations Research, vol. 2013, 10 pages (2013) Article ID 279030.
[20] S. M. Stefanov, “On the solution of multidimensional convex separable continuous knapsack problem with bounded variables”, European Journal of Operational Research, vol. 247, no. 2, pp. 366-369 (2015).
[21] S. M. Stefanov, Separable Programming: Theory and Methods, 4th rev. enld. ed., Springer Science+Business Media, B.V., Dordrecht, 2016.
[22] S. M. Stefanov, “Strictly convex separable optimization with linear equality constraints and bounded variables”, Journal of Statistics and Management Systems, vol. 21, no. 2, pp. 261-272 (2018).
[23] S. M. Stefanov, “Characterization of the optimal solution of the convex generalized nonlinear transportation problem”, Journal of Interdisciplinary Mathematics, vol. 22, no. 5, pp. 745-756 (2019).
[24] S. M. Stefanov, “Characterization of the optimal solution of the convex separable continuous knapsack problem and related problems”, Journal of Information and Optimization Sciences, vol. 42, no. 1, pp. 1-16 (2021).
[25] S. M. Stefanov, “On the numerical solution of separable stochastic inventory control problems”, Journal of Information and Optimization Sciences, vol. 42, no. 3, pp. 533-561 (2021).
[26] S. M. Stefanov, Separable Optimization: Theory and Methods, Springer Optimization and Its Applications, Vol. 177, Springer, Cham, 2021.
[27] S. M. Stefanov, “Separable programming: A dynamic programming approach”, In: Separable Optimization. Springer Optimization and Its Applications, Vol. 177, Springer, Cham, 2021, pp. 85-129.
[28] S. M. Stefanov, “Numerical solution of some systems of nonlinear algebraic equations”, Journal of Interdisciplinary Mathematics, vol. 24, no. 6, pp. 1545-1564 (2021).
[29] S. M. Stefanov, “Numerical solution of systems of nonlinear equations defined by convex functions”, Journal of Interdisciplinary Mathematics, vol. 25, no. 4, pp. 951-962 (2022).
[30] S. M. Stefanov, “On some properties of linear functionals”, Journal of Interdisciplinary Mathematics, vol. 25, no. 8, pp. 2491-2502 (2022).
[31] S. M. Stefanov, “On the solution of quadratic programming problems”, Journal of Information and Optimization Sciences, vol. 44, no. 2, pp. 243-253 (2023).
[32] S. M. Stefanov, “Continuous linear knapsack problems revisited”, Journal of Information and Optimization Sciences, vol. 44, no. 5, pp. 909-922 (2023).
[33] S. M. Stefanov, “Numerical solution of box constrained separable convex quadratic programming problems”, Journal of Information and Optimization Sciences, vol. 45, no. 1, pp. 57-71 (2024).
