Continuous GRASP with a local active-set method for bound-constrained global optimization

Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a hybrid heuristic-based on the CGRASP and GENCAN methods-for finding approximate solutions for continuous global optimization problems subject to box constraints. Experimental results illustrate the relative effectiveness of CGRASP-GENCAN on a set of benchmark multimodal test functions.

Outer Trust-Region Method for Constrained Optimization

Given an algorithm A for solving some mathematical problem based on the iterative solution of simpler subproblems, an outer trust-region (OTR) modification of A is the result of adding a trust-region constraint to each subproblem. The trust-region size is adaptively updated according to the behavior of crucial variables. The new subproblems should not be more complex than the original ones, and the convergence properties of the OTR algorithm should be the same as those of Algorithm A. In the present work, the OTR approach is exploited in connection with the ""greediness phenomenon"" of nonlinear programming. Convergence results for an OTR version of an augmented Lagrangian method for nonconvex constrained optimization are proved, and numerical experiments are presented.

Efficient solutions to robust, semi-implicit discretizations of the immersed boundary method

The immersed boundary method is a versatile tool for the investigation of flow-structure interaction. In a large number of applications, the immersed boundaries or structures are very stiff and strong tangential forces on these interfaces induce a well-known, severe time-step restriction for explicit discretizations. This excessive stability constraint can be removed with fully implicit or suitable semi-implicit schemes but at a seemingly prohibitive computational cost. While economical alternatives have been proposed recently for some special cases, there is a practical need for a computationally efficient approach that can be applied more broadly. In this context, we revisit a robust semi-implicit discretization introduced by Peskin in the late 1970s which has received renewed attention recently. This discretization, in which the spreading and interpolation operators are lagged. leads to a linear system of equations for the inter-face configuration at the future time, when the interfacial force is linear. However, this linear system is large and dense and thus it is challenging to streamline its solution. Moreover, while the same linear system or one of similar structure could potentially be used in Newton-type iterations, nonlinear and highly stiff immersed structures pose additional challenges to iterative methods. In this work, we address these problems and propose cost-effective computational strategies for solving Peskin`s lagged-operators type of discretization. We do this by first constructing a sufficiently accurate approximation to the system`s matrix and we obtain a rigorous estimate for this approximation. This matrix is expeditiously computed by using a combination of pre-calculated values and interpolation. The availability of a matrix allows for more efficient matrix-vector products and facilitates the design of effective iterative schemes. We propose efficient iterative approaches to deal with both linear and nonlinear interfacial forces and simple or complex immersed structures with tethered or untethered points. One of these iterative approaches employs a splitting in which we first solve a linear problem for the interfacial force and then we use a nonlinear iteration to find the interface configuration corresponding to this force. We demonstrate that the proposed approach is several orders of magnitude more efficient than the standard explicit method. In addition to considering the standard elliptical drop test case, we show both the robustness and efficacy of the proposed methodology with a 2D model of a heart valve. (C) 2009 Elsevier Inc. All rights reserved.

On Approximate KKT Condition and its Extension to Continuous Variational Inequalities

In this work, we introduce a necessary sequential Approximate-Karush-Kuhn-Tucker (AKKT) condition for a point to be a solution of a continuous variational inequality, and we prove its relation with the Approximate Gradient Projection condition (AGP) of Garciga-Otero and Svaiter. We also prove that a slight variation of the AKKT condition is sufficient for a convex problem, either for variational inequalities or optimization. Sequential necessary conditions are more suitable to iterative methods than usual punctual conditions relying on constraint qualifications. The AKKT property holds at a solution independently of the fulfillment of a constraint qualification, but when a weak one holds, we can guarantee the validity of the KKT conditions.

EVALUATION OF METAL TOXICITY BY A MODIFIED METHOD BASED ON THE FUNGUS GERRONEMA VIRIDILUCENS BIOLUMINESCENCE IN AGAR MEDIUM

Metal cation toxicity to basidiomycete fungi is poorly understood, despite its well-known importance in terrestrial ecosystems. Moreover, there is no reported methodology for the routine evaluation of metal toxicity to basidiomycetes. In the present study, we describe the development of a procedure to assess the acute toxicity of metal cations (Na(+), K(+), Li(+), Ca(2+), Mg(2+), Co(2+), Zn(2+), Ni(2+), Mn(2+), Cd(2+), and Cu(2+)) to the bioluminescent basidiomycete fungus Gerronema viridilucens. The method is based on the decrease in the intensity of bioluminescence resulting from injuries sustained by the fungus mycelium exposed to either essential or nonessential metal toxicants. The assay described herein enables LIS to propose a metal toxicity series to Gerronenia viridilucens based on data obtained from the bioluminescence intensity (median effective concentration [EC50] values) versus metal concentration: Cd(2+) > Cu(2+) > Mn(2+) approximate to Ni(2+) approximate to Co(2+) > Zn(2+) > Mg(2+) > Li(+) > K(+) approximate to Na(+) > Ca(2+), and to shed some li-ht on the mechanism of toxic action of metal cations to basidiomycete fungi. Environ. Toxicol. Chem. 2010;29:320-326. (C) 2009 SETAC

