Non-asymptotic confidence bounds for the optimal value of a stochastic program

We discuss a general approach to building non-asymptotic confidence bounds for stochastic optimization problems. Our principal contribution is the observation that a Sample Average Approximation of a problem supplies upper and lower bounds for the optimal value of the problem which are essentially better than the quality of the corresponding optimal solutions. At the same time, such bounds are more reliable than “standard” confidence bounds obtained through the asymptotic approach. We also discuss bounding the optimal value of MinMax Stochastic Optimization and stochastically constrained problems. We conclude with a small simulation study illustrating the numerical behavior of the proposed bounds.

Numerical simulation of magnetic field enhanced plasma immersion ion implantation

The behavior of plasma and sheath characteristics under the action of an applied magnetic field is important in many applications including plasma probes and material processing. Plasma immersion ion implantation (PIII) has been developed as a fast and efficient surface modification technique of complex shaped three-dimensional objects. The PIII process relies on the acceleration of ions across a high-voltage plasma sheath that develops around the target. Recent studies have shown that the sheath dynamics is significantly affected by an external magnetic field. In this work we describe a two-dimensional computer simulation of magnetic field enhanced plasma immersion implantation system. Negative bias voltage is applied to a cylindrical target located on the axis of a grounded cylindrical vacuum chamber filled with uniform nitrogen plasma. An axial magnetic field is created by a solenoid installed inside the cylindrical target. The computer code employs the Monte Carlo method for collision of electrons and neutrals in the plasma and a particle-in-cell (PIC) algorithm for simulating the movement of charged particles in the electromagnetic field. Secondary electron emission from the target subjected to ion bombardment is also included. It is found that a high-density plasma region is formed around the cylindrical target due to the intense background gas ionization by the magnetized electrons drifting in the crossed ExB fields. An increase of implantation current density in front of high density plasma region is observed. (C) 2007 Elsevier B.V. All rights reserved.

LMI-based algorithm for strictly positive real systems with static output feedback

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

An effortless hybrid method to solve economic load dispatch problem in power systems

This paper proposes a new approach and coding scheme for solving economic dispatch problems (ED) in power systems through an effortless hybrid method (EHM). This novel coding scheme can effectively prevent futile searching and also prevents obtaining infeasible solutions through the application of stochastic search methods, consequently dramatically improves search efficiency and solution quality. The dominant constraint of an economic dispatch problem is power balance. The operational constraints, such as generation limitations, ramp rate limits, prohibited operating zones (POZ), network loss are considered for practical operation. Firstly, in the EHM procedure, the output of generator is obtained with a lambda iteration method and without considering POZ and later in a genetic based algorithm this constraint is satisfied. To demonstrate its efficiency, feasibility and fastness, the EHM algorithm was applied to solve constrained ED problems of power systems with 6 and 15 units. The simulation results obtained from the EHM were compared to those achieved from previous literature in terms of solution quality and computational efficiency. Results reveal that the superiority of this method in both aspects of financial and CPU time. (C) 2011 Elsevier Ltd. All rights reserved.

Efficient robust optimization based on polynomial chaos and tabu search algorithm

The study of robust design methodologies and techniques has become a new topical area in design optimizations in nearly all engineering and applied science disciplines in the last 10 years due to inevitable and unavoidable imprecision or uncertainty which is existed in real word design problems. To develop a fast optimizer for robust designs, a methodology based on polynomial chaos and tabu search algorithm is proposed. In the methodology, the polynomial chaos is employed as a stochastic response surface model of the objective function to efficiently evaluate the robust performance parameter while a mechanism to assign expected fitness only to promising solutions is introduced in tabu search algorithm to minimize the requirement for determining robust metrics of intermediate solutions. The proposed methodology is applied to the robust design of a practical inverse problem with satisfactory results.

Langevin simulation of scalar fields: Additive and multiplicative noises and lattice renormalization

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Numerical simulation of Ginzburg-Landau-Langevin equations

This work is concerned with non-equilibrium phenomena, with focus on the numerical simulation of the relaxation of non-conserved order parameters described by stochastic kinetic equations known as Ginzburg-Landau-Langevin (GLL) equations. We propose methods for solving numerically these type of equations, with additive and multiplicative noises. Illustrative applications of the methods are presented for different GLL equations, with emphasis on equations incorporating memory effects.

Estimation of population profiles of two strains of the fly Megaselia scalaris (Diptera: Phoridae) by bootstrap simulation

