A Z/2 Descent Theorem for the Algebraic K-Theory of a Semisimple Real Algebra

On algebraic K-theory of a finite-dimensional semisimple real algebra the involution induced by an antistructure is studied. After Bousfield–Kan completion at 2, a component of the homotopy fixed point set is homotopy-equivalent to the fixed point set. The fixed point set is calculated.     

Weak Pareto optimality of multiobjective problems in a locally convex linear topological space

Several corrections to Ref. 1 are pointed out.     

Partial convexity

We consider a generalization of the classical notion of convexity, which is calledpartial convexity. LetV ∋ ℝ ⁿ be some set of directions. A setX ∋ ℝ ⁿ is calledV- convex if the intersection of any line parallel to a vector inV withX is connected. Semispaces and the problem of the least intersection base for partial convexity is investigated. The cone of convexity directions is described for a closed set in ℝ ⁿ . Translated fromMatematicheskie Zametki, Vol. 60, No. 3, pp. 406–413, September, 1996. The authors wish to express their gratitude to V. V. Gorokhovik and E. A. Barabanov for useful remarks and discussions. This research was supported in part by the Belorussian Foundation for Basic Research under grant No. F95-016.     

k元de Bruijn-Good图的1-因子图与分配多面体图

本文首先修正了文献[2]中的定义1.2,然后给出了由κ元(?)级 de Bruijn-Good图的1-因子构成的变换图的结构,得到了它与分配多面体图(graph of assign-ment polytope)的关系,从而得知它具有一些好的性质.     

Multilevel parametrization for aerodynamical optimization of 3D shapes

We introduce and discuss a combination of methods and options that aim at the aerodynamical optimization of a flow around an arbitrary aircraft shape. The flow is governed by the Euler equations, discretized by a mixed element-volume method on a fixed unstructured tetrahedrization. The shape parametrization relies on the skin of the above mesh through a hierarchical representation. Descent-type and one-shot algorithms are devised and adapted to the solution of a few model problems.     

A comparison of local search methods for flow shop scheduling

Local search techniques are widely used to obtain approximate solutions to a variety of combinatorial optimization problems. Two important categories of local search methods are neighbourhood search and genetic algorithms. Commonly used neighbourhood search methods include descent, threshold accepting, simulated annealing and tabu search. In this paper, we present a computational study that compares these four neighbourhood search methods, a genetic algorithm, and a hybrid method in which descent is incorporated into the genetic algorithm. The performance of these six local search methods is evaluated on the problem of scheduling jobs in a permutation flow shop to minimize the total weighted completion time. Based on the results of extensive computational tests, simulated annealing is found to generate better quality solutions than the other neighborhood search methods. However, the results also indicate that the hybrid genetic descent algorithm is superior to simulated annealing.     

A rank-one algorithm for unconstrained function minimization

A rank-one algorithm is presented for unconstrained function minimization. The algorithm is a modified version of Davidon's variance algorithm and incorporates a limited line search. It is shown that the algorithm is a descent algorithm; for quadratic forms, it exhibits finite convergence, in certain cases. Numerical studies indicate that it is considerably superior to both the Davidon-Fletcher-Powell algorithm and the conjugate-gradient algorithm.