Computational study of the step size parameter of the subgradient optimization method

The subgradient optimization method is a simple and flexible linear programming iterative algorithm. It is much simpler than Newton's method and can be applied to a wider variety of problems. It also converges when the objective function is non-differentiable. Since an efficient algorithm will not only produce a good solution but also take less computing time, we always prefer a simpler algorithm with high quality. In this study a series of step size parameters in the subgradient equation is studied. The performance is compared for a general piecewise function and a specific p-median problem. We examine how the quality of solution changes by setting five forms of step size parameter.

Predictor-Corrector Primal-Dual Interior Point Method for Solving Economic Dispatch Problems: A Postoptimization Analysis

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Enhanced ferroelectric properties of La-substituted BiFeO3 thin films on LaSrCoO3/Pt/TiO2/SiO2/Si (100) substrates prepared by the soft chemical method

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

On an approximate analytical solution to a nonlinear vibrating problem, excited by a nonideal motor

This paper analyzes through Multiple Scales Method a response of a simplified nonideal and nonlinear vibrating system. Here, one verifies the interactions between the dynamics of the DC motor (excitation) and the dynamics of the foundation (spring, damper, and mass). We remarked that we consider cubic nonlinearity (spring) and quadratic nonlinearity (DC motor) of the same order of magnitude according to experimental results. Both analytical and numerical results that we have obtained had good agreement.

ACCELERATING ITERATIVE ALGORITHMS FOR SYMMETRICAL LINEAR COMPLEMENTARITY-PROBLEMS

We propose a method for accelerating iterative algorithms for solving symmetric linear complementarity problems. The method consists in performing a one-dimensional optimization in the direction generated by a splitting method even for non-descent directions. We give strong convergence proofs and present numerical experiments that justify using this acceleration.

Ba1-xSrxTiO3 thin films by polymeric precursor method

Stoichiometric Ba1-xSrxTiO3 (BST; x = 0.4) thin films were prepared by the polymeric precursor method. High quality polycrystalline films of BST with low roughness (approximate to 3 nm) were obtained from a Pt/Ti/SiO2/Si substrate deposited by spin-coating technique. Microstructure and morphological evaluation were done using grazing incident X-ray diffraction (GIXRD), scanning electron microscopy (SEM), and atomic force microscopy (AFM). Grazing incident angle XRD characterization of these films showed that BST phase crystallizes at 600 degrees C from an inorganic amorphous matrix. No intermediate crystalline phase was identified. A linear relationship between roughness and grain size was observed. (C) 2000 Elsevier B.V. B.V. All rights reserved.

Fourth-order method for solving the Navier-Stokes equations in a constricting channel

A fourth-order numerical method for solving the Navier-Stokes equations in streamfunction/vorticity formulation on a two-dimensional non-uniform orthogonal grid has been tested on the fluid flow in a constricted symmetric channel. The family of grids is generated algebraically using a conformal transformation followed by a non-uniform stretching of the mesh cells in which the shape of the channel boundary can vary from a smooth constriction to one which one possesses a very sharp but smooth corner. The generality of the grids allows the use of long channels upstream and downstream as well as having a refined grid near the sharp corner. Derivatives in the governing equations are replaced by fourth-order central differences and the vorticity is eliminated, either before or after the discretization, to form a wide difference molecule for the streamfunction. Extra boundary conditions, necessary for wide-molecule methods, are supplied by a procedure proposed by Henshaw et al. The ensuing set of non-linear equations is solved using Newton iteration. Results have been obtained for Reynolds numbers up to 250 for three constrictions, the first being smooth, the second having a moderately sharp corner and the third with a very sharp corner. Estimates of the error incurred show that the results are very accurate and substantially better than those of the corresponding second-order method. The observed order of the method has been shown to be close to four, demonstrating that the method is genuinely fourth-order. © 1977 John Wiley & Sons, Ltd.

Approximate solution for non-Darcy transient film condensation in a porous medium

The problem of non-darcian transient film condensation adjacent to a vertical flat plate embedded in a porous medium has been considered. The governing equation for the boundary layer thickness was obtained by an integral method and solved approximately by the method of integral relations. It is shown that the results are in good agreement with those obtained exactly by the method of characteristics.

Approximate solution for non-darcy transient film condensation in a porous medium

The problem of non-darcian transient film condensation adjacent to a vertical flat plate embedded in a porous medium has been considered. The governing equation for the boundary layer thickness was obtained by an integral method and solved approximately by the method of integral relations. It is shown that the results are in good agreement with those obtained exactly by the method of characteristics.

Electroosmotic pumping in rectangular microchannels: A numerical treatment by the finite element method

In this work, the analysis of electroosmotic pumping mechanisms in microchannels is performed through the solution of Poisson-Boltzmann and Navier Stokes equations by the Finite Element Method. This approach is combined with a Newton-Raphson iterative scheme, allowing a full treatment of the non-linear Poisson-Boltzmann source term which is normally approximated by linearizations in other methods.