On the choice of parameters for the weighting method in vector optimization

We present a geometrical interpretation of the weighting method for constrained (finite dimensional) vector optimization. This approach is based on rigid movements which separate the image set from the negative of the ordering cone. We study conditions on the existence of such translations in terms of the boundedness of the scalar problems produced by the weighting method. Finally, using recession cones, we obtain the main result of our work: a sufficient condition under which weighting vectors yield solvable scalar problems. An erratum to this article can be found at     

Dynamic optimization of chemical cleaning in dead-end ultra filtration

In this paper a control strategy is formulated that minimizes the costs for a single chemical cleaning of a dead-end ultra filtration membrane. From the process model, the performance index and the constraints it can be derived that dynamic optimization will lead to a ‘maximum effort control problem’, in which the controls (cleaning flow and cleaning agent concentration) are either zero or maximum. The change from maximum to zero is called the switching point. This switching point depends on the overall cleaning time and the requested cleaning effectiveness. From the calculated optimal control strategy it follows that cleaning time can be significantly reduced, compared to conventional cleaning.     

Interpretation of IR spectra of the N-acethyl-4-dimethylaminopyridinium salts

In a harmonic approximation we calculate the frequencies of normal vibrations and their modes for a salt cation of N-acethyl-4-dimethylaminopyridinium hexachlorstibiate and of its three deuteroderivatives obtained on deuteration over a CH₃-group, over a ring, and over a ring and a CH₃-group. From the results of calculation, an interpretation of the IR spectra of the salts considered is carried out. To whom correspondences should be addressed. L. M. Litvinenko Institute of Physical and Organic Chemistry and the Chemistry of Coal, National Academy of Sciences of Ukraine, 70, R. Luxemburg Str., Donetsk, 340114, Ukraine. Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 66, No. 2, pp. 158–162, March–April, 1999.     

Generalized (<Emphasis Type="Italic">F</Emphasis>,<Emphasis Type="Italic">ρ</Emphasis>)-Convexity and Duality in Nonsmooth Problems of Multiobjective Optimization

A mixed-type dual for a nonsmooth multiobjective optimization problem with inequality and equality constraints is formulated. We obtain weak and strong duality theorems for a mixed-type dual without requiring the regularity assumptions and the nonnegativeness of the Lagrange multipliers associated to the equality constraints. We apply also a nonsmooth constraint qualification for multiobjective programming to establish strong duality results. In this case, our constraint qualification assures the existence of positive Lagrange multipliers associated with the vector-valued objective function. This work was supported by Center of Excellence for Mathematics, University of Isfahan, Isfahan, Iran.     

Shape optimization for Stokes flow

This paper is concerned with a shape sensitivity analysis of a viscous incompressible fluid driven by Stokes equations. The structures of continuous shape gradients with respect to the shape of the variable domain for some given cost functionals are established by introducing the Piola transformation and then deriving the state derivative and its associated adjoint state. Finally we give the finite element approximation of the problem and a gradient type algorithm is effectively used for our problem.     

Solving the pallet loading problem

This paper presents new bounds, heuristics, and an exact algorithm for the Pallet Loading Problem (PLP). PLP maximizes the number of boxes placed on a rectangular pallet. All boxes have identical rectangular dimensions and, when placed, must be located completely within the pallet. Boxes may be rotated 90° so long as they are placed with edges parallel to the pallet’s edges. The set of all PLP instances with an area ratio (pallet area divided by box area) less than 101 boxes can be represented by 3,080,730 equivalent classes. Our G5-heuristic finds optimal solutions to 3,073,724 of these 3,080,730 classes and in the remaining 7006 classes only differs from the best known bound by one box. We develop three other heuristics that solve another 54 instances. Finally, we solve the 6952 remaining classes with our exact HVZ algorithm. Only a subset of these classes has been solved previously.     

Shape reconstruction of an inverse boundary value problem of two‐dimensional Navier–Stokes equations

This paper is concerned with the problem of the shape reconstruction of two‐dimensional flows governed by the Navier–Stokes equations. Our objective is to derive a regularized Gauss–Newton method using the corresponding operator equation in which the unknown is the geometric domain. The theoretical foundation for the Gauss–Newton method is given by establishing the differentiability of the initial boundary value problem with respect to the boundary curve in the sense of a domain derivative. The numerical examples show that our theory is useful for practical purpose and the proposed algorithm is feasible. Copyright © 2009 John Wiley & Sons, Ltd.     

Implementing pure adaptive search for global optimization using Markov chain sampling

The Pure Adaptive Search (PAS) algorithm for global optimization yields a sequence of points, each of which is uniformly distributed in the level set corresponding to its predecessor. This algorithm has the highly desirable property of solving a large class of global optimization problems using a number of iterations that increases at most linearly in the dimension of the problem. Unfortunately, PAS has remained of mostly theoretical interest due to the difficulty of generating, in each iteration, a point uniformly distributed in the improving feasible region. In this article, we derive a coupling equivalence between generating an approximately uniformly distributed point using Markov chain sampling, and generating an exactly uniformly distributed point with a certain probability. This result is used to characterize the complexity of a PAS-implementation as a function of (a) the number of iterations required by PAS to achieve a certain solution quality guarantee, and (b) the complexity of the sampling algorithm used. As an application, we use this equivalence to show that PAS, using the so-called Random ball walk Markov chain sampling method for generating nearly uniform points in a convex region, can be used to solve most convex programming problems in polynomial time.     

Parallel bucket sorting on graphics processing units based on convex optimization

We found an interesting relation between convex optimization and sorting problem. We present a parallel algorithm to compute multiple order statistics of the data by minimizing a number of related convex functions. The computed order statistics serve as splitters that group the data into buckets suitable for parallel bitonic sorting. This led us to a parallel bucket sort algorithm, which we implemented for many-core architecture of graphics processing units (GPUs). The proposed sorting method is competitive to the state-of-the-art GPU sorting algorithms and is superior to most of them for long sorting keys.     

餐盒用新型非发泡聚丙烯光降解性能红外光谱法检测

用红外光谱法测试研究了餐盒用新型非发泡聚丙烯光降解行为。结果表明，降解母粒含量不同，其红外吸收光谱图存在明显的差异；在光降解过程中，羰基指数存在明显的动态变化。