{"title":"Linear combinations of two Bernstein polynomials","authors":"G. Tachev","doi":"10.3934/mfc.2022061","DOIUrl":"https://doi.org/10.3934/mfc.2022061","url":null,"abstract":"","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80382684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Some new inequalities and numerical results of bivariate Bernstein-type operator including Bézier basis and its GBS operator","authors":"E. Özkan, Nesibe Nur Akpınar","doi":"10.3934/mfc.2022045","DOIUrl":"https://doi.org/10.3934/mfc.2022045","url":null,"abstract":"","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85207610","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Preface: Special issue on approximation by linear and nonlinear operators with applications. Part III","authors":"D. Costarelli","doi":"10.3934/mfc.2022052","DOIUrl":"https://doi.org/10.3934/mfc.2022052","url":null,"abstract":"","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73455250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hao-xin Cui, Ran Li, Yan Li, L. Zhang, Bingyang Li
{"title":"Attention-based destruction and construction learning for infrared object fine-grained categorization","authors":"Hao-xin Cui, Ran Li, Yan Li, L. Zhang, Bingyang Li","doi":"10.3934/mfc.2022046","DOIUrl":"https://doi.org/10.3934/mfc.2022046","url":null,"abstract":"","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83833631","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Asymptotic properties of Kantorovich-type Szász-Mirakjan operators of higher order","authors":"U. Abel, O. Agratini, M. Ivan","doi":"10.3934/mfc.2023003","DOIUrl":"https://doi.org/10.3934/mfc.2023003","url":null,"abstract":"","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81479595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the density of translation networks defined on the unit ball","authors":"Xiaojun Sun, B. Sheng, Lin Liu, X. Pan","doi":"10.3934/mfc.2023017","DOIUrl":"https://doi.org/10.3934/mfc.2023017","url":null,"abstract":"","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70220459","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Volterra-Fredholm-type integral inequalities for generalized conformable fractional integrals","authors":"Xiaoyue Han, R. Xu","doi":"10.3934/mfc.2023011","DOIUrl":"https://doi.org/10.3934/mfc.2023011","url":null,"abstract":"","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70220608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Horrigue, Hanan Almuashi, Aishah Abdullah Alnashry
{"title":"Existence results for some $ psi $-Hilfer iterative approximation","authors":"S. Horrigue, Hanan Almuashi, Aishah Abdullah Alnashry","doi":"10.3934/mfc.2023029","DOIUrl":"https://doi.org/10.3934/mfc.2023029","url":null,"abstract":"","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70221095","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We propose a distributionally robust portfolio optimization model with cardinality constraints under the satisfaction criterion. We aim to maximize the probability of achieving the target return of the proposed portfolio selection model while the number of assets the investors hold is limited. For practical significance, we cite a measure of shortfall-aware aspiration level to the portfolio optimization problem and convert it into a CVaR measure. In our model, we consider a worst-case and assume the distribution of returns of assets is ambiguous. We reformulate the CVaR-based measure equivalently to semi-definite programming for its tractability. A Benders' decomposition algorithm is designed to solve the proposed model efficiently. Numerical tests are utilized through actual market data to validate the proposed method. The results indicate that our algorithm can effectively solve the proposed model, and the sparse portfolio selection model under the satisfaction criterion achieves high robustness and perform better than classical models. Furthermore, we prove that taking the number of assets as the decision variable is a much more efficient method.
{"title":"Distributionally robust sparse portfolio optimization model under satisfaction criterion","authors":"Zhongyan Wang, Xiaodong Zhu, Shaojian Qu, M. Faisal Nadeem, Beibei Zhang","doi":"10.3934/mfc.2023043","DOIUrl":"https://doi.org/10.3934/mfc.2023043","url":null,"abstract":"We propose a distributionally robust portfolio optimization model with cardinality constraints under the satisfaction criterion. We aim to maximize the probability of achieving the target return of the proposed portfolio selection model while the number of assets the investors hold is limited. For practical significance, we cite a measure of shortfall-aware aspiration level to the portfolio optimization problem and convert it into a CVaR measure. In our model, we consider a worst-case and assume the distribution of returns of assets is ambiguous. We reformulate the CVaR-based measure equivalently to semi-definite programming for its tractability. A Benders' decomposition algorithm is designed to solve the proposed model efficiently. Numerical tests are utilized through actual market data to validate the proposed method. The results indicate that our algorithm can effectively solve the proposed model, and the sparse portfolio selection model under the satisfaction criterion achieves high robustness and perform better than classical models. Furthermore, we prove that taking the number of assets as the decision variable is a much more efficient method.","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135559408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
For real numbers begin{document}$ a,qgeq 0 $end{document} and a weight begin{document}$ varrho(x) = 1/(1+x)^q $end{document}, the author provides necessary and sufficient conditions for a function begin{document}$ fin C[0,infty) $end{document} in order to begin{document}$ sup_{xgeq 0}mid varrho(x)(B_n^a(f,x)-f(x))mid to 0 $end{document} as begin{document}$ nto infty $end{document}, where begin{document}$ B_n^a(f) $end{document} is the Mihesan operator. In particular, it is proved that Mihesan operators behave similar to the classical Baskakov operators.
For real numbers begin{document}$ a,qgeq 0 $end{document} and a weight begin{document}$ varrho(x) = 1/(1+x)^q $end{document}, the author provides necessary and sufficient conditions for a function begin{document}$ fin C[0,infty) $end{document} in order to begin{document}$ sup_{xgeq 0}mid varrho(x)(B_n^a(f,x)-f(x))mid to 0 $end{document} as begin{document}$ nto infty $end{document}, where begin{document}$ B_n^a(f) $end{document} is the Mihesan operator. In particular, it is proved that Mihesan operators behave similar to the classical Baskakov operators.
{"title":"Approximation of functions and Mihesan operators","authors":"J. Bustamante","doi":"10.3934/mfc.2022033","DOIUrl":"https://doi.org/10.3934/mfc.2022033","url":null,"abstract":"<p style='text-indent:20px;'>For real numbers <inline-formula><tex-math id=\"M1\">begin{document}$ a,qgeq 0 $end{document}</tex-math></inline-formula> and a weight <inline-formula><tex-math id=\"M2\">begin{document}$ varrho(x) = 1/(1+x)^q $end{document}</tex-math></inline-formula>, the author provides necessary and sufficient conditions for a function <inline-formula><tex-math id=\"M3\">begin{document}$ fin C[0,infty) $end{document}</tex-math></inline-formula> in order to <inline-formula><tex-math id=\"M4\">begin{document}$ sup_{xgeq 0}mid varrho(x)(B_n^a(f,x)-f(x))mid to 0 $end{document}</tex-math></inline-formula> as <inline-formula><tex-math id=\"M5\">begin{document}$ nto infty $end{document}</tex-math></inline-formula>, where <inline-formula><tex-math id=\"M6\">begin{document}$ B_n^a(f) $end{document}</tex-math></inline-formula> is the Mihesan operator. In particular, it is proved that Mihesan operators behave similar to the classical Baskakov operators.</p>","PeriodicalId":93334,"journal":{"name":"Mathematical foundations of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78014088","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：