Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems

Most existing interior-point methods for a linear complementarity problem (LCP) require the existence of a strictly feasible point to guarantee that the iterates are bounded. Based on a regularized central path, we present an infeasible interior-point algorithm for LCPs without requiring the strict feasibility condition. The iterates generated by the algorithm are bounded when the problem is a P _* LCP and has a solution. Moreover, when the problem is a monotone LCP and has a solution, we prove that the convergence rate is globally linear and it achieves `-feasibility and `-complementarity in at most O(n ² ln(1/`)) iterations with a properly chosen starting point.     

Decomposition Rank of Subhomogeneous C*-Algebras

We analyze the decomposition rank (a notion of covering dimensionfor nuclear C*-algebras introduced by E. Kirchberg and the author)of subhomogeneous C*-algebras. In particular, we show that asubhomogeneous C*-algebra has decomposition rank n if and onlyif it is recursive subhomogeneous of topological dimension n,and that n is determined by the primitive ideal space. As an application, we use recent results of Q. Lin and N. C.Phillips to show the following. Let A be the crossed productC*-algebra coming from a compact smooth manifold and a minimaldiffeomorphism. Then the decomposition rank of A is dominatedby the covering dimension of the underlying manifold. 2000 MathematicsSubject Classification 46L85, 46L35.     

Almost flat locally finite coverings of the sphere

For any subset A of the unit sphere of a Banach space X and for [0,2) the notion of -flatness is introduced as a measure of non-flatness of A. For any positive , construction of locally finite tilings of the unit sphere by -flat sets is carried out under suitable -renormings of X in a quite general context; moreover, a characterization of spaces having separable dual is provided in terms of the existence of such tilings. Finally, relationships between the possibility of getting such tilings of the unit sphere in the given norm and smoothness properties of the norm are discussed.     

On asymmetric coverings and covering numbers

An asymmetric covering is a collection of special subsets S of an n‐set such that every subset T of the n‐set is contained in at least one special S with . In this paper we compute the smallest size of any for We also investigate “continuous” and “banded” versions of the problem. The latter involves the classical covering numbers , and we determine the following new values: , , , , and . We also find the number of non‐isomorphic minimal covering designs in several cases. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 218–228, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10022     

Equitable resolvable coverings

In an earlier article, Willem H. Haemers has determined the minimum number of parallel classes in a resolvable 2‐(qk,k,1) covering for all k ≥ 2 and q = 2 or 3. Here, we complete the case q = 4, by construction of the desired coverings using the method of simulated annealing. Secondly, we look at equitable resolvable 2‐(qk,k,1) coverings. These are resolvable coverings which have the additional property that every pair of points is covered at most twice. We show that these coverings satisfy k < 2q ? , and we give several examples. In one of these examples, k > q. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 113–123, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10024     

Controlled Wild Algebras

The controlled wild algebra is introduced, a covering criterionfor a finite-dimensional algebra to be controlled wild is given,and this criterion is applied to the algebras with radical squarezero, algebras with zero relations, local algebras and finitep-group algebras. 2000 Mathematical Subject Classification:16G20, 16G60.     

On Logarithmic Smoothing of the Maximum Function

We consider the maximum function f resulting from a finite number of smooth functions. The logarithmic barrier function of the epigraph of f gives rise to a smooth approximation g of f itself, where >0 denotes the approximation parameter. The one-parametric family g converges – relative to a compact subset – uniformly to the function f as tends to zero. Under nondegeneracy assumptions we show that the stationary points of g and f correspond to each other, and that their respective Morse indices coincide. The latter correspondence is obtained by establishing smooth curves x() of stationary points for g , where each x() converges to the corresponding stationary point of f as tends to zero. In case of a strongly unique local minimizer, we show that the nondegeneracy assumption may be relaxed in order to obtain a smooth curve x().     

Compactifying sufficiently regular covering spaces of compact 3-manifolds

In this paper it is proven that if the group of covering translations of the covering space of a compact, connected, -irreducible 3-manifold corresponding to a non-trivial, finitely-generated subgroup of its fundamental group is infinite, then either the covering space is almost compact or the subgroup is infinite cyclic and has normalizer a non-finitely-generated subgroup of the rational numbers. In the first case additional information is obtained which is then used to relate Thurston's hyperbolization and virtual bundle conjectures to some algebraic conjectures about certain 3-manifold groups.     

Are covering (enveloping) morphisms minimal?

We prove that for certain classes of modules such that direct sums of -covers ( -envelopes) are -covers ( -envelopes), -covering ( -enveloping) homomorphisms are always right (left) minimal. As a particular case we see that over noetherian rings, essential monomorphisms are left minimal. The same type of results are given when direct products of -covers are -covers. Finally we prove that over commutative noetherian rings, any direct product of flat covers of modules of finite length is a flat cover.     

平衡炮实验弹丸膛内过载计算模型及应用

 针对平衡炮的具体结构特点，为了精确计算弹丸膛内过载变化过程，利用经典内弹道法对某口径的平衡炮进行了仿真计算，得出了内弹道诸元随时间的变化曲线，再根据膛压与过载的关系，推导出了过载随时间变化的曲线图，理论计算与实验结果相吻合，该计算方法可为此类火炮的内弹道参数评估和弹丸设计提供依据。