R. Nigmatullin, Vadim S. Alexandrov, P. Agarwal, Shilpi Jain, Necati Ozdemir
{"title":"Description of multi-periodic signals generated by complex systems: NOCFASS - New possibilities of the Fourier analysis","authors":"R. Nigmatullin, Vadim S. Alexandrov, P. Agarwal, Shilpi Jain, Necati Ozdemir","doi":"10.3934/naco.2022008","DOIUrl":"https://doi.org/10.3934/naco.2022008","url":null,"abstract":"Here, we show how to extend the possibilities of the conventional F-analysis and adapt it for quantitative description of multi-periodic signals recorded from different complex systems. The basic idea lies in filtration property of the Dirichlet function that allows finding the leading frequencies (having the predominant amplitudes) and the shortcut frequency band allows to fit the initial random signal with high accuracy (with the value of the relative error less than 5%). This modification defined as NOCFASS-approach (Non-Orthogonal Combined Fourier Analysis of the Smoothed Signals) can be applied to a wide class of different signals having multi-periodic structure. We want to underline here that the shortcut frequency dispersion has linear dependence begin{document}$ Omega_{k} = c.k+d $end{document} that differs from the conventional dispersion accepted in the conventional Fourier transformation begin{document}$ omega(k) = frac{2pi k}{T} $end{document}. (T is a period of the initial signal). With the help of integration procedure one can extract a low-frequency trend from trendless sequences that allows to applying the NOCFASS approach for calculation of the desired amplitude-frequency response (AFR) from different \"noisy\" random sequences. In order to underline the multi-periodic structure of random signals under analysis we consider two nontrivial examples. (a) The peculiarities of the AFR associated with Weierstrass-Mandelbrot function. (b) The random behavior of the voltammograms (VAGs) background measured for an electrochemical cell with one active electrode. We do suppose that the proposed NOCFASS-approach having new attractive properties as the simplicity of realization, agility to the problem formulated will find a wide propagation in the modern signal processing area.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"17 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90942890","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 survey of numerical solutions for stochastic control problems: Some recent progress","authors":"Zhu Jin, Mingxue Qiu, K. Tran, G. Yin","doi":"10.3934/naco.2022004","DOIUrl":"https://doi.org/10.3934/naco.2022004","url":null,"abstract":"This paper presents a survey on some of the recent progress on numerical solutions for controlled switching diffusions. We begin by recalling the basics of switching diffusions and controlled switching diffusions. We then present regular controls and singular controls. The main objective of this paper is to provide a survey on some recent advances on Markov chain approximation methods for solving stochastic control problems numerically. A number of applications in insurance, mathematical biology, epidemiology, and economics are presented. Several numerical examples are provided for demonstration.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"25 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73796242","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}
Xin He Miao, Kai Yao, Ching-Yu Yang, Jein-Shan Chen
{"title":"Levenberg-Marquardt method for absolute value equation associated with second-order cone","authors":"Xin He Miao, Kai Yao, Ching-Yu Yang, Jein-Shan Chen","doi":"10.3934/naco.2021050","DOIUrl":"https://doi.org/10.3934/naco.2021050","url":null,"abstract":"In this paper, we suggest the Levenberg-Marquardt method with Armijo line search for solving absolute value equations associated with the second-order cone (SOCAVE for short), which is a generalization of the standard absolute value equation frequently discussed in the literature during the past decade. We analyze the convergence of the proposed algorithm. For numerical reports, we not only show the efficiency of the proposed method, but also present numerical comparison with smoothing Newton method. It indicates that the proposed algorithm could also be a good choice for solving the SOCAVE.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"18 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76238240","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":"Weak convergence theorems for symmetric generalized hybrid mappings and equilibrium problems","authors":"Do Sang Kim, N. N. Hai, B. Dinh","doi":"10.3934/naco.2021051","DOIUrl":"https://doi.org/10.3934/naco.2021051","url":null,"abstract":"In this paper, we introduce three new iterative methods for finding a common point of the set of fixed points of a symmetric generalized hybrid mapping and the set of solutions of an equilibrium problem in a real Hilbert space. Each method can be considered as an combination of Ishikawa's process with the proximal point algorithm, the extragradient algorithm with or without linesearch. Under certain conditions on parameters, the iteration sequences generated by the proposed methods are proved to be weakly convergent to a solution of the problem. These results extend the previous results given in the literature. A numerical example is also provided to illustrate the proposed algorithms.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"14 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87910341","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}
D. Chalishajar, K. Ravikumar, K. Ramkumar, A. Anguraj
{"title":"Null controllability of Hilfer fractional stochastic differential equations with nonlocal conditions","authors":"D. Chalishajar, K. Ravikumar, K. Ramkumar, A. Anguraj","doi":"10.3934/naco.2022029","DOIUrl":"https://doi.org/10.3934/naco.2022029","url":null,"abstract":"This paper assesses a class of nonlocal Hilfer fractional stochastic differential equations (NHFSDEs) governed by fractional Brownian motion (fBm). New sufficient condition of exact null controllability for this stochastic setting has been investigated using fractional calculus, fixed point theory and a theory of resolvent operator. The derived result is new because it generalizes several of previously published results. However, the obtained results are proven by an illustration using stochastic partial differential equations to demonstrate the present application characteristic of null controllability. A filter example is demonstrated to make use of resolvent operator in a practical way.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"92 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80381863","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":"Optimal control problem governed by an infinite dimensional two-nilpotent bilinear systems","authors":"A. Aib, N. Bensalem","doi":"10.3934/naco.2022018","DOIUrl":"https://doi.org/10.3934/naco.2022018","url":null,"abstract":"<p style='text-indent:20px;'>The object of this work is to construct an explicit linear operators <inline-formula><tex-math id=\"M1\">begin{document}$ A $end{document}</tex-math></inline-formula> and <inline-formula><tex-math id=\"M2\">begin{document}$ B $end{document}</tex-math></inline-formula> which generate a nilpotent Lie algebra for the bracket <inline-formula><tex-math id=\"M3\">begin{document}$ left[A,Bright] = AB-BA $end{document}</tex-math></inline-formula> of degree 2 in infinite dimensional spaces. This construction can be applied to give an exact optimal solution for a class of infinite dimensional bilinear systems.</p>","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"50 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86117634","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 two-stage data envelopment analysis approach to solve extended transportation problem with non-homogenous costs","authors":"Aliyeh Hadi, S. Mehrabian","doi":"10.3934/naco.2022006","DOIUrl":"https://doi.org/10.3934/naco.2022006","url":null,"abstract":"The transportation problem is a particular type of linear programming problem in which the main objective is to minimize the cost. In marked contrast to the classical real-world transportation model, shipping supplies from one source to a destination cause several costs and benefits, each of which is incomparable to another. The extended transportation problem was first introduced in a study conducted by Amirteimoori [1]. In contrast, many important questions regarding the production possibility set, the place of costs, the benefits, and the essence of these costs were not fully addressed yet. Therefore, this paper focuses on transportation models that do not provide explicit output. This method is helpful because it is designed for a specific purpose: to send goods and supply-demand at the lowest cost and decision-maker; does not suffer from the confusion of costs and the various consequences of placing them costs and outputs. Furthermore, this model improves the contradiction between the essence of the problem and the input/output-oriented data envelopment analysis. In this paper, previous models that can not incorporate all the sources of inefficiency have been solved. We apply the slack-based measure(SBM) to calculate all identified inefficiency sources. A numerical example is considered to show the approach's applicability, as mentioned above, to actual life situations. As a result, the optimal costs achieved via the proposed method are more realistic and accurate by obtaining a more representative efficiency assessment. This example proved our proposed approach's efficiency, providing a more efficient solution by corporate all sources inefficiency and presenting efficient costs for each path.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"9 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73000036","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":"Drazin theta and theta Drazin matrices","authors":"Divya P. Shenoy","doi":"10.3934/naco.2022023","DOIUrl":"https://doi.org/10.3934/naco.2022023","url":null,"abstract":"<p style='text-indent:20px;'>In this paper, two new classes of matrices - Drazin - theta matrix and theta - Drazin matrix are introduced for a square matrix of index <inline-formula><tex-math id=\"M3\">begin{document}$ m $end{document}</tex-math></inline-formula>. Whenever the index is equal to one, we get special case of matrices called Group - theta matrix and theta - Group matrix respectively. Several characterizations of these matrices, the integral representations, representation in limit form and the representation in terms of rank factorization are obtained. Also, the relationship of Drazin -theta and theta - Drazin matrices with other well known generalized inverses are investigated. By applying the concept of Drazin - theta matrix, general solutions of certain types of matrix equations are characterized here.</p>","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":"79106442","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 level-set approach to the control of state-constrained McKean-Vlasov equations: application to renewable energy storage and portfolio selection","authors":"Maximilien Germain, H. Pham, X. Warin","doi":"10.3934/naco.2022033","DOIUrl":"https://doi.org/10.3934/naco.2022033","url":null,"abstract":"We consider the control of McKean-Vlasov dynamics (or mean-field control) with probabilistic state constraints. We rely on a level-set approach which provides a representation of the constrained problem in terms of an unconstrained one with exact penalization and running maximum or integral cost. The method is then extended to the common noise setting. Our work extends (Bokanowski, Picarelli, and Zidani, SIAM J. Control Optim. 54.5 (2016), pp. 2568--2593) and (Bokanowski, Picarelli, and Zidani, Appl. Math. Optim. 71 (2015), pp. 125--163) to a mean-field setting. The reformulation as an unconstrained problem is particularly suitable for the numerical resolution of the problem, that is achieved from an extension of a machine learning algorithm from (Carmona, Lauri{`e}re, arXiv:1908.01613 to appear in Ann. Appl. Prob., 2019). A first application concerns the storage of renewable electricity in the presence of mean-field price impact and another one focuses on a mean-variance portfolio selection problem with probabilistic constraints on the wealth. We also illustrate our approach for a direct numerical resolution of the primal Markowitz continuous-time problem without relying on duality.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"100 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2021-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81622617","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 fast convergence rates for generalized conditional gradient methods with backtracking stepsize","authors":"K. Kunisch, Daniel Walter","doi":"10.3934/naco.2022026","DOIUrl":"https://doi.org/10.3934/naco.2022026","url":null,"abstract":"A generalized conditional gradient method for minimizing the sum of two convex functions, one of them differentiable, is presented. This iterative method relies on two main ingredients: First, the minimization of a partially linearized objective functional to compute a descent direction and, second, a stepsize choice based on an Armijo-like condition to ensure sufficient descent in every iteration. We provide several convergence results. Under mild assumptions, the method generates sequences of iterates which converge, on subsequences, towards minimizers. Moreover, a sublinear rate of convergence for the objective functional values is derived. Second, we show that the method enjoys improved rates of convergence if the partially linearized problem fulfills certain growth estimates. Most notably these results do not require strong convexity of the objective functional. Numerical tests on a variety of challenging PDE-constrained optimization problems confirm the practical efficiency of the proposed algorithm.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":"15 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2021-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75554921","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}