A practical anti-cycling procedure for linearly constrained optimization

A procedure is described for preventing cycling in active-set methods for linearly constrained optimization, including the simplex method. The key ideas are a limited acceptance of infeasibilities in all variables, and maintenance of a working feasibility tolerance that increases over a long sequence of iterations. The additional work per iteration is nominal, and stalling cannot occur with exact arithmetic. The method appears to be reliable, based on computational results for the first 53 linear programming problems in theNetlib set.The material contained in this report is based upon research supported by the Air Force Office of Scientific Research Grant 87-01962; the U.S. Department of Energy Grant DE-FG03-87ER25030; National Science Foundation Grants CCR-8413211 and ECS-8715153; and the Office of Naval Research Contract N00014-87-K-0142.     

A dual approach to primal degeneracy

The Revised Primal Simplex algorithm, in its simplest form, has no defence against degeneracy. Various forms of the perturbation method are usually effective, but most offer no guarantee of avoiding all degeneracy, and can lead to numerical difficulties. This paper presents a method that avoids cycling and circling by taking a dual approach.The degenerate subproblem consists of all the original variables, but only the degenerate transformed constraints. The current primal objective, which may be mixed, is used. This subproblem may be solved using the dual simplex algorithm, starting from the current dual infeasible solution, and with a zero dual objective. If the dual algorithm terminates optimally then the whole problem is optimal (subject to primal feasibility). Otherwise the final solution provides a non-basic direction which improves the value of the mixed primal objective and moves away from the degenerate vertex. A purification algorithm then renders the solution basic and further improves the mixed objective.     

有限维算符整函数幂级数展开的简单实现

在量子力学算符可表示为有限维矩阵形式的情况下,利用线性代数中Hamilton—Cayley定理,针对算符整函数的无穷幂级数展开,给出化简方法．     

Characteristic integrals in 3D and linear degeneracy

Conservation laws vanishing along characteristic directions of a given system of PDEs are known as characteristic conservation laws, or characteristic integrals. In 2D, they play an important role in the theory of Darboux-integrable equations. In this paper we discuss characteristic integrals in 3D and demonstrate that, for a class of second order linearly degenerate dispersionless integrable PDEs, the corresponding characteristic integrals are parametrised by points on the Veronese variety.     

A weak degeneracy revealing decomposition for the CANDECOMP/PARAFAC model

The CANDECOMP/PARAFAC (CP) model is a well known and frequently used tool for extracting substantial information from a three‐way data array. It has several useful characteristics and usually gives meaningful insights about the underlying structure of the data. However, in some cases it has a ‘strange’ behaviour suffering from the so‐called ‘degenerate solutions’, i.e. solutions where the components show a diverging pattern and are meaningless. Several authors have investigated the causes of degeneracy concluding that the phenomenon is due to a lack of minimum of the loss function. In this paper, we study the degeneracy of CP limiting our attention to the two‐component case. The study is done by introducing a canonical form, called 2DR, which is ‘weakly degeneracy revealing’. On the ground of this framework, degeneracy is studied along with some of the remedies proposed in the literature by using a Tucker3 model having a core in the 2DR form. The analysis gives new insights about the behaviour of the CP model and suggests new ideas on how to deal with degeneracy. Copyright © 2010 John Wiley & Sons, Ltd.     

Bounds on the localization number

We consider the localization game played on graphs, wherein a set of cops attempt to determine the exact location of an invisible robber by exploiting distance probes. The corresponding optimization parameter for a graph G is called the localization number and is written as ζ(G). We settle a conjecture of Bosek et al by providing an upper bound on the chromatic number as a function of the localization number. In particular, we show that every graph with ζ(G) ≤ k has degeneracy less than 3^k and, consequently, satisfies χ(G) ≤ 3^ζ(G). We show further that this degeneracy bound is tight. We also prove that the localization number is at most 2 in outerplanar graphs, and we determine, up to an additive constant, the localization number of hypercubes.     

玻色气体的量子简并性对不可逆布雷顿制冷循环性能的影响

基于不可逆布雷顿制冷循环模型和理想玻色气体的状态方程,导出以玻色气体为工质的布雷顿制冷循环的输入功、制冷系数、制冷量等重要参数的表示式,由此讨论玻色气体的量子简并性和不可逆绝热过程对循环性能的影响,揭示以玻色气体为工质的不可逆布雷顿制冷循环的一般性能特性,从而导出一些重要结论．进而给出几种特殊情况下循环的性能特性．得到的结果有助于进一步了解经典布雷顿制冷循环和量子布雷顿制冷循环之间的区别和联系．     

Quantum Hall ferromagnetism in a two-valley strained Si quantum well

Tilted field magnetotransport study was performed in a two-valley strained Si quantum well and hysteretic diagonal resistance spikes were observed near the coincidence angles. The spike around filling factor ν=3 develops into a giant feature when it moves to the high-field edge of the quantum Hall (QH) state and quenches for higher tilt angles. When the spike is most prominent, its peak resistance is temperature independent from T20 mK up to 0.3 K, which is different from the critical behavior previously reported near the Curie temperature of the QH ferromagnet in AlAs quantum wells. Our data suggest a strong interplay between spins and valleys near the coincidence.     

遗传密码的进化稳定性

本文评述了遗传密码的进化有关的物理问题。主要讨论了 :1 )从进化稳定性的观点研究遗传密码的简并规则 ,证明了现有密码表中多重态的简并规则是突变危险性极小的 ;2 )从进化稳定性的观点研究了遗传密码表中氨基酸和终止密码子的排布 ,导出了总体突变危险性极小的表 ,并证明了标准密码表是在某些约束 (这些约束反映了密码形成时期的初始条件 )下总体突变危险性极小的表 ;3)密码表中 2 0种氨基酸和终止密码简并度的分布 ,以及改变简并度条件下密码反常的出现     

对称双方势阱能级无简并

证明了一维对称有限双方势阱的束缚态能级是不存在简并的。