首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 265 毫秒
1.
海进科  朱一心 《数学杂志》2004,24(6):607-609
这篇文章中,我们研究了一种有限π-可分群G,它的每一个非线性不可约特征标是π-次的,得到了G是π-群的一个等价条件,并且给出了一些群理论的特征.  相似文献   

2.
称有限群的不可约特征标x为SM-特征标,如果x可由某个次正规子群的线性特征标诱导得到.称有限群为SM-群,如果有限群的所有不可约特征标均为SM-特征标.通过一个例子,将说明rp~3-阶群不一定是SM-群.  相似文献   

3.
海进科  李正兴 《数学杂志》2011,31(6):1045-1048
本文研究了一个有限群和它的特征标的Galois共轭类.利用群作用和Galois作用,得到了关于相应Γ_K类和半惯性子群的一些结果,推广了一些著名定理.  相似文献   

4.
钱国华 《数学年刊A辑》2005,26(3):307-312
本文考察特征标次数的商如何影响有限群的结构.设G是非线性不可约特征标次数的商都是n次方自由的有限群,首先,对可解群G证明了它的导长能被一个仅依赖于n的函数所界定;其次,给出了当n≤3时有限群G的结构.  相似文献   

5.
本文考察特征标次数的商如何影响有限群的结构.设G是非线性不可约特征标次数的商都是n次方自由的有限群,首先,对可解群G证明了它的导长能被一个仅依赖于n的函数所界定;其次,给出了当n≤3时有限群G的结构.  相似文献   

6.
这篇文章中 ,我们研究了一种有限π -可分群G ,它的每一个非线性不可约特征标是π -次的 ,得到了G是π -群的一个等价条件 ,并且给出了一些群理论的特征。  相似文献   

7.
对于有限群G的一个不可约特征标χ,我们定义它的余次数为cod(χ)=|G:kerχ|/χ(1).本文介绍有限群特征标余次数方面的工作进展和未解决的问题.  相似文献   

8.
海进科  朱一心 《数学杂志》2004,24(6):607-609
这篇文章中,我们研究了一种有限π-可分群G,它的每一个非线性不可约特征标是π-次的.得到了G是π-群的一个等价条件,并且给出了一些群理论的特征。  相似文献   

9.
刘智慧 《数学杂志》2007,27(5):569-572
本文研究了一般的非交换有限群G的阶与不可约特征标个数的比值与群G结构之间的关系.通过群G阶的最小素因子和G的换位子群的阶的最小素因子,得出了这个比值的下界,并确定了达到下界的一个充分必要条件.  相似文献   

10.
本文首先介绍了半群、群的定义,研究了自然数n取何值时,通过定义相应的代数运算,使得它的因子集构成半群、群,从而为半群的代数理论提供了一个有趣的实例.  相似文献   

11.
Sequential unconstrained minimization is a general iterative method for minimizing a function over a given set. At each step of the iteration we minimize the sum of the objective function and an auxiliary function. The aim is to select the auxiliary functions so that, at least, we get convergence in function value to the constrained minimum. The SUMMA is a broad class of these methods for which such convergence holds. Included in the SUMMA class are the barrier-function methods, entropic and other proximal minimization algorithms, the simultaneous multiplicative algebraic reconstruction technique, and, after some reformulation, penalty-function methods. The alternating minimization method of Csiszár and Tusnády also falls within the SUMMA class, whenever their five-point property holds. Therefore, the expectation maximization maximum likelihood algorithm for the Poisson case is also in the SUMMA class.  相似文献   

12.
A popular approach to solving the complementarity problem is to reformulate it as an equivalent equation system via a complementarity function. In this paper, we propose a new class of functions, which contains the penalized natural residual function and the penalized Fischer–Burmeister function for symmetric cone complementarity problems. We show that this class of functions is indeed a class of complementarity functions. We finally prove that the merit function of this new class of complementarity functions is coercive.  相似文献   

13.
In this paper, we introduce a new class of two-parametric penalized function, which includes the penalized minimum function and the penalized Fischer-Burmeister flmc- tion over symmetric cone complementarity problems. We propose that this class of function is a class of complementarity functions(C-function). Moreover, its merit function has bounded level set under a weak condition.  相似文献   

