共查询到20条相似文献,搜索用时 171 毫秒
1.
基于J.M.Peng研究一类变分不等式问题(简记为VIP)时所提出的价值函数,本文提出了求解强单调的VIP的一个新的信赖域算法。和已有的处理VIP的信赖域方法不同的是:它在每步迭代时,不必求解带信赖域界的子问题,仅解一线性方程组而求得试验步。这样,计算的复杂性一般来说可降低。在通常的假设条件下,文中还证明了算法的整体收敛性。最后,在梯度是半光滑和约束是矩形域的假设下,该算法还是超线性收敛的。 相似文献
2.
本文针对不等式约束优化问题,提出了一个可行序列线性方程组(FSSLE)算法.该算法每次迭代只需求解四个具有相同系数矩阵的线性方程组,因而计算量较小.在没有假设算法产生的聚点是孤立点和近似乘子列有界的条件下,证明了算法具有全局收敛性.在一般条件下,证明了算法具有超线性收敛性. 相似文献
3.
4.
本文提供了在没有非奇异假设的条件下,求解有界约束半光滑方程组的投影信赖域算法.基于一个正则化子问题,求得类牛顿步,进而求得投影牛顿步.在合理的假设条件下,证明了算法不仅具有整体收敛性而且保持超线性收敛速率. 相似文献
5.
6.
本文针对非线性不等式约束优化问题,提出了-个可行内点型算法.在每次迭代中,基于积极约束集策略,该算法只需求解三个线性方程组,因而其计算工作量较小.在-般的条件下,证明了算法具有全局收敛及超线性收敛性. 相似文献
7.
8.
9.
设计了求解不等式约束非线性规划问题的一种新的滤子序列线性方程组算法,该算法每步迭代由减小约束违反度和目标函数值两部分构成.利用约束函数在某个中介点线性化的方法产生搜索方向.每步迭代仅需求解两个线性方程组,计算量较小.在一般条件下,证明了算法产生的无穷迭代点列所有聚点都是可行点并且所有聚点都是所求解问题的KKT点. 相似文献
10.
本文提出了一类隐互补约束优化问题的磨光SQP算法.首先,我们给出了这类优化问题的最优性和约束规范性条件.然后,在适当假设条件下,我们证明了算法具有全局收敛性. 相似文献
11.
Kunyang Wang Feng Dai 《分析论及其应用》2007,23(1):50-63
As early as in 1990, Professor Sun Yongsheng, suggested his students at Beijing Normal University to consider research problems on the unit sphere. Under his guidance and encouragement his students started the research on spherical harmonic analysis and approximation. In this paper, we incompletely introduce the main achievements in this area obtained by our group and relative researchers during recent 5 years (2001-2005). The main topics are: convergence of Cesaro summability, a.e. and strong summability of Fourier-Laplace series; smoothness and K-functionals; Kolmogorov and linear widths. 相似文献
12.
Yuxian Zheng 《分析论及其应用》2006,22(2):136-140
In this paper, we study the commutators generalized by multipliers and a BMO function. Under some assumptions, we establish its boundedness properties from certain atomic Hardy space Hb^p(R^n) into the Lebesgue space L^p with p 〈 1. 相似文献
13.
H. H. Cuenya M.D. Lorenzo C. N. Rodriguez 《分析论及其应用》2007,23(2):162-170
In this paper we study best local quasi-rational approximation and best local approximation from finite dimensional subspaces of vectorial functions of several variables. Our approach extends and unifies several problems concerning best local multi-point approximation in different norms. 相似文献
14.
《中国科学 数学(英文版)》2014,(8)
<正>May 26,2014,Beijing Science is a human enterprise in the pursuit of knowledge.The scientific revolution that occurred in the 17th Century initiated the advances of modern science.The scientific knowledge system created by 相似文献
15.
16.
《计算数学》2014,(2)
<正>August 10-14,2015Beijing,ChinaThe International Congress on Industrial and Applied Mathematics(ICIAM)is the premier international congress in the field of applied mathematics held every four years under the auspices of the International Council for Industrial and Applied Mathematics.From August 10 to 14,2015,mathematicians,scientists 相似文献
17.
W.M.Shah A.Liman 《分析论及其应用》2004,20(1):16-27
Let P(z)=∑↓j=0↑n ajx^j be a polynomial of degree n. In this paper we prove a more general result which interalia improves upon the bounds of a class of polynomials. We also prove a result which includes some extensions and generalizations of Enestrǒm-Kakeya theorem. 相似文献
18.
In this paper, the authors study the boundedness of the operator [μΩ, b], the commutator generated by a function b ∈ Lipβ(Rn)(0 <β≤ 1) and the Marcinkiewicz integrals μΩ, on the classical Hardy spaces and the Herz-type Hardy spaces in the case Ω∈ Lipα(Sn-1)(0 <α≤ 1). 相似文献
19.
Francois Chaplais 《分析论及其应用》2006,22(4):301-318
In applications it is useful to compute the local average empirical statistics on u. A very simple relation exists when of a function f(u) of an input u from the local averages are given by a Haar approximation. The question is to know if it holds for higher order approximation methods. To do so, it is necessary to use approximate product operators defined over linear approximation spaces. These products are characterized by a Strang and Fix like condition. An explicit construction of these product operators is exhibited for piecewise polynomial functions, using Hermite interpolation. The averaging relation which holds for the Haar approximation is then recovered when the product is defined by a two point Hermite interpolation. 相似文献
20.
A.Al-Shuaibi F.Al-Rawjih 《分析论及其应用》2004,20(1):28-34
Given the Laplace transform F(s) of a function f(t), we develop a new algorithm to find an approximation to f(t) by the use of the classical Jacobi polynomials. The main contribution of our work is the development of a new and very effective method to determine the coefficients in the finite series expansion that approximation f(t) in terms of Jacobi polynomials. Some numerical examples are illustrated. 相似文献