首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   35篇
  免费   4篇
  国内免费   1篇
化学   1篇
力学   1篇
综合类   1篇
数学   35篇
物理学   2篇
  2021年   1篇
  2018年   1篇
  2015年   1篇
  2013年   2篇
  2012年   3篇
  2009年   1篇
  2007年   1篇
  2006年   3篇
  2005年   3篇
  2004年   1篇
  2003年   2篇
  2000年   2篇
  1999年   2篇
  1998年   1篇
  1996年   1篇
  1994年   2篇
  1992年   2篇
  1990年   1篇
  1988年   2篇
  1985年   3篇
  1984年   1篇
  1981年   1篇
  1978年   1篇
  1976年   2篇
排序方式: 共有40条查询结果,搜索用时 20 毫秒
1.
Schwarz波形松弛(Schwarz waveform relaxation,SWR)是一种新型区域分解算法,是当今并行计算研究领域的焦点之一,但针对该算法的收敛性分析基本上都停留在时空连续层面.从实际计算角度看,分析离散SWR算法的收敛性更重要.本文考虑SWR研究领域中非常流行的Robin型人工边界条件,分析时空离散参数t和x、模型参数等因素对算法收敛速度的影响.Robin型人工边界条件中含有一个自由参数p,可以用来优化算法的收敛速度,但最优参数的选取却需要求解一个非常复杂的极小-极大问题.本文对该极小-极大问题进行深入分析,给出最优参数的计算方法.本文给出的数值实验结果表明所获最优参数具有以下优点:(1)相比连续情形下所获最优参数,利用离散情形下获得的参数可以进一步提高Robin型SWR算法在实际计算中的收敛速度,当固定t或x而令另一个趋于零时,利用离散情形下所获参数可以使算法的收敛速度具有鲁棒性(即收敛速度不随离散参数的减小而持续变慢).(2)相比连续情形下所获收敛速度估计,离散情形下获得的收敛速度估计可以更加准确地预测算法的实际收敛速度.  相似文献   
2.
定义了目标函数为带权重的min-max规划,约束条件为加法-取小模糊关系不等式系统,研究此模糊关系规划问题的求解思路和方法。当此模糊关系系统相容时,给出了一个求解此模糊关系规划问题的新算法和例子。  相似文献   
3.
一种新的求解带约束的有限极大极小问题的精确罚函数   总被引:1,自引:0,他引:1  
提出了一种新的精确光滑罚函数求解带约束的极大极小问题.仅仅添加一个额外的变量,利用这个精确光滑罚函数,将带约束的极大极小问题转化为无约束优化问题.证明了在合理的假设条件下,当罚参数充分大,罚问题的极小值点就是原问题的极小值点.进一步,研究了局部精确性质.数值结果表明这种罚函数算法是求解带约束有限极大极小问题的一种有效算法.  相似文献   
4.
《Optimization》2012,61(11):1761-1779
In this article, we study reward–risk ratio models under partially known message of random variables, which is called robust (worst-case) performance ratio problem. Based on the positive homogenous and concave/convex measures of reward and risk, respectively, the new robust ratio model is reduced equivalently to convex optimization problems with a min–max optimization framework. Under some specially partial distribution situation, the convex optimization problem is converted into simple framework involving the expectation reward measure and conditional value-at-risk measure. Compared with the existing reward–risk portfolio research, the proposed ratio model has two characteristics. First, the addressed problem combines with two different aspects. One is to consider an incomplete information case in real-life uncertainty. The other is to focus on the performance ratio optimization problem, which can realize the best balance between the reward and risk. Second, the complicated optimization model is transferred into a simple convex optimization problem by the optimal dual theorem. This indeed improves the usability of models. The generation asset allocation in power systems is presented to validate the new models.  相似文献   
5.
We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for actually finding such a partition by our proof.  相似文献   
6.
We prove that, for any given vertexν* in a series-parallel graph G, its edge set can be partitioned into k= min{k′(G) 1,δ(G)} subsets such that each subset covers all the vertices of G possibly except forν*, whereδ(G) is the minimum degree of G and k′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for actually finding such a partition by our proof.  相似文献   
7.
针对带约束的凸多面体线性不确定模型,提出了一种新型鲁棒预测控制方法,它采用离散化的不确定模型构造最小-最大优化控制问题,并在其中直接引入状态反馈机制,与其他最小-最大预测控制方法相比,这种方法等效于增加了控制序列的长度,为优化问题增加了更多的自由度,从而扩大了可行域,作为最小化目标的是离散化不确定系统在整个预测时域上二次型成本函数的最大值,而不是各预测阶段应成本项的上界之和,从而减少了与最小-最大优化相关的方程个数,有利于降低计算复杂性,文中进一步证明了不确定系统的闭环稳定性取决于优化问题在初始时刻的可行性,并将优化问题转化为线性矩阵不等式形式。最后,以数值仿赵例子验证了方法的有效性。  相似文献   
8.
There are well established rival theories about the economy. These have, in turn, led to the development of rival models purporting to represent the economic system. The models are large systems of discrete-time nonlinear dynamic equations. Observed data of the real system does not, in general, provide sufficient information for statistical methods to invalidate all but one of the rival models. In such a circumstance, there is uncertainty about which model to use in the formulation of policy. Prudent policy design would suggest that a model-based policy should take into account all the rival models. This is achieved as a pooling of the models. The pooling that yields the policy which is robust to model choice is formulated as a constrained min-max problem. The minimization is over the decision variables and the maximization is over the rival models. Only equality constraints are considered.A successive quadratic programming algorithm is discussed for the solution of the min-max problem. The algorithm uses a stepsize strategy based on a differentiable penalty function for the constraints. Two alternative quadratic subproblems can be used. One is a quadratic min-max and the other a quadratic programming problem. The objective function of either subproblem includes a linear term which is dependent on the penalty function. The penalty parameter is determined at every iteration, using a strategy that ensures a descent property as well as the boundedness of the penalty term. The boundedness follows since the strategy is always satisfied for finite values of the parameter which needs to be increased a finite number of times.The global and local convergence of the algorithm is established. The conditions, involving projected Hessian approximations, are discussed under which the algorithm achieves unit stepsizes and subsequently Q-superlinear convergence.  相似文献   
9.
For an arbitrary poset P, subposets {P i : 1ik} form a transitive basis of P if P is the transitive closure of their union. Let u be the minimum size of a covering of P by chains within posets of the basis, s the maximum size of a family of elements with no pair comparable in any basis poset, and a the maximum size of an antichain in P. Define a dense covering to be a collection D of chains within basis posets such that each element belongs to a chain in D within each basis poset and is the top of at least k-1 chains and the bottom of at least k-1 chains in D. Dense coverings generalize ordinary chain coverings of poset. Let d=min {|D|–(k–1)|P|}. For an arbitrary poset and transitive basis, a convenient network model for dense coverings yields the following: Theorem 1: da, with equality iff P has a minimum chain decomposition in which every pair of consecutive elements on each chain are comparable in some basis poset. Theorem 2: usda. Theorem 3: s=d iff s=a. The most interesting special case is where the transitive basis expresses P as the product of two posets, in which case u and s measure the minimum and maximum sizes of unichain coverings and semiantichains.  相似文献   
10.
熵函数法的数学理论   总被引:16,自引:0,他引:16  
陈国庆  赵素芬 《计算数学》1999,21(4):397-406
1.引言考虑复合函数其中g;:R"-R,i=1,2,...;。连续可微.因的x)的不可微性,涉及的x)的优化问题,如极大极小问题Irlmlnotxj.fijZFR"通常属不可微优化范畴.文山借助最大嫡原理推导出一类一致逼近一(X)的可微函数(称之为妨函数)O。ill--一iflyllXDCQ.loll.IJj容易证明tim人一中且对任意xER",CM+OOgbcl(l>ofc。(l,VCZ>CI>0,(4illffi0<ul。()di(]<.(5基于该性质,文山一【4]通过一次取定较大有限值C。>0,将…  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号