Triangulation by Continuous Embedding

When triangulating a belief network we aim to obtain a junction tree of minimum state space. Searching for the optimal triangulation can be cast as a search over all the permutations of the network's vaeriables. Our approach is to embed the discrete set of permutations in a convex continuous domain D. By suitably extending the cost function over D and solving the continous nonlinear optimization task we hope to obtain a good triangulation with respect to the aformentioned cost. In this paper we introduce an upper bound to the total junction tree weight as the cost function. The appropriatedness of this choice is discussed and explored by simulations. Then we present two ways of embedding the new objective function into continuous domains and show that they perform well compared to the best known heuristic.

Probability density estimation with tunable kernels using orthogonal forward regression

A generalized or tunable-kernel model is proposed for probability density function estimation based on an orthogonal forward regression procedure. Each stage of the density estimation process determines a tunable kernel, namely, its center vector and diagonal covariance matrix, by minimizing a leave-one-out test criterion. The kernel mixing weights of the constructed sparse density estimate are finally updated using the multiplicative nonnegative quadratic programming algorithm to ensure the nonnegative and unity constraints, and this weight-updating process additionally has the desired ability to further reduce the model size. The proposed tunable-kernel model has advantages, in terms of model generalization capability and model sparsity, over the standard fixed-kernel model that restricts kernel centers to the training data points and employs a single common kernel variance for every kernel. On the other hand, it does not optimize all the model parameters together and thus avoids the problems of high-dimensional ill-conditioned nonlinear optimization associated with the conventional finite mixture model. Several examples are included to demonstrate the ability of the proposed novel tunable-kernel model to effectively construct a very compact density estimate accurately.

Reduced gradient method combined with augmented Lagrangian and barrier for the optimal power flow problem

A new approach for solving the optimal power flow (OPF) problem is established by combining the reduced gradient method and the augmented Lagrangian method with barriers and exploring specific characteristics of the relations between the variables of the OPF problem. Computer simulations on IEEE 14-bus and IEEE 30-bus test systems illustrate the method. (c) 2007 Elsevier Inc. All rights reserved.

Global minimization using an Augmented Lagrangian method with variable lower-level constraints

A novel global optimization method based on an Augmented Lagrangian framework is introduced for continuous constrained nonlinear optimization problems. At each outer iteration k the method requires the epsilon(k)-global minimization of the Augmented Lagrangian with simple constraints, where epsilon(k) -> epsilon. Global convergence to an epsilon-global minimizer of the original problem is proved. The subproblems are solved using the alpha BB method. Numerical experiments are presented.

Improving ultimate convergence of an augmented Lagrangian method

Optimization methods that employ the classical Powell-Hestenes-Rockafellar augmented Lagrangian are useful tools for solving nonlinear programming problems. Their reputation decreased in the last 10 years due to the comparative success of interior-point Newtonian algorithms, which are asymptotically faster. In this research, a combination of both approaches is evaluated. The idea is to produce a competitive method, being more robust and efficient than its `pure` counterparts for critical problems. Moreover, an additional hybrid algorithm is defined, in which the interior-point method is replaced by the Newtonian resolution of a Karush-Kuhn-Tucker (KKT) system identified by the augmented Lagrangian algorithm. The software used in this work is freely available through the Tango Project web page:http://www.ime.usp.br/similar to egbirgin/tango/.

An efficient neural approach to economic load dispatch in power systems

A neural approach to solve the problem defined by the economic load dispatch in power systems is presented in this paper, Systems based on artificial neural networks have high computational rates due to the use of a massive number of simple processing elements and the high degree of connectivity between these elements the ability of neural networks to realize some complex nonlinear function makes them attractive for system optimization the neural networks applyed in economic load dispatch reported in literature sometimes fail to converge towards feasible equilibrium points the internal parameters of the modified Hopfield network developed here are computed using the valid-subspace technique These parameters guarantee the network convergence to feasible quilibrium points, A solution for the economic load dispatch problem corresponds to an equilibrium point of the network. Simulation results and comparative analysis in relation to other neural approaches are presented to illustrate efficiency of the proposed approach.

Interior point method for long-term generation scheduling of large-scale hydrothermal systems

This paper presents an interior point method for the long-term generation scheduling of large-scale hydrothermal systems. The problem is formulated as a nonlinear programming one due to the nonlinear representation of hydropower production and thermal fuel cost functions. Sparsity exploitation techniques and an heuristic procedure for computing the interior point method search directions have been developed. Numerical tests in case studies with systems of different dimensions and inflow scenarios have been carried out in order to evaluate the proposed method. Three systems were tested, with the largest being the Brazilian hydropower system with 74 hydro plants distributed in several cascades. Results show that the proposed method is an efficient and robust tool for solving the long-term generation scheduling problem.

