No description available.

Consider a lossy compression system with l distributed encoders and a centralized decoder. Each encoder compresses its observed source and forwards the compressed data to the decoder for joint reconstruction of the target signals under the mean squared error distortion constraint. It is assumed that the observed sources can be expressed as the sum of the target signals and the corruptive noises, which are generated independently from two (possibly di erent) symmetric multivariate Gaussian distributions. Depending on the parameters of such Gaussian distributions, the rate-distortion limit of this lossy compression system is characterized either completely or for a subset of distortions (including, but not necessarily limited to, those su fficiently close to the minimum distortion achievable when the observed sources are directly available at the decoder). The results are further extended to the robust distributed compression setting, where the outputs of a subset of encoders may also be used to produce a non-trivial reconstruction of the corresponding target signals. In particular, we obtain in the high-resolution regime a precise characterization of the minimum achievable reconstruction distortion based on the outputs of k + 1 or more encoders when every k out of all l encoders are operated collectively in the same mode that is greedy in the sense of minimizing the distortion incurred by the reconstruction of the corresponding k target signals with respect to the average rate of these k encoders. / Thesis / Master of Applied Science (MASc)

This thesis focuses on the development of guidance algorithms in order to avoid a prescribed obstacle primarily using the Collision Cone Method (CCM). The Collision Cone Method is a geometric approach to obstacle avoidance, which forms an avoidance zone around the obstacles for the vehicle to pass the obstacle around this zone. The method is reactive as it helps to avoid the pop-up obstacles as well as the known obstacles and local as it passes the obstacles and continue to the prescribed trajectory. The algorithm is first developed for a 2D (planar) avoidance in 3D environment and then extended for 3D scenarios. The algorithm is formed for the optimized CCM as well. The avoidance zone radius and velocity are optimized using constraint optimization, Lagrange multipliers with Karush-Kuhn-Tucker conditions and direct experimentation.

Neste trabalho é apresentada uma abordagem do Método de Newton associado à função penalidade quadrática e ao método dos conjuntos ativos na solução do problema de Fluxo de Potência Ótimo (FPO). A formulação geral do problema de FPO é apresentada, assim como a técnica utilizada na resolução do sistema de equações. A fatoração da matriz Lagrangeana é feita por elementos ao invés das estruturas em blocos. A característica de esparsidade da matriz Lagrangeana é levada em consideração. Resultados dos testes realizados em 4 sistemas (3, 14, 30 e 118 barras) são apresentados. / This work presents an approach on Newton\'s Method associated with the quadratic penalty function and the active set methods in the solution of Optimal Power Flow Problem (OPF). The general formulation of the OPF problem is presented, as will as the technique used in the equation systems resolution. The Lagrangean matrix factorization is carried out by elements instead of structures in blocks. The characteristic of sparsity of the Lagrangean matrix is taken in to account. Numerical results of tests realized in systems of 3, 14, 30 and 118 buses are presented to show the efficiency of the method.

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / In this work some classical methods for constrained nonlinear optimization are studied. The mathematical formulations for the optimization problem with equality and inequality constrained, convergence properties and algorithms are presented. Furthermore, optimality conditions of rst order (Karush-Kuhn-Tucker conditions) and of second order. These conditions are essential for the demonstration of many results. Among the methods studied, some techniques transform the original problem into an unconstrained problem (Penalty Methods, Augmented Lagrange Multipliers Method). In others methods, the original problem is modeled as one or as a sequence of quadratic subproblems subject to linear constraints (Quadratic Programming Method, Sequential Quadratic Programming Method). In order to illustrate and compare the performance of the methods studied, two nonlinear optimization problems are considered: a bi-dimensional problem and a problem of mass minimization of a coil spring. The obtained results are analyzed and confronted with each other. / Neste trabalho são estudados alguns métodos clássicos de otimização restrita não linear. São abordadas a formulação matemática para o problema de otimização com restrições de igualdade e desigualdade, propriedades de convergência e algoritmos. Além disso, são relatadas as condições de otimalidade de primeira ordem (condições de Karush-Kuhn-Tucker) e de segunda ordem. Estas condições são essenciais para a demonstração de muitos resultados. Dentre os métodos estudados, algumas técnicas transformam o problema original em um problema irrestrito (Métodos de Penalidade, Método dos Multiplicadores de Lagrange Aumentado). Em outros métodos, o problema original é modelado como um ou uma seqüência de subproblemas quadráticos sujeito _a restrições lineares (Método de Programação Quadrática, Método de Programação Quadrática Seqüencial). A fim de ilustrar e comparar o desempenho dos métodos estudados são considerados dois problemas de otimização não linear: um problema bidimensional e o problema de minimização da massa de uma mola helicoidal. Os resultados obtidos são examinados e confrontados entre si. / Mestre em Matemática

Neste trabalho é apresentada uma abordagem do Método de Newton associado à função penalidade quadrática e ao método dos conjuntos ativos na solução do problema de Fluxo de Potência Ótimo (FPO). A formulação geral do problema de FPO é apresentada, assim como a técnica utilizada na resolução do sistema de equações. A fatoração da matriz Lagrangeana é feita por elementos ao invés das estruturas em blocos. A característica de esparsidade da matriz Lagrangeana é levada em consideração. Resultados dos testes realizados em 4 sistemas (3, 14, 30 e 118 barras) são apresentados. / This work presents an approach on Newton\'s Method associated with the quadratic penalty function and the active set methods in the solution of Optimal Power Flow Problem (OPF). The general formulation of the OPF problem is presented, as will as the technique used in the equation systems resolution. The Lagrangean matrix factorization is carried out by elements instead of structures in blocks. The characteristic of sparsity of the Lagrangean matrix is taken in to account. Numerical results of tests realized in systems of 3, 14, 30 and 118 buses are presented to show the efficiency of the method.

The main aim of this thesis is to create a sequence of mathematical optimization models with different levels of complexity for the efficient management and waste energy utilization. Stochastic programming approach was utilized to deal with random demand and uncertain heating values. Hence, more applicable model of the waste-to-energy plant has been developed. As the next step, the model is enhanced by heating plant extension. Computations are realized for real-world data and optimal solution is found by using GAMS implementation.