Journal of Computational and Applied Mathematics最新文献_第9页

Moreau-Yosida regularization to optimal control of the monodomain model with pointwise control and state constraints in cardiac electrophysiology 莫罗-尤西达正则化对心脏电生理学中带有点控和状态约束的单域模型的优化控制

IF 2.1 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2024-10-09 DOI: 10.1016/j.cam.2024.116306

Maria Robert , Suresh Kumar Nadupuri , Nagaiah Chamakuri

{"title":"Moreau-Yosida regularization to optimal control of the monodomain model with pointwise control and state constraints in cardiac electrophysiology","authors":"Maria Robert , Suresh Kumar Nadupuri , Nagaiah Chamakuri","doi":"10.1016/j.cam.2024.116306","DOIUrl":"10.1016/j.cam.2024.116306","url":null,"abstract":"<div><div>In this work, we study the optimal control problem of a coupled reaction-diffusion system, which is a monodomain model in cardiac electrophysiology with pointwise bilateral control and state constraints. We adopt the Moreau-Yosida regularization as a penalization technique to deal with the state constraints. The regularized problem’s first-order optimality condition is derived. In addition, sufficient second-order optimality condition is derived for the regularized problem using the virtual control concept by proving equivalence between Moreau-Yosida regularization and the virtual control concept. The convergence of optimal controls of the regularized problems to the optimal control of the original problem is proved. Moreover, the semi-smooth Newton method for numerically finding the optimal solution to the regularization problem is presented. Finally, numerical experiments are conducted, and the results allow us to understand the extinction of the wave excitation in cardiac defibrillation in the presence of both control and state constraints.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"457 ","pages":"Article 116306"},"PeriodicalIF":2.1,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142441064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Population-based algorithm for discrete facility location with ranking of candidate locations 基于群体的离散设施选址算法，对候选地点进行排序

IF 2.1 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2024-10-09 DOI: 10.1016/j.cam.2024.116304

Algirdas Lančinskas , Julius Žilinskas , Pascual Fernández , Blas Pelegrín

{"title":"Population-based algorithm for discrete facility location with ranking of candidate locations","authors":"Algirdas Lančinskas , Julius Žilinskas , Pascual Fernández , Blas Pelegrín","doi":"10.1016/j.cam.2024.116304","DOIUrl":"10.1016/j.cam.2024.116304","url":null,"abstract":"<div><div>Facility location problems are mathematical optimization problems that involve finding the best locations for facilities (e.g., factories, warehouses, stores) to serve customers within a given geographic area. The goal is typically to minimize costs, maximize efficiency, or optimize other objectives. Facility location problems can vary in several ways, including customer behavior rules, the type of search space, and constraints on locations for new facilities being located. These variations directly impact the complexity of the problem and the appropriate solution methods that can be used to tackle the problem. This research is focused on the discrete competitive facility location problem for an entering firm, which is a crucial scenario for new firms entering the existing market. The goal is to strategically locate new facilities to maximize their profit, while considering existing competitors. A new random search heuristic algorithm to approximate the optimal solution for discrete competitive facility location problems for firm expansion has been developed. The algorithm extends its precursor that ranks potential locations for the new facilities depending on their usefulness and uselessness in creating new solutions in the past. The new algorithm uses a population to handle and reuse the best solutions found so far and new strategies for ranking potential locations, considering features of the solutions in the population. The designed algorithm has been investigated by solving competitive facility location problems actual for an entering firms using real geographical data.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"457 ","pages":"Article 116304"},"PeriodicalIF":2.1,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142426745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A two-step relaxed-inertial derivative-free projection based algorithm for solving standard nonlinear pseudo-monotone equations and logistic regression problems 解决标准非线性伪单调方程和逻辑回归问题的基于两步放松惯性无导数投影算法

IF 2.1 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2024-10-09 DOI: 10.1016/j.cam.2024.116327

Wenli Liu , Jinbao Jian , Jianghua Yin

{"title":"A two-step relaxed-inertial derivative-free projection based algorithm for solving standard nonlinear pseudo-monotone equations and logistic regression problems","authors":"Wenli Liu , Jinbao Jian , Jianghua Yin","doi":"10.1016/j.cam.2024.116327","DOIUrl":"10.1016/j.cam.2024.116327","url":null,"abstract":"<div><div>This paper explores a two-step inertial derivative-free projection method with a relaxation factor <span><math><mrow><mi>γ</mi><mo>∈</mo><mrow><mo>(</mo><mn>0</mn><mo>,</mo><mn>2</mn><mo>)</mo></mrow></mrow></math></span> for solving nonlinear pseudo-monotone equations. Unlike existing inertial algorithms for the system of nonlinear pseudo-monotone equations, the inertial step of our method involves the current iteration point and the previous two iteration points. In particular, one of the inertial parameters is nonpositive. In the proposed algorithm, the search direction possesses not only the sufficient descent property but also the trust region property, independent of the line search technique. Moreover, we also establish the global convergence and the convergence rate of the algorithm without the Lipschitz continuity of the underlying mapping. Finally, our method provides competitive results on standard nonlinear monotone and pseudo-monotone equations and logistic regression problems compared with two inertial algorithms existing in the literature.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"457 ","pages":"Article 116327"},"PeriodicalIF":2.1,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142531791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Domain decomposition with local time discretization for the nonlinear Stokes–Biot system 非线性斯托克斯-比奥系统的域分解与局部时间离散化

IF 2.1 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2024-10-09 DOI: 10.1016/j.cam.2024.116311

Hemanta Kunwar , Hyesuk Lee

引用次数: 0

On the causality-preservation capabilities of generative modelling 论生成模型的因果关系保护能力

IF 2.1 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2024-10-09 DOI: 10.1016/j.cam.2024.116312

Yves-Cédric Bauwelinckx , Jan Dhaene , Milan van den Heuvel , Tim Verdonck

{"title":"On the causality-preservation capabilities of generative modelling","authors":"Yves-Cédric Bauwelinckx , Jan Dhaene , Milan van den Heuvel , Tim Verdonck","doi":"10.1016/j.cam.2024.116312","DOIUrl":"10.1016/j.cam.2024.116312","url":null,"abstract":"<div><div>Modelling is essential in both the financial and insurance industries. The emergence of machine learning and deep learning models offers new tools for this, but they often require large datasets that are typically unavailable in business fields due to privacy and ethical concerns. This lack of data is currently one of the main hurdles in developing better models. Generative modelling, such as Generative Adversarial Networks (GANs), can address this issue by creating synthetic data that can be freely shared. While GANs are widely studied in fields like computer vision, their use in business is limited, primarily because business questions often focus on identifying causal effects, whereas GANs and neural networks typically emphasise high-dimensional correlations. This paper explores whether GANs can produce synthetic data that reliably answers causal questions by performing causal analyses on GAN-generated data under varying assumptions. The study includes cross-sectional, time series, and complete structural model scenarios. Findings show that while basic GANs replicate causal relationships in simple cross-sectional data, they struggle with more complex structural models. In contrast, CausalGAN effectively replicates the original causal model, and TimeGAN modifies the causal representation in time series data.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"457 ","pages":"Article 116312"},"PeriodicalIF":2.1,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142445744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Self representation based methods for tensor completion problem 基于自我表示的张量补全问题方法

IF 2.1 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2024-10-07 DOI: 10.1016/j.cam.2024.116297

Faezeh Aghamohammadi, Fatemeh Shakeri

引用次数: 0

On semi-continuity and continuity of solution maps of parametric generalized multiobjective games in fuzzy environments 论模糊环境中参数广义多目标博弈解图的半连续性和连续性

IF 2.1 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2024-10-05 DOI: 10.1016/j.cam.2024.116303

Nguyen Van Hung

引用次数: 0

Numerical computational technique for solving Volterra integro-differential equations of the third kind using meshless collocation method 利用无网格配置法求解 Volterra 第三类积分微分方程的数值计算技术

IF 2.1 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2024-10-02 DOI: 10.1016/j.cam.2024.116294

E. Aourir , H. Laeli Dastjerdi

{"title":"Numerical computational technique for solving Volterra integro-differential equations of the third kind using meshless collocation method","authors":"E. Aourir , H. Laeli Dastjerdi","doi":"10.1016/j.cam.2024.116294","DOIUrl":"10.1016/j.cam.2024.116294","url":null,"abstract":"<div><div>The primary goal of this study is to give an approximate algorithm for solving Volterra integro-differential equations (VIDEs) of the third kind using meshless collocation techniques. The basic framework of the novel approach is based on a collocation scheme and radial basis functions (RBFs) created on scattered points. This technique requires no background approximation cells, and the algorithm is powerful, has greater stability, and does not require much computer memory. This approach represents the solution of VIDEs of the third kind by interpolating the RBFs based on the Gauss–Legendre quadrature formula. The problem is reduced to a system of algebraic equations that can be easily solved. A description of the technique for the proposed equations is provided. Furthermore, the error analysis of this scheme is examined. A few numerical experiments are presented to prove the reliability and precision of the suggested approach for solving VIDEs of the third kind. Certain problems were compared with analytical solutions, the moving least squares method, and other methods to prove the effectiveness and applicability of the approach described.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"457 ","pages":"Article 116294"},"PeriodicalIF":2.1,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142426742","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Relaxation RKN-type integrators that preserve two invariants for second-order (oscillatory) systems 为二阶（振荡）系统保留两个不变式的松弛 RKN 型积分器

IF 2.1 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2024-10-02 DOI: 10.1016/j.cam.2024.116300

Kai Liu , Bin Wang , Ting Fu

{"title":"Relaxation RKN-type integrators that preserve two invariants for second-order (oscillatory) systems","authors":"Kai Liu , Bin Wang , Ting Fu","doi":"10.1016/j.cam.2024.116300","DOIUrl":"10.1016/j.cam.2024.116300","url":null,"abstract":"<div><div>Recently, the relaxation technique has been widely used to impose conservation of invariants while retaining the full accuracy of the original method. So far, only a single invariant of a system has been considered. In this work, by a mild generalization of the relaxation technique, the Runge–Kutta–Nyström (RKN) integrators are modified to preserve two invariants for second-order system of Ordinary Differential Equations (ODEs). The proposed integrators can be explicit and of arbitrarily high order. The accuracy of the relaxation RKN integrators and the existence of valid relaxation parameters have been proved. The construction of the new integrators is under the framework of adapted RKN (ARKN) integrators which are specially designed for numerical solving second-order oscillatory systems. Therefore, the proposed integrators could be oscillation-preserving in the sense that they exactly integrate homogeneous oscillatory system <span><math><mrow><msup><mrow><mi>q</mi></mrow><mrow><mo>′</mo><mo>′</mo></mrow></msup><mo>+</mo><mi>K</mi><mi>q</mi><mo>=</mo><mn>0</mn></mrow></math></span>. Some numerical experiments are conducted to show the advantage and efficiency of the proposed integrators in comparison with the standard (A)RKN integrators.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"457 ","pages":"Article 116300"},"PeriodicalIF":2.1,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142426744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Convergence analysis of a primal–dual optimization-by-continuation algorithm 基元-二元逐次优化算法的收敛性分析

IF 2.1 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2024-10-01 DOI: 10.1016/j.cam.2024.116299

Ignace Loris , Simone Rebegoldi

引用次数: 0