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

Halpern-type splitting algorithm for approximating a common solution of monotone inclusion problems and equilibrium problems in reflexive Banach spaces 自反Banach空间中单调包含问题和平衡问题共解的halpern型分裂算法

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-28 DOI: 10.1016/j.cam.2026.117505

Qingqing Fu , Gang Cai , Zhongbing Xie , Qiao-Li Dong

引用次数: 0

Global optimization of a convex-concave fraction plus a convex function using hidden sawtooth-curve bounds via a two-layer dual approach 基于隐藏锯齿曲线边界的凹凸分数加凸函数的全局优化

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-22 DOI: 10.1016/j.cam.2026.117491

Longfei Wang , Yong Xia , Yunhai Xiao

{"title":"Global optimization of a convex-concave fraction plus a convex function using hidden sawtooth-curve bounds via a two-layer dual approach","authors":"Longfei Wang , Yong Xia , Yunhai Xiao","doi":"10.1016/j.cam.2026.117491","DOIUrl":"10.1016/j.cam.2026.117491","url":null,"abstract":"<div><div>We address a class of optimization problems, denoted by (SFC), of minimizing the sum of a convex-concave fraction and a convex function over a convex set. It is shown that problem (SFC) can be reformulated into an equivalent one-dimensional optimization problem, where each subproblem is evaluated by solving an associated convex programming. The optimal Lagrangian multipliers of the convex subproblems are utilized to construct sawtooth-curve and wave-curve lower bounds, which play a crucial role in devising the branch-and-bound algorithm for globally solving (SFC). In this paper, we propose a two-layer dual approach to get hidden sawtooth-curve lower bounds, which leads to a new efficient branch-and-bound algorithm for solving (SFC). Moreover, we improve the iterative complexity <span><math><mrow><mi>O</mi><mo>(</mo><mfrac><mn>1</mn><mi>ϵ</mi></mfrac><mo>)</mo></mrow></math></span> with wave-curve bounds to <span><math><mrow><mi>O</mi><mo>(</mo><mfrac><mn>1</mn><msqrt><mi>ϵ</mi></msqrt></mfrac><mo>)</mo></mrow></math></span> for finding an ϵ-approximate optimal solution. Numerical results demonstrate that it is more efficient than the recent branch-and-bound algorithm based on wave-curve bounds.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117491"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147386990","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 bargaining game approach for cost reallocation within an uncertain DEA model under chance constraints 机会约束下不确定DEA模型中成本再分配的议价博弈方法

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-21 DOI: 10.1016/j.cam.2026.117497

Hanjie Liu , Yuanguo Zhu , Liu He , Zihan Qin

{"title":"A bargaining game approach for cost reallocation within an uncertain DEA model under chance constraints","authors":"Hanjie Liu , Yuanguo Zhu , Liu He , Zihan Qin","doi":"10.1016/j.cam.2026.117497","DOIUrl":"10.1016/j.cam.2026.117497","url":null,"abstract":"<div><div>How to reallocate the cost reasonably among participants in the production process is a research topic that attracts much attention. In this paper, a new production possibility set is defined for the first time by using chance constraint under the premise that the inputs and outputs of decision-making units (DMUs) are regarded as uncertain variables. An uncertain data envelopment analysis (DEA) model is developed to evaluate the efficiency performance of DMUs, and the model is improved to enhance its ability to distinguish efficient DMUs. Given the competitive landscape among DMUs, a cost reallocation problem based on the efficiency of DMUs is studied. Initially, we construct an optimization model aimed at maximizing DMU’s efficiency, allowing each DMU to propose an initial efficiency evaluation proposal that maximizes its own interests, which is usually not satisfied by all DMUs. Consequently, we present an uncertain bargaining game model, through which the efficiency evaluation proposals of each DMU are continuously adjusted until a consensus is reached that satisfies all DMUs. Moreover, we also provide deterministic forms for all relevant models and verify their feasibility. Then, we design a bargaining game algorithm to determine the final efficiency evaluation proposal. We prove the convergence of this algorithm and demonstrate that the obtained efficiency evaluation proposal constitutes a Nash equilibrium solution. Finally, a classic numerical example is used to illustrate the effectiveness of the proposed method. Compared with the existing efficiency evaluation methods for dealing with data uncertainty and cost allocation methods, the proposed method shows significant superiority.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117497"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147386991","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

Exploration of M-polynomial and entropy measures of biswapped networks with connection number approaches 用连接数方法探讨双交换网络的m -多项式和熵测度

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-22 DOI: 10.1016/j.cam.2026.117500

Nasreen Almohanna , Ali Ahmad , Khawlah Alhulwah , Ali N.A. Koam , Hamdan Alshehri

{"title":"Exploration of M-polynomial and entropy measures of biswapped networks with connection number approaches","authors":"Nasreen Almohanna , Ali Ahmad , Khawlah Alhulwah , Ali N.A. Koam , Hamdan Alshehri","doi":"10.1016/j.cam.2026.117500","DOIUrl":"10.1016/j.cam.2026.117500","url":null,"abstract":"<div><div>Graph theory currently encompasses the study of several subjects, ranging from algebraic features of structures to the analysis of chemical graph structures without experimental procedures. Additionally, it involves the development of networks using topological Indices (TIs). Exploring different networks and utilising TIs is an expanding field of contemporary research. The use of optoelectronic technology in optical transposition interconnection systems (OTIS) offers an effective solution to the ongoing problem of storing and sending data with comprehensive information. This is due to the reduced power requirements and broad bandwidth capabilities of optoelectronic systems, which make them well-suited for this task. The integration of radio communication and electrical technology has transformed OTIS into a highly valued network, enhancing the efficiency of existing optoelectronic computers. OTIS is characterised by the biswapped network (BN) that is formed with the help of path graph <span><math><msub><mi>P</mi><mi>m</mi></msub></math></span> and denoted as <span><math><mrow><mi>B</mi><mo>(</mo><msub><mi>P</mi><mi>m</mi></msub><mo>)</mo></mrow></math></span>. This research work focused on the M-polynomial and entropy measures in relation to the number of connections between nodes of the graph <span><math><mrow><mi>B</mi><mo>(</mo><msub><mi>P</mi><mi>m</mi></msub><mo>)</mo></mrow></math></span> and its largest subgraph that preserves twin nodes (<span><math><mrow><mi>M</mi><mo>(</mo><mi>B</mi><mrow><mo>(</mo><msub><mi>P</mi><mi>m</mi></msub><mo>)</mo></mrow><mo>)</mo></mrow></math></span>).</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117500"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147386998","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

Existence of solutions for infinite nonlinear (p, q)-integral equations 无穷非线性(p, q)-积分方程解的存在性

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-22 DOI: 10.1016/j.cam.2026.117489

Hamid Reza Sahebi , Manochehr Kazemi , Bipan Hazarika

引用次数: 0

An ensemble-based model reduction method for random diffusion problems in porous media 多孔介质中随机扩散问题的基于集合的模型简化方法

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-22 DOI: 10.1016/j.cam.2026.117411

Mengnan Li , Shan Zhang , Xiaofei Guan

{"title":"An ensemble-based model reduction method for random diffusion problems in porous media","authors":"Mengnan Li , Shan Zhang , Xiaofei Guan","doi":"10.1016/j.cam.2026.117411","DOIUrl":"10.1016/j.cam.2026.117411","url":null,"abstract":"<div><div>In this paper, we present an ensemble-based model reduction method to solve random diffusion problems in porous media. The randomness and multiscale pose significant challenges for simulating these problems. To overcome this difficulty, we develop an ensemble-based iterative algorithm by integrating ensemble Monte Carlo (EMC) method with constraint energy minimizing generalized multiscale finite element method (CEM-GMsFEM). For random diffusion problems, traditional methods strongly rely on sampling the random space. This necessitates solving the corresponding PDEs for a large number of samples, resulting in high computational costs. To this end, we propose an ensemble method to ensure that all samples share a common stiffness matrix. This significantly improves the computational efficiency. Furthermore, this ensemble method can be combined with LU decomposition or block Krylov subspace iterative methods to further improve computational efficiency. Although the ensemble method avoids solving PDEs multiple times, the high-dimensional challenges posed by the multiscale characteristics remain. Therefore, we employ CEM-GMsFEM to construct an effective reduced-order ensemble model, reducing computational costs. For the proposed ensemble method, we provide a rigorous convergence analysis. A few numerical examples are presented to show the effectiveness of the proposed method.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117411"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147386622","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

Radau-type inequalities from multiplicative Katugampola fractional integrals theoretical point of view 从乘法Katugampola分数积分的理论观点看radau型不等式

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-21 DOI: 10.1016/j.cam.2026.117472

Dingyi Ai , Tingsong Du

{"title":"Radau-type inequalities from multiplicative Katugampola fractional integrals theoretical point of view","authors":"Dingyi Ai , Tingsong Du","doi":"10.1016/j.cam.2026.117472","DOIUrl":"10.1016/j.cam.2026.117472","url":null,"abstract":"<div><div>Herein, we are particularly intrigued by exploring Radau-type inequalities that emerge from multiplicative Katugampola fractional integrals. To that end, we commence by introducing the concept of such integrals. And several analytical properties, such as boundedness, continuity, commutativity, semigroup property, and others, are examined for the freshly introduced operators. Following this, we derive an identity pertinent to multiplicative Katugampola fractional integrals, which forms the basis for establishing a series of Radau-type inequalities in our investigation. These inequalities are derived under the condition that either the function <em>f</em>* is multiplicatively convex or the function (ln ∘<em>f</em>*)<sup><em>q</em></sup> is convex for <em>q</em> > 1, with a specific focus on the scenario where 0 < <em>q</em> ≤ 1. To deepen the readers’ profound comprehension of the acquired results, we present illustrative examples along with accompanying graphs, which confirm the correctness of the derived inequalities. Finally, we showcase the applicability of these inequalities presented here in various contexts, including multiplicative differential equations, quadrature formulas, and special means.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117472"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147386626","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

Stochastic limited memory BFGS algorithms for solving nonconvex support vector machine problems and nonconvex risk minimization program 随机有限记忆BFGS算法求解非凸支持向量机问题及非凸风险最小化方案

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-24 DOI: 10.1016/j.cam.2026.117487

Gonglin Yuan , Yingjie Zhou , Fanhua Shang , Zhijin Ge , Zhongzhou Jin

{"title":"Stochastic limited memory BFGS algorithms for solving nonconvex support vector machine problems and nonconvex risk minimization program","authors":"Gonglin Yuan , Yingjie Zhou , Fanhua Shang , Zhijin Ge , Zhongzhou Jin","doi":"10.1016/j.cam.2026.117487","DOIUrl":"10.1016/j.cam.2026.117487","url":null,"abstract":"<div><div>It is known that the limited memory BFGS (L-BFGS) method is an important method for solving nonlinear optimization. For stochastic optimization problems, especially for nonconvex functions, it is difficult to preserve <em>B<sub>k</sub></em>≻0 (the inverse of the Hessian matrix) for all <em>k</em> due to the noise incurred by estimating the gradient and the nonconvexity of the functions. In this paper, we propose a novel modified stochastic L-BFGS algorithm (MSLBFGS) for solving nonconvex optimization, where the positive definiteness of the designed matrix <em>B<sub>k</sub></em> is automatically maintained. We establish the convergence property of the proposed MSLBFGS algorithm. In the worst-case scenario, we output <span><math><mrow><mfrac><mn>1</mn><mi>N</mi></mfrac><msubsup><mo>∑</mo><mrow><mi>k</mi><mo>=</mo><mn>1</mn></mrow><mi>N</mi></msubsup><mrow><mi>E</mi><mo>[</mo><mo>∥</mo><mi>∇</mi><mi>f</mi></mrow><mrow><mo>(</mo><msub><mi>x</mi><mi>k</mi></msub><mo>)</mo></mrow><mrow><msup><mo>∥</mo><mn>2</mn></msup><mo>]</mo></mrow><mo><</mo><mrow><mi>ε</mi></mrow></mrow></math></span>, and prove that the number of the stochastic first-order oracle calls of the proposed algorithm with a diminishing step length is <span><math><mrow><mi>O</mi><mo>(</mo><msup><mrow><mi>ε</mi></mrow><mrow><mo>−</mo><mfrac><mn>1</mn><mrow><mn>1</mn><mo>−</mo><mi>β</mi></mrow></mfrac></mrow></msup><mo>)</mo></mrow></math></span> due to <em>β</em> ∈ (0.5, 1). Moreover, we also present a new modified stochastic L-BFGS algorithm that incorporates the variance reduction technique. Numerical experiments conducted on nonconvex support vector machine problems and nonconvex empirical risk minimization problems validate the effectiveness of the proposed algorithms, showing their advantages over existing methods.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117487"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147386631","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 Crank-Nicolson compact finite difference schemes for Allen-Cahn equation Allen-Cahn方程的松弛Crank-Nicolson紧致有限差分格式

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-10 DOI: 10.1016/j.cam.2026.117409

Mingrong Cui

引用次数: 0

Optimal error bound and regularization methods for identifying an unknown source in an advection-dispersion equation 平流色散方程中未知源识别的最优误差界和正则化方法

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2026-10-01 Epub Date: 2026-02-22 DOI: 10.1016/j.cam.2026.117461

Hanghang Wu , Hongqi Yang

引用次数: 0