{"title":"Exact controllability for a degenerate and singular wave equation with moving boundary","authors":"Alhabib Moumni, J. Salhi","doi":"10.3934/naco.2022001","DOIUrl":"https://doi.org/10.3934/naco.2022001","url":null,"abstract":"This paper is concerned with the exact boundary controllability for a degenerate and singular wave equation in a bounded interval with a moving endpoint. By the multiplier method and using an adapted Hardy-poincaré inequality, we prove direct and inverse inequalities for the solutions of the associated adjoint equation. As a consequence, by the Hilbert Uniqueness Method, we deduce the controllability result of the considered system when the control acts on the moving boundary. Furthermore, improved estimates of the speed of the moving endpoint and the controllability time are obtained.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"28 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82617832","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":"Double stranded smoothing technique in energy minimization problems","authors":"A. Sahiner, Nurullah Yilmaz","doi":"10.3934/naco.2022022","DOIUrl":"https://doi.org/10.3934/naco.2022022","url":null,"abstract":"In this study, we propose a new algorithm for image denoising by using double stranded Bezier curves based smoothing technique. The algorithm is developed to solve energy minimization problems with non-smooth total variation norm (TV). In order to demonstrate the efficiency of the algorithm we apply it to some numerical examples. The experimental results are reported and they are compared with the results obtained from TV algorithm with hyperbolic smoothing and standard TV algorithm.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"60 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83769081","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":"Axiomatic results and dynamic processes for two weighted indexes under fuzzy transferable-utility behavior","authors":"Y. Liao","doi":"10.3934/naco.2021047","DOIUrl":"https://doi.org/10.3934/naco.2021047","url":null,"abstract":"By considering the supreme-utilities and the weights simultaneously under fuzzy behavior, we propose two indexes on fuzzy transferable-utility games. In order to present the rationality for these two indexes, we define extended reductions to offer several axiomatic results and dynamics processes. Based on different consideration, we also adopt excess functions to propose alternative formulations and related dynamic processes for these two indexes respectively.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"3 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86893948","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":"A crowdsourced dynamic repositioning strategy for public bike sharing systems","authors":"I-Lin Wang, Chen-Tai Hou","doi":"10.3934/naco.2021049","DOIUrl":"https://doi.org/10.3934/naco.2021049","url":null,"abstract":"Public bike sharing systems have become the most popular shared economy application in transportation. The convenience of this system depends on the availability of bikes and empty racks. One of the major challenges in operating a bike sharing system is the repositioning of bikes between rental sites to maintain sufficient bike inventory in each station at all times. Most systems hire trucks to conduct dynamic repositioning of bikes among rental sites. We have analyzed a commonly used repositioning scheme and have demonstrated its ineffectiveness. To realize a higher quality of service, we proposed a crowdsourced dynamic repositioning strategy: first, we analyzed the historical rental data via the random forest algorithm and identified important factors for demand forecasting. Second, considering 30-minute periods, we calculated the optimal bike inventory via integer programming for each rental site in each time period with a sufficient crowd for repositioning bikes. Then, we proposed a minimum cost network flow model in a time-space network for calculating the optimal voluntary rider flows for each period based on the current bike inventory, which is adjusted according to the forecasted demands. The results of computational experiments on real-world data demonstrate that our crowdsourced repositioning strategy may reduce unmet rental demands by more than 30% during rush hours compared to conventional trucks.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"21 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86290935","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":"Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators","authors":"J. Kerdkaew, R. Wangkeeree, R. Wangkeeree","doi":"10.3934/naco.2021053","DOIUrl":"https://doi.org/10.3934/naco.2021053","url":null,"abstract":"In this paper, a robust optimization problem, which features a maximum function of continuously differentiable functions as its objective function, is investigated. Some new conditions for a robust KKT point, which is a robust feasible solution that satisfies the robust KKT condition, to be a global robust optimal solution of the uncertain optimization problem, which may have many local robust optimal solutions that are not global, are established. The obtained conditions make use of underestimators, which were first introduced by Jayakumar and Srisatkunarajah [1,2] of the Lagrangian associated with the problem at the robust KKT point. Furthermore, we also investigate the Wolfe type robust duality between the smooth uncertain optimization problem and its uncertain dual problem by proving the sufficient conditions for a weak duality and a strong duality between the deterministic robust counterpart of the primal model and the optimistic counterpart of its dual problem. The results on robust duality theorems are established in terms of underestimators. Additionally, to illustrate or support this study, some examples are presented.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"113 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80628792","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":"Static Markowitz mean-variance portfolio selection model with long-term bonds","authors":"Dennis Ikpe, Romeo Mawonike, F. Viens","doi":"10.3934/naco.2022030","DOIUrl":"https://doi.org/10.3934/naco.2022030","url":null,"abstract":"","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"6 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83688274","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":"Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term","authors":"Ayache Benhadid, F. Merahi","doi":"10.3934/naco.2022003","DOIUrl":"https://doi.org/10.3934/naco.2022003","url":null,"abstract":"<p style='text-indent:20px;'>Kernel functions play an important role in the complexity analysis of the interior point methods (IPMs) for linear optimization (LO). In this paper, an interior-point algorithm for LO based on a new parametric kernel function is proposed. By means of some simple analysis tools, we prove that the primal-dual interior-point algorithm for solving LO problems meets <inline-formula><tex-math id=\"M1\">begin{document}$ Oleft(sqrt{n} log(n) log(frac{n}{varepsilon}) right) $end{document}</tex-math></inline-formula>, iteration complexity bound for large-update methods with the special choice of its parameters.</p>","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"54 3 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90222697","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":"Stochastic DDM with regime–switching process","authors":"Battulga Gankhuu","doi":"10.3934/naco.2022031","DOIUrl":"https://doi.org/10.3934/naco.2022031","url":null,"abstract":"","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"30 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81429025","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":"A modified version of a Benson-type algorithm proposed for obtaining solutions with better dispersion on the non-dominated set of a non-convex multi-objective programming problem","authors":"A. H. Dehmiry, Maryam Kargarfard","doi":"10.3934/naco.2022039","DOIUrl":"https://doi.org/10.3934/naco.2022039","url":null,"abstract":"","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"24 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89532444","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":"Optimality and duality for complex multi-objective programming","authors":"Tone-Yau Huang, Tamaki Tanaka","doi":"10.3934/naco.2021055","DOIUrl":"https://doi.org/10.3934/naco.2021055","url":null,"abstract":"We consider a complex multi-objective programming problem (CMP). In order to establish the optimality conditions of problem (CMP), we introduce several properties of optimal efficient solutions and scalarization techniques. Furthermore, a certain parametric dual model is discussed, and their duality theorems are proved.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"19 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86584962","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}