Continuity of the Solution Map in Parametric Affine Variational Inequalities

A systematic study of the upper semicontinuity and the lower semicontinuity of the solution map in parametric affine variational inequalities is given in this paper. Several examples are constructed to analyze the results. This work was supported by Korea Research Foundation Grant (KRF 2001-015-DP0049), the APEC Postdoctoral Fellowships Program, and the KOSEF Brain Pool Program.     

Idempotency of Extensions via the Bicompletion

Let Top ₀ be the category of topological T ₀-spaces, QU ₀ the category of quasi-uniform T ₀-spaces, T : QU ₀ → Top ₀ the usual forgetful functor and K : QU ₀ → QU ₀ the bicompletion reflector with unit k : 1 → K. Any T-section F : Top ₀ → QU ₀ is called K-true if KF = FTKF, and upper (lower) K-true if KF is finer (coarser) than FTKF. The literature considers important T-sections F that enjoy all three, or just one, or none of these properties. It is known that T(K,k)F is well-pointed if and only if F is upper K-true. We prove the surprising fact that T(K,k)F is the reflection to Fix(TkF) whenever it is idempotent. We also prove a new characterization of upper K-trueness. We construct examples to set apart some natural cases. In particular we present an upper K-true F for which T(K,k)F is not idempotent, and a K-true F for which the coarsest associated T-preserving coreflector in QU ₀ is not stable under K. We dedicate this paper to the memory of Sérgio de Ornelas Salbany (1941–2005).     

Systems of generalized quasivariational inclusions problems with applications to variational analysis and optimization problems

In this paper, we study an existence theorem of systems of generalized quasivariational inclusions problem. By this result, we establish the existence theorems of solutions of systems of generalized equations, systems of generalized vector quasiequilibrium problem, collective variational fixed point, systems of generalized quasiloose saddle point, systems of minimax theorem, mathematical program with systems of variational inclusions constraints, mathematical program with systems of equilibrium constraints and systems of bilevel problem and semi-infinite problem with systems of equilibrium problem constraints. This research was supported by the National Science Council of the Republic of China.     

Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms

We investigate subdivision strategies that can improve the convergence and efficiency of some branch and bound algorithms of global optimization. In particular, a general class of so called weakly exhaustive simplicial subdivision processes is introduced that subsumes all previously known radial exhaustive processes. This result provides the basis for constructing flexible subdivision strategies that can be adapted to take advantage of various problem conditions.     

火工品可靠性试验数据的综合分析方法

升降法试验数据和固定刺激量下的成败型试验数据,是两种最常见的火工品可靠性试验数据．我们应用Markov链,研究了升降法试验数据下,感度分布参数的极大似然估计的特性．在此基础上,应用Bootstrap方法和Bayes方法,给出了综合分析两种试验数据的方法．最后,将该方法应用于520底火的可靠性鉴定,得出了有益的结论．     

Convergence Rate of The Trust Region Method for Nonlinear Equations Under Local Error Bound Condition

In this paper, we present the new trust region method for nonlinear equations with the trust region converging to zero. The new method preserves the global convergence of the traditional trust region methods in which the trust region radius will be larger than a positive constant. We study the convergence rate of the new method under the local error bound condition which is weaker than the nonsingularity. An example given by Y.X. Yuan shows that the convergence rate can not be quadratic. Finally, some numerical results are given. This work is supported by Chinese NSFC grants 10401023 and 10371076, Research Grants for Young Teachers of Shanghai Jiao Tong University, and E-Institute of Computational Sciences of Shanghai Universities. An erratum to this article is available at .     

Packing into the smallest square: Worst-case analysis of lower bounds

We address the problem of packing a given set of rectangles into the minimum size square. We consider three versions of the problem, arising when the rectangles (i) are squares; (ii) have a fixed orientation; (iii) can be rotated by 90. For each case we study lower bounds, and analyze their worst-case performance ratio. In addition, we evaluate through computational experiments their average performance on instances from the literature.     

Degree distribution of the greatest common divisor of polynomials over 𝔽q

We study the degree distribution of the greatest common divisor of two or more random polynomials over a finite field ??_q. We provide estimates for several parameters like number of distinct common irreducible factors, number of irreducible factors counting repetitions, and total degree of the gcd of two or more polynomials. We show that the limiting distribution of a random variable counting the total degree of the gcd is geometric and that the distributions of random variables counting the number of common factors (with and without repetitions) are very close to Poisson distributions when q is large. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

大规模界约束优化的子空间截断牛顿法

给出了大规模界约束优化的一个子空间截断牛顿法。利用截断牛顿法修正非有效约束所对应的变量，用投影梯度法修正有效约束所对应的变量，文中证明了方法的整体收敛性，并对方法进行了数值试验，且与子空间有限内存拟牛顿法进行了数值比较。