Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

On a Modified Subgradient Algorithm for Dual Problems via Sharp Augmented Lagrangian*

We study convergence properties of a modified subgradient algorithm, applied to the dual problem defined by the sharp augmented Lagrangian. The primal problem we consider is nonconvex and nondifferentiable, with equality constraints. We obtain primal and dual convergence results, as well as a condition for existence of a dual solution. Using a practical selection of the step-size parameters, we demonstrate the algorithm and its advantages on test problems, including an integer programming and an optimal control problem. *Partially Supported by 2003 UniSA ITEE Small Research Grant Ero2. Supported by CAPES, Brazil, Grant No. 0664-02/2, during her visit to the School of Mathematics and Statistics, UniSA.     

Coverage dependent magnetic properties of Co chain-coated carbon nanotube

Magnetic properties of Co chain-coated carbon nanotube (CNT) were investigated using a first-principles calculation. Binding energy between Co chain and CNT increased with the coverage ratio, and the adsorption of Co chains on CNT enhanced the conductance channel. Total magnetic moment of Co chains coated on CNT increased with the coverage ratio, while the magnetic moment per Co atom decreased due to spin flip of majority spin states in Co atoms. Spin polarization at the Fermi level of the Co chains was calculated to converge to that of bulk fcc Co.     

Difference discrete connection and curvature on cubic lattice Dedicated to Professor Sheng GONG on the occasion of his 75th birthday

In a way similar to the continuous case formally, we define in different but equivalent manners the difference discrete connection and curvature on discrete vector bundle over the regular lattice as base space. We deal with the difference operators as the discrete counterparts of the derivatives based upon the differential calculus on the lattice. One of the definitions can be extended to the case over the random lattice. We also discuss the relation between our approach and the lattice gauge theory and apply to the discrete integrable systems.     

Plasticity field adjacent to faces of asperities on a rotating roll after initial indentation into a half-space

The plastic deformation field near the horizontal surface of a half space of perfectly plastic material associated with an indenting rotating rigid tooth is studied using slip line theory. The tooth is one of many on a roll surface and indents first into the half-space material and then rotates about the roll center. A slip line field is proposed for the deforming plastic region and a solution scheme is outlined. The emphasis is on determining the shape of the deforming region, especially that of the free surface. The study has a potential application in roughness transfer in metal forming processing.     

On Characterizations of Proper Efficiency for Nonconvex Multiobjective Optimization

In this paper, nonconvex multiobjective optimization problems are studied. New characterizations of a properly efficient solution in the sense of Geoffrion's are established in terms of the stability of one scalar optimization problem and the existence of an exact penalty function of a scalar constrained program, respectively. One of the characterizations is applied to derive necessary conditions for a properly efficient control-parameter pair of a nonconvex multiobjective discrete optimal control problem with linear constraints.     

Global Optimization of Stochastic Black-Box Systems via Sequential Kriging Meta-Models

This paper proposes a new method that extends the efficient global optimization to address stochastic black-box systems. The method is based on a kriging meta-model that provides a global prediction of the objective values and a measure of prediction uncertainty at every point. The criterion for the infill sample selection is an augmented expected improvement function with desirable properties for stochastic responses. The method is empirically compared with the revised simplex search, the simultaneous perturbation stochastic approximation, and the DIRECT methods using six test problems from the literature. An application case study on an inventory system is also documented. The results suggest that the proposed method has excellent consistency and efficiency in finding global optimal solutions, and is particularly useful for expensive systems.     

Comparison of the boundary theory with the contact rule of phase regions and Gupta’s method

The phase boundary theory and the contact rule of phase regions are compared, and some weaknesses of the latter are manifested. The comparison between the Gupta’s method and the boundary theory method for constructing multicomponent isobaric sections is also presented.     

Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.     

Pulsed laser deposition of nanostructured Ag films

Ultra-thin (0.5-5 nm) films of Ag have been prepared by pulsed laser deposition in vacuum using a 26 ns KrF excimer laser at 1 J cm⁻². The deposition was controlled using a Langmuir ion probe and a quartz crystal thickness monitor. Transmission electron microscopy showed that the films are not continuous, but are structured on nanometer size scales. Optical absorption spectra showed the expected surface plasmon resonance feature, which shifted to longer wavelength and increased in strength as the equivalent film thickness was increased. It is shown that Maxwell Garnett effective medium theory can be used to calculate the main features of optical absorption spectra.