Multi Objective Evolutionary Algorithm Applied to the Optimal Power Flow Problem

This work presents the application of a multiobjective evolutionary algorithm (MOEA) for optimal power flow (OPF) solution. The OPF is modeled as a constrained nonlinear optimization problem, non-convex of large-scale, with continuous and discrete variables. The violated inequality constraints are treated as objective function of the problem. This strategy allows attending the physical and operational restrictions without compromise the quality of the found solutions. The developed MOEA is based on the theory of Pareto and employs a diversity-preserving mechanism to overcome the premature convergence of algorithm and local optimal solutions. Fuzzy set theory is employed to extract the best compromises of the Pareto set. Results for the IEEE-30, RTS-96 and IEEE-354 test systems are presents to validate the efficiency of proposed model and solution technique.

Relação entre modelos de programação não-linear com incerteza no conjunto de restrições

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

Valorização da reserva operativa em um ambiente competitivo para geradores hidrelétricos

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

Uma contribuição para a otimização de portfólios de séries heteroscedásticas usando projeto de experimento de misturas: uma abordagem do desirability aplicada a modelos

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

Otimização de planos de manutenções de componentes de sistemas de distribuição de energia elétrica centrados em confiabilidade

Pós-graduação em Engenharia Elétrica - FEIS

A Aplicação de um modelo matemático na resolução de um problema de carregamento de paletes

Global competitiveness has been increased significantly in the last decade and, as consequence, companies are always looking for developing better processes in supply chain operations in order to maintain their competitive costs and keep themselves in the business. Logistics operations represent a large part of the product's final cost. Transportation can represent more than fifty percent of final cost sometimes. The solutions for cutting and packing problems consist in simple and low investment actions, as enhancing the arrangement of the transported load in order to decrease both material and room wastes. As per the presented reasons, the objective of this paper is to show and analyze a real application of a mathematical model to solve a manufacturer pallet-loading problem, comparing results from the model execution and the solution proposed by the company studied. This study will not only find the best arrangement to load pallets (which will optimize storage and transportation process), but also to check the effectiveness of existing modeling in the literature. For this study a computational package was used, which consists of a modeling language GAMS with the CPLEX optimization solver and two other existing software in the market, all of them indicating that an accurate mathematical model for solving this kind of problem in a two-dimensional approach is difficult to be found, in addition to a long execution time. However, the study and the software utilization indicate that the problem would be easily solved by heuristics in a shorter execution time

A Aplicação de um modelo matemático na resolução de um problema de carregamento de paletes

Global competitiveness has been increased significantly in the last decade and, as consequence, companies are always looking for developing better processes in supply chain operations in order to maintain their competitive costs and keep themselves in the business. Logistics operations represent a large part of the product's final cost. Transportation can represent more than fifty percent of final cost sometimes. The solutions for cutting and packing problems consist in simple and low investment actions, as enhancing the arrangement of the transported load in order to decrease both material and room wastes. As per the presented reasons, the objective of this paper is to show and analyze a real application of a mathematical model to solve a manufacturer pallet-loading problem, comparing results from the model execution and the solution proposed by the company studied. This study will not only find the best arrangement to load pallets (which will optimize storage and transportation process), but also to check the effectiveness of existing modeling in the literature. For this study a computational package was used, which consists of a modeling language GAMS with the CPLEX optimization solver and two other existing software in the market, all of them indicating that an accurate mathematical model for solving this kind of problem in a two-dimensional approach is difficult to be found, in addition to a long execution time. However, the study and the software utilization indicate that the problem would be easily solved by heuristics in a shorter execution time

Image Reconstruction Using Interval Simulated Annealing in Electrical Impedance Tomography

Electrical impedance tomography (EIT) is an imaging technique that attempts to reconstruct the impedance distribution inside an object from the impedance between electrodes placed on the object surface. The EIT reconstruction problem can be approached as a nonlinear nonconvex optimization problem in which one tries to maximize the matching between a simulated impedance problem and the observed data. This nonlinear optimization problem is often ill-posed, and not very suited to methods that evaluate derivatives of the objective function. It may be approached by simulated annealing (SA), but at a large computational cost due to the expensive evaluation process of the objective function, which involves a full simulation of the impedance problem at each iteration. A variation of SA is proposed in which the objective function is evaluated only partially, while ensuring boundaries on the behavior of the modified algorithm.