期刊文献+
共找到332篇文章
< 1 2 17 >
每页显示 20 50 100
A Dual Approach for Solving Nonlinear Infinity-Norm Minimization Problems with Applications in Separable Cases
1
作者 Wajeb Gharibi Yong Xia 《Numerical Mathematics A Journal of Chinese Universities(English Series)》 SCIE 2007年第3期265-270,共6页
In this paper,we consider nonlinear infinity-norm minimization problems.We device a reliable Lagrangian dual approach for solving this kind of problems and based on this method we propose an algorithm for the mixed li... In this paper,we consider nonlinear infinity-norm minimization problems.We device a reliable Lagrangian dual approach for solving this kind of problems and based on this method we propose an algorithm for the mixed linear and nonlinear infinity- norm minimization problems.Numerical results are presented. 展开更多
关键词 最小化问题 拉格朗日对偶 线性规划 规划论
在线阅读 下载PDF
Integral Global Minimization of Constrained Problems with Discontinuous Penalty Functions 被引量:1
2
作者 吴斌 崔洪泉 郑权 《Journal of Shanghai University(English Edition)》 CAS 2005年第5期385-390,共6页
A class of discontinuous penalty functions was proposed to solve constrained minimization problems with the integral approach to global optimization, m-mean value and v-variance optimality conditions of a constrained ... A class of discontinuous penalty functions was proposed to solve constrained minimization problems with the integral approach to global optimization, m-mean value and v-variance optimality conditions of a constrained and penalized minimization problem were investigated. A nonsequential algorithm was proposed. Numerical examples were given to illustrate the effectiveness of the algorithm. 展开更多
关键词 integral global minimization constrained minimization problems discontinuous penalty functions.
在线阅读 下载PDF
Solving Large Scale Unconstrained Minimization Problems by a New ODE Numerical Integration Method
3
作者 Tianmin Han Xinlong Luo Yuhuan Han 《Applied Mathematics》 2011年第5期527-532,共6页
In reference [1], for large scale nonlinear equations , a new ODE solving method was given. This paper is a continuous work. Here has gradient structure i.e. , is a scalar function. The eigenvalues of the Jacobian of;... In reference [1], for large scale nonlinear equations , a new ODE solving method was given. This paper is a continuous work. Here has gradient structure i.e. , is a scalar function. The eigenvalues of the Jacobian of;or the Hessian of , are all real number. So the new method is very suitable for this structure. For quadratic function the convergence was proved and the spectral radius of iteration matrix was given and compared with traditional method. Examples show for large scale problems (dimension ) the new method is very efficient. 展开更多
关键词 UNCONSTRAINED minimization problem Gradient EQUATIONS QUADRATIC Model Spectral RADIUS ODE Numerical Integration
在线阅读 下载PDF
Minimizing sequences of variational problems with small parameters
4
作者 倪明康 林武忠 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2009年第6期695-701,共7页
A class of variational problems with small parameters is studied. Their zeroth-order asymptotic solutions are constructed. It is shown that the zeroth-order asymptotic solution is just the minimizing sequence of varia... A class of variational problems with small parameters is studied. Their zeroth-order asymptotic solutions are constructed. It is shown that the zeroth-order asymptotic solution is just the minimizing sequence of variational problems as the small parameter approaches to zero. 展开更多
关键词 small parameter variational problem minimizing sequence
在线阅读 下载PDF
A TRUST REGION ALGORITHM VIA BILEVEL LINEAR PROGRAMMING FOR SOLVING THE GENERAL MULTICOMMODITY MINIMAL COST FLOW PROBLEMS
5
作者 ZhuDetong 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2004年第4期459-473,共15页
This paper proposes a nonmonotonic backtracking trust region algorithm via bilevel linear programming for solving the general multicommodity minimal cost flow problems.Using the duality theory of the linear programmin... This paper proposes a nonmonotonic backtracking trust region algorithm via bilevel linear programming for solving the general multicommodity minimal cost flow problems.Using the duality theory of the linear programming and convex theory,the generalized directional derivative of the general multicommodity minimal cost flow problems is derived.The global convergence and superlinear convergence rate of the proposed algorithm are established under some mild conditions. 展开更多
关键词 duality theory trust region method generalized directional derivative general multicommodity minimal cost flow problems.
在线阅读 下载PDF
New Procedure of Finding an Initial Basic Feasible Solution of the Time Minimizing Transportation Problems
6
作者 Mollah Mesbahuddin Ahmed Md. Amirul Islam +2 位作者 Momotaz Katun Sabiha Yesmin Md. Sharif Uddin 《Open Journal of Applied Sciences》 2015年第10期634-640,共7页
Minimization of transportation time is a great concern of the transportation problems like the cost minimizing transportation problems. In this writing, a transportation algorithm is developed and applied to obtain an... Minimization of transportation time is a great concern of the transportation problems like the cost minimizing transportation problems. In this writing, a transportation algorithm is developed and applied to obtain an Initial Basic Feasible Solution (IBFS) of transportation problems in minimizing transportation time. The developed method has also been illustrated numerically to test the efficiency of the method where it is observed that the proposed method yields a better result. 展开更多
关键词 TRANSPORTATION problem INITIAL Basic Feasible SOLUTION minimizing TRANSPORTATION TIME
暂未订购
基于TFQMR的洛伦兹力势声源MACT-MI图像重建研究
7
作者 闫孝姮 付鹏 +1 位作者 陈伟华 侯潇涵 《电工技术学报》 北大核心 2026年第4期1087-1099,共13页
感应式磁声磁粒子浓度成像(MACT-MI)是一种基于磁声耦合效应的磁纳米粒子(MNPs)浓度成像新方法。针对MACT-MI逆问题成像速度较慢的问题,该文引入势函数构建声压与MNPs浓度的关系,提出一种基于无转置拟最小残差(TFQMR)算法的洛伦兹力势... 感应式磁声磁粒子浓度成像(MACT-MI)是一种基于磁声耦合效应的磁纳米粒子(MNPs)浓度成像新方法。针对MACT-MI逆问题成像速度较慢的问题,该文引入势函数构建声压与MNPs浓度的关系,提出一种基于无转置拟最小残差(TFQMR)算法的洛伦兹力势声源图像重建方法。该方法降低了逆问题理论公式的求解复杂度,在保证图像高分辨率的前提下,进一步提高了成像速度。首先,建立了多种尺寸、形状,以及噪声情况下的磁纳米粒子模型。其次,将获取的数据用于浓度计算公式中进行图像重建。最后,对重建结果进行质量分析,分别对比不同模型在不同方法下的重建分辨率和重建速度。仿真结果表明:在相同浓度条件下,该方法在无噪声干扰时,相关系数平均高于0.9476、相对误差平均低于0.3993、结构相似性平均高于0.95、平均图像重建时间缩短至39.84s。同时,该方法在不同噪声模型下具有较强的抗噪性,为MACT-MI的临床应用提供了理论支撑。 展开更多
关键词 感应式磁声磁粒子浓度成像 洛伦兹力 势声源 TFQMR算法 逆问题成像
在线阅读 下载PDF
求解约束Minimax问题的神经网络模型 被引量:2
8
作者 陶卿 方廷健 《控制理论与应用》 EI CAS CSCD 北大核心 2000年第1期82-84,共3页
本文提出一种求解约束二次Minimax问题的神经网络模型 ,给出了它的Lyapunov能量函数 ,运用LaSalle不变性原理证明了它的大范围渐近稳定性 ,作为应用考察了L1范数极小化问题 .
关键词 minimAX问题 神经网络模型 对策理论 数学规划
在线阅读 下载PDF
平面上一类整点区域的Davenport常数
9
作者 邓贵新 黄彬 程鹏 《南宁师范大学学报(自然科学版)》 2026年第2期152-160,共9页
零和理论是加法组合领域中的一个重要研究方向,主要研究交换群上与零和序列相关的组合性质。计算交换群的子集的Davenport常数是零和理论中一个困难的核心问题。设G是交换群,X是G的非空子集,S是X上的一个序列,如果S中的各元素之和为0,则... 零和理论是加法组合领域中的一个重要研究方向,主要研究交换群上与零和序列相关的组合性质。计算交换群的子集的Davenport常数是零和理论中一个困难的核心问题。设G是交换群,X是G的非空子集,S是X上的一个序列,如果S中的各元素之和为0,则称S是零和的;若S是零和的,且它的任意非空真子列都不是零和的,则称S是极小零和的;X上的所有极小零和序列的长度的上确界称为X的Davenport常数,记为D(X)。目前已经知道当X为秩为1或2的有限交换群时和当X为有限交换p-群时D(X)的值,而对无限交换群G的子集的Davenport常数的研究主要集中在G为自由群的情形。本文证明,当X为平面整点区域[-2,2]×[-2,n](n≥36)时,有D(X)=4n+k,其中k在n≡2(mod 3)时为5,在n≡0,1(mod 3)时为7。 展开更多
关键词 零和问题 零和序列 极小零和序列 Davenport常数
在线阅读 下载PDF
欺骗性干扰场景下的功率带宽联合分配策略
10
作者 李辉 武会斌 +2 位作者 王伟东 张恺 侯庆华 《电子科技》 2026年第2期19-27,共9页
针对欺骗性干扰导致的雷达性能下降问题,文中提出了一种功率带宽联合分配方案来提高雷达的探测精度,并借助高探测性能来提高雷达的抗干扰决策能力。以欺骗性距离的三维CRLB(Cramer-Rao Lower Bound)来代表雷达的探测精度,并将CRLB作为... 针对欺骗性干扰导致的雷达性能下降问题,文中提出了一种功率带宽联合分配方案来提高雷达的探测精度,并借助高探测性能来提高雷达的抗干扰决策能力。以欺骗性距离的三维CRLB(Cramer-Rao Lower Bound)来代表雷达的探测精度,并将CRLB作为目标函数建立优化问题。在考虑资源有限情况下,将优化问题中的功率资源总量和带宽资源总量限制在固定范围内。根据资源优化分配问题的非凸非线性特点提出了循环最小化算法和投影梯度下降算法相结合的解决方案。在不同雷达布局下进行仿真实验。仿真结果表明,相较于未优化的分配方案,资源联合优化的分配方案的CRLB数值降低了20%~30%,从而提高了雷达的探测精度,并缓解了欺骗性干扰导致的性能下降问题。 展开更多
关键词 分布式MIMO雷达 欺骗性干扰 假目标辨识 雷达资源分配 CRLB 循环最小化算法 非凸优化问题求解 投影梯度下降算法
在线阅读 下载PDF
EXISTENCE OF SOLUTIONS FOR PERIODIC BOUNDARY VALUE PROBLEMS FOR SECOND-ORDER INTEGRO-DIFFERENTIAL EQUATIONS 被引量:1
11
作者 洪世煌 胡适耕 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2000年第3期355-362,共8页
By establishing a comparison result and using monotone iterative methods, the theorem of existence for minimal and maximal solutions of periodic boundary value problems for second-order nonlinear integro-differential ... By establishing a comparison result and using monotone iterative methods, the theorem of existence for minimal and maximal solutions of periodic boundary value problems for second-order nonlinear integro-differential equations in Banach spaces is proved. 展开更多
关键词 ordered Banach spaces periodic boundary value problems maximal and minimal solutions
在线阅读 下载PDF
The Extremal Problem on Cartan-egg Domain of the First Type 被引量:2
12
作者 SU Jian-bing LI Hai-tao 《Chinese Quarterly Journal of Mathematics》 CSCD 2011年第3期343-349,共7页
In this paper,we study the extremal problem on Cartan-egg domain of the first type by using some inequalities.The extremal mapping and extremal value between the first type of Cartan-egg domain and the unit ball when ... In this paper,we study the extremal problem on Cartan-egg domain of the first type by using some inequalities.The extremal mapping and extremal value between the first type of Cartan-egg domain and the unit ball when k≤1 and k=2,m=2 are constructed. 展开更多
关键词 extremal problem Cartan-egg domain the minimal circumscribed ellipsoid
在线阅读 下载PDF
Sparse Solutions of Mixed Complementarity Problems 被引量:1
13
作者 Peng Zhang Zhensheng Yu 《Journal of Applied Mathematics and Physics》 2020年第1期10-22,共13页
In this paper, we consider an extragradient thresholding algorithm for finding the sparse solution of mixed complementarity problems (MCPs). We establish a relaxation l1 regularized projection minimization model for t... In this paper, we consider an extragradient thresholding algorithm for finding the sparse solution of mixed complementarity problems (MCPs). We establish a relaxation l1 regularized projection minimization model for the original problem and design an extragradient thresholding algorithm (ETA) to solve the regularized model. Furthermore, we prove that any cluster point of the sequence generated by ETA is a solution of MCP. Finally, numerical experiments show that the ETA algorithm can effectively solve the l1 regularized projection minimization model and obtain the sparse solution of the mixed complementarity problem. 展开更多
关键词 Mixed Complementarity problem SPARSE Solution L1 REGULARIZED PROJECTION minimization Model Extragradient THRESHOLDING Algorithm
在线阅读 下载PDF
THE SOLUBILITY OF THE MULTIDIMENSIONAL TLS PROBLEM
14
作者 颜世建 徐玲玲 +1 位作者 范金燕 黄开斌 《Numerical Mathematics A Journal of Chinese Universities(English Series)》 SCIE 1998年第2期121-124,共4页
A necessary and sufficient condition of the solubility far the multidimensional TLS problem is presented.
关键词 The total least SQUARES problem the nonlinear minimization problems.
在线阅读 下载PDF
Viscosity approximation with weak contractions for fixed point problem,equilibrium problem,and variational inequality problem
15
作者 张石生 李向荣 +1 位作者 陈志坚 柳京爱 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2010年第10期1273-1282,共10页
This paper proposes a modified iterative algorithm using a viscosity approximation method with a weak contraction.The purpose is to find a common element of the set of common fixed points of an infinite family of none... This paper proposes a modified iterative algorithm using a viscosity approximation method with a weak contraction.The purpose is to find a common element of the set of common fixed points of an infinite family of nonexpansive mappings and the set of a finite family of equilibrium problems that is also a solution to a variational inequality.Under suitable conditions,some strong convergence theorems are established in the framework of Hilbert spaces.The results presented in the paper improve and extend the corresponding results of Colao et al.(Colao,V.,Acedo,G.L.,and Marino,G.An implicit method for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of infinite family of nonexpansive mappings.Nonlinear Anal.71,2708–2715(2009)),Plubtieng and Punpaeng(Plubtieng,S.and Punpaeng,R.A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces.J.Math.Anal.Appl.336,455–469(2007)),Colao et al.(Colao,V.,Marino,G.,and Xu,H.K.An iterative method for finding common solutions of equilibrium problem and fixed point problems.J.Math.Anal.Appl.344,340–352(2008)),Yao et al.(Yao,Y.,Liou,Y.C.,and Yao,J.C.Convergence theorem for equilibrium problems and fixed point problems of infinite family of nonexpansive mappings.Fixed Point Theory Application 2007,Article ID 64363(2007)DOI 10.1155/2007/64363),and others. 展开更多
关键词 viscosity approximation weak contraction mapping equilibrium problem nonexpansive mapping implicit iteration minimization problem
在线阅读 下载PDF
A REMARK ON THE REGULARITY OF VECTOR-VALUED MAPPINGS DEPENDING ON TWO VARIABLES WHICH MINIMIZE SPLITTING-TYPE VARIATIONAL INTEGRALS
16
作者 M. Bildhauer M. Fuchs 《Acta Mathematica Scientia》 SCIE CSCD 2010年第3期963-967,共5页
We combine the maximum principle for vector-valued mappings established by D'Ottavio, Leonetti and Musciano [7] with regularity results from [5] and prove the Holder continuity of the first derivatives for local mini... We combine the maximum principle for vector-valued mappings established by D'Ottavio, Leonetti and Musciano [7] with regularity results from [5] and prove the Holder continuity of the first derivatives for local minimizers u: Ω→^R^N of splitting-type variational integrals provided Ω is a domain in R^2. 展开更多
关键词 Local minimizers interior regularity anisotropic energies two-dimensional problems
在线阅读 下载PDF
LOCAL DISCONTINUOUS GALERKIN METHOD FOR ELLIPTIC INTERFACE PROBLEMS
17
作者 张志娟 蔚喜军 常延贞 《Acta Mathematica Scientia》 SCIE CSCD 2017年第5期1519-1535,共17页
In this paper,the minimal dissipation local discontinuous Galerkin method is studied to solve the elliptic interface problems in two-dimensional domains.The interface may be arbitrary smooth curves.It is shown that th... In this paper,the minimal dissipation local discontinuous Galerkin method is studied to solve the elliptic interface problems in two-dimensional domains.The interface may be arbitrary smooth curves.It is shown that the error estimates in L;-norm for the solution and the flux are O(h;|log h|)and O(h|log h|;),respectively.In numerical experiments,the successive substitution iterative methods are used to solve the LDG schemes.Numerical results verify the efficiency and accuracy of the method. 展开更多
关键词 elliptic interface problem minimal dissipation local discontinuous Galerkin method error estimates
在线阅读 下载PDF
ON THE SINGULAR VARIATIONAL PROBLEMS
18
作者 谭经刚 杨健夫 《Acta Mathematica Scientia》 SCIE CSCD 2004年第4期672-690,共19页
The authors deal with the singular variational problemS(α,b,λ0)as well asS= S(α,b,λ1,λ2)where Nm/N-m+m(b-a),α,β(?)1,E= D1α,m(RN). The aim of this paper is to show the existence of minimizer for 5(α, b,λ0) an... The authors deal with the singular variational problemS(α,b,λ0)as well asS= S(α,b,λ1,λ2)where Nm/N-m+m(b-a),α,β(?)1,E= D1α,m(RN). The aim of this paper is to show the existence of minimizer for 5(α, b,λ0) and S(α,b,λ1,λ2). 展开更多
关键词 Singular variational problems existemce of minimizer
在线阅读 下载PDF
New Approach to Find Initial Basic Feasible Solution (IBFS) for Optimal Solution in Transportation Problem
19
作者 Shubham Raval 《Open Journal of Applied Sciences》 CAS 2023年第2期207-211,共5页
Minimizing transportation time and getting optimal solutions are always considered as important factors while solving transportation problem. This paper shows a new approach for finding initial basic solution for tran... Minimizing transportation time and getting optimal solutions are always considered as important factors while solving transportation problem. This paper shows a new approach for finding initial basic solution for transportation problem which reduces cost of transportation more than any transportation method such as LCM, northwest, Vogel’s approximation and so on. This method has been illustrated by taking an example;afterwards, it compares basic initial feasible solution with other methods IBF and optimal dictate solutions such as MODI and Steppingstone method. 展开更多
关键词 Transportation problem New Approach for Transportation problem Initial Basic Feasible Solution minimizing Transportation Time
在线阅读 下载PDF
结构拓扑优化ICM方法的B映射求解途径 被引量:1
20
作者 彭细荣 隋允康 +1 位作者 叶红玲 铁军 《固体力学学报》 北大核心 2025年第2期162-176,共15页
本文基于结构拓扑优化的ICM(独立、连续和映射的简称)方法,发展出了双映射接力运作的求解途径,因“双”的英文简称为B,故称之为B-ICM求解途径.该途径由两步组成:第一步是L(线性)映射作用于结构拓扑优化问题,使之成为离散模型,然后构造... 本文基于结构拓扑优化的ICM(独立、连续和映射的简称)方法,发展出了双映射接力运作的求解途径,因“双”的英文简称为B,故称之为B-ICM求解途径.该途径由两步组成:第一步是L(线性)映射作用于结构拓扑优化问题,使之成为离散模型,然后构造了约束函数;第二步是NL(非线性)映射作用于离散模型,使之成为连续模型,同时实现了单元拓扑变量由离散到连续的转换过程.以往ICM方法的求解途径中,上述第一步只是起到理论推导的作用,构造约束函数同其它建模与求解等算法均包含在第二步里,因此属于“一步求解”途径.B-ICM虽然属于“两步求解”途径,但是优化模型寻优仍然沿用ICM方法惯用的序列对偶二次规划算法.本文以位移约束的体积极小化结构拓扑优化问题为例,示例了上述建模及求解过程.单载荷工况和多载荷工况的算例,均印证了本文的研究实现了预期构想,与目前旨在得到清晰拓扑的3种方法(1、考虑Heaviside投影的SIMP方法;2、浮动投影拓扑优化<简称为FPTO>方法;3、非惩罚的光滑边界材料分布拓扑优化<简称为SEMDOT>方法),以及ICM方法以往的求解途径,进行了迭代次数、清晰程度、寻优能力等方面的对比,结果表明B-ICM求解途径表现最好.本文研究不仅丰富了ICM方法建模策略,推动了ICM方法求解途径的完善,也为解决模糊边界问题提供了一种优越的做法.过往的连续体结构拓扑优化求解,因消除棋盘格和网格依赖性问题而采取的过滤操作导致最优拓扑构型产生模糊边界,而且过滤半径越大,则边界越模糊.本文克服了这些令人堪忧的问题,可以成功地得到最优拓扑构型的清晰边界.值得提及的是,本文研究的关键技术,可以移植到包括变密度方法等所有连续变量优化的方法中. 展开更多
关键词 结构拓扑优化 ICM方法 两步求解途径 线性映射 非线性映射 位移约束的体积极小化问题
原文传递
上一页 1 2 17 下一页 到第
使用帮助 返回顶部