14.
In this paper we give a class of algorithms for solving nonlinear algebraic equations using difference approximations of derivatives. The class is a modification of the original ABS class with the advantage of requiring less function evaluations. Special cases include the methods of Brown and Brent and the discretized Newton method, which is formulated in a way requiring fewer function evaluations per iteration.  相似文献   

15.
A canonical system is a kind of first-order system of ordinary differential equations on an interval of the real line parametrized by complex numbers. It is known that any solution of a canonical system generates an entire function of the Hermite-Biehler class. In this paper, we deal with the inverse problem to recover a canonical system from a given entire function of the Hermite-Biehler class satisfying appropriate conditions. This inverse problem was solved by de Branges in 1960s. However his results are often not enough to investigate a Hamiltonian of recovered canonical system. In this paper, we present an explicit way to recover a Hamiltonian from a given exponential polynomial belonging to the Hermite-Biehler class. After that, we apply it to study distributions of roots of self-reciprocal polynomials.  相似文献   

16.
A popular approach to solving the complementarity problem is to reformulate it as an equivalent system of smooth equations via a smoothing complementarity function. In this paper, first we propose a new class of smoothing complementarity functions, which contains the natural residual smoothing function and the Fischer–Burmeister smoothing function for symmetric cone complementarity problems. Then we give some unified formulae of the Fréchet derivatives associated with Jordan product. Finally, the derivative of the new proposed class of smoothing complementarity functions is deduced over symmetric cones.  相似文献   

17.
In this paper, we make a study of the Shapley values for cooperative fuzzy games, games with fuzzy coalitions, which admit the representation of rates of players' participation to each coalition. A Shapley function has been introduced by another author as a function which derives the Shapley value from a given pair of a fuzzy game and a fuzzy coalition. However, the previously proposed axioms of the Shapley function can be considered unnatural. Furthermore, the explicit form of the function has been given only on an unnatural class of fuzzy games. We introduce and investigate a more natural class of fuzzy games. Axioms of the Shapley function are renewed and an explicit form of the Shapley function on the natural class is given. We make sure that the obtained Shapley value for a fuzzy game in the natural class has several rational properties. Finally, an illustrative example is given.  相似文献   

18.
李博  杜杰  万立娟 《数学杂志》2016,36(4):851-858
本文研究了一类非凸最优化问题的凸化方法与最优性条件的问题.利用构造含有参数的函数变换方法,将具有次正定性质的目标函数凸化,并获得了这一类非凸优化问题全局最优解的充要条件,推广了凸化方法在求解全局最优化问题方面的应用.  相似文献   

19.
We propose a trust-region type method for a class of nonsmooth nonconvex optimization problems where the objective function is a summation of a (probably nonconvex) smooth function and a (probably nonsmooth) convex function. The model function of our trust-region subproblem is always quadratic and the linear term of the model is generated using abstract descent directions. Therefore, the trust-region subproblems can be easily constructed as well as efficiently solved by cheap and standard methods. When the accuracy of the model function at the solution of the subproblem is not sufficient, we add a safeguard on the stepsizes for improving the accuracy. For a class of functions that can be "truncated'', an additional truncation step is defined and a stepsize modification strategy is designed. The overall scheme converges globally and we establish fast local convergence under suitable assumptions. In particular, using a connection with a smooth Riemannian trust-region method, we prove local quadratic convergence for partly smooth functions under a strict complementary condition. Preliminary numerical results on a family of $\ell_1$-optimization problems are reported and demonstrate the efficiency of our approach.  相似文献   

20.
尝试在有限存储类算法中利用目标函数值所提供的信息.首先利用插值条件构造了一个新的二次函数逼近目标函数,得到了一个新的弱割线方程,然后将此弱割线方程与袁[1]的弱割线方程相结合,给出了一族包括标准LBFGS的有限存储BFGS类算法,证明了这族算法的收敛性.从标准试验函数库CUTE中选择试验函数进行了数值试验,试验结果表明...  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

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