A partir de perfis populacionais experimentais de linhagens do díptero forídeo Megaselia scalaris, foi determinado o número mínimo de perfis amostrais que devem ser repetidos, via processo de simulação bootstrap, para se ter uma estimativa confiável do perfil médio populacional e apresentar estimativas do erro-padrão como medida da precisão das simulações realizadas. Os dados originais são provenientes de populações experimentais fundadas com as linhagens SR e R4, com três réplicas cada, e que foram mantidas por 33 semanas pela técnica da transferência seriada em câmara de temperatura constante (25 ± 1,0ºC). A variável usada foi tamanho populacional e o modelo adotado para cada perfíl foi o de um processo estocástico estacionário. Por meio das simulações, os perfis de três populações experimentais foram amplificados, determinando-se, dessa forma, o tamanho mínimo de amostra. Fixado o tamanho de amostra, simulações bootstrap foram realizadas para construção de intervalos de confiança e comparação dos perfis médios populacionais das duas linhagens. Os resultados mostram que com o tamanho de amostra igual a 50 inicia-se o processo de estabilização dos valores médios.

Numerical simulation of magnetic-field-enhanced plasma immersion ion implantation in cylindrical geometry

Recent studies have demonstrated that the sheath dynamics in plasma immersion ion implantation (PIII) is significantly affected by an external magnetic field. In this paper, a two-dimensional computer simulation of a magnetic-field-enhanced PHI system is described. Negative bias voltage is applied to a cylindrical target located on the axis of a grounded vacuum chamber filled with uniform molecular nitrogen plasma. A static magnetic field is created by a small coil installed inside the target holder. The vacuum chamber is filled with background nitrogen gas to form a plasma in which collisions of electrons and neutrals are simulated by the Monte Carlo algorithm. It is found that a high-density plasma is formed around the target due to the intense background gas ionization by the magnetized electrons drifting in the crossed E x B fields. The effect of the magnetic field intensity, the target bias, and the gas pressure on the sheath dynamics and implantation current of the PHI system is investigated.

Robust Bayesian analysis of heavy-tailed stochastic volatility models using scale mixtures of normal distributions

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

An implementation of modified scatter search algorithm to transmission expansion planning

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

Another prefiltering algorithm for adaptive IIR filtering

An algorithm for adaptive IIR filtering that uses prefiltering structure in direct form is presented. This structure has an estimation error that is a linear function of the coefficients. This property greatly simplifies the derivation of gradient-based algorithms. Computer simulations show that the proposed structure improves convergence speed.

Reconfiguration of distribution systems by a modified genetic algorithm

In this paper a genetic algorithm based reconfiguration method is proposed to minimize the real power losses of distribution systems. The main innovation of this research work is that new types of crossover and mutation operators are proposed, such that the best possible results are obtained, with an acceptable computational effort. The crossover and mutation operators were developed so as to take advantage of the particular characteristics of distribution systems (as the radial topology). Simulation results indicate that the proposed method is very efficient, being able to find excellent configurations, with low computational effort, especially for larger systems. ©2007 IEEE.

Evolutionary heuristic to determine future land use

In the spatial electric load forecasting, the future land use determination is one of the most important tasks, and one of the most difficult, because of the stochastic nature of the city growth. This paper proposes a fast and efficient algorithm to find out the future land use for the vacant land in the utility service area, using ideas from knowledge extraction and evolutionary algorithms. The methodology was implemented into a full simulation software for spatial electric load forecasting, showing a high rate of success when the results are compared to information gathered from specialists. The importance of this methodology lies in the reduced set of data needed to perform the task and the simplicity for implementation, which is a great plus for most of the electric utilities without specialized tools for this planning activity. © 2008 IEEE.

An application of a modified constructive heuristic algorithm to transmission expansion planning

Transmission expansion planning (TEP) is a non-convex optimization problem that can be solved via different heuristic algorithms. A variety of classical as well as heuristic algorithms in literature are addressed to solve TEP problem. In this paper a modified constructive heuristic algorithm (CHA) is proposed for solving such a crucial problem. Most of research papers handle TEP problem by linearization of the non-linear mathematical model while in this research TEP problem is solved via CHA using non-linear model. The proposed methodology is based upon Garver's algorithm capable of applying to a DC model. Simulation studies and tests results on the well known transmission network such as: Garver and IEEE 24-bus systems are carried out to show the significant performance as well as the effectiveness of the proposed algorithm. © 2011 IEEE.