Spelling suggestions: "subject:"interiorpoint method"" "subject:"interpoint method""
11 |
Métodos de pontos interiores aplicados ao pré-despacho com manobras simultâneas de barras e linhas / Interior point methods applied to predispatch with simultaneous bar and lines maneuversCarvalho, Silvia Maria Simões de 17 August 2018 (has links)
Orientadores: Christiano Lyra Filho, Aurélio Ribeiro Leite de Oliveira / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-17T10:40:56Z (GMT). No. of bitstreams: 1
Carvalho_SilviaMariaSimoesde_D.pdf: 1427390 bytes, checksum: 46a85c5d1759bf72fed5ba7508ef4f53 (MD5)
Previous issue date: 2010 / Resumo: Os métodos de pontos interiores do tipo primal-dual são utilizados para minimizar os custos na geração e perdas na transmissão de energia elétrica no planejamento a curto-prazo da operação (prédespacho), em um sistema hidroelétrico com manobras previamente programadas. É realizado o estudo da estrutura matricial desse problema e das alterações que as manobras impõem ao sistema. Essas informações são exploradas para obter métodos especializados para a classe de problemas estudados. A solução de parte dos sistemas lineares em cada iteração depende somente de dados físicos e topológicos da rede. Algumas das matrizes associadas aos sistemas lineares podem ser decompostas antes de iniciar o processo iterativo, aumentando a velocidade de processamento. Resultados computacionais com sistemas testes do IEEE e sistemas reais brasileiros mostram que o método proposto é rápido e robusto, obtendo convergência em todos os testes viáveis à rede, aqui realizados / Abstract: The primal-dual interior point method is used to minimize the predispatch generation costs and transmission losses on short term operation planning of hydroelectric power systems with previously scheduled maneuvers. A matrix structure study is performed to consider the changes that occur in the system along the planning period. This information is used to develop specialized methods for the studied problem class. Some linear systems solved at each iteration depend only on network physical data and topology. Such matrices can be decomposed before starting the iterative process, speeding up the implementation. Numerical experiments with IEEE and real Brazilian power systems show that the proposed approach is fast and robust obtaining convergence in all performed tests / Doutorado / Automação / Doutor em Engenharia Elétrica
|
12 |
Modificações na fatoração controlada de Cholesky para acelerar o precondicionamento de sistemas lineares no contexto de pontos interiores / Modifications on controlled Cholesky factorization to improve the preconditioning in interior point methodSilva, Lino Marcos da, 1978- 09 February 2014 (has links)
Orientador: Aurelio Ribeiro Leite de Oliveira / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação Científica / Made available in DSpace on 2018-08-25T19:56:24Z (GMT). No. of bitstreams: 1
Silva_LinoMarcosda_D.pdf: 2297954 bytes, checksum: 2213b987c2753edec9152998b30b7c74 (MD5)
Previous issue date: 2014 / Resumo: O método de pontos interiores para programação linear resolve em poucas iterações problemas de grande porte. No entanto, requer a cada iteração a resolução de dois sistemas lineares, os quais possuem a mesma matriz de coeficientes. Essa etapa se constitui no passo mais caro do método por aumentar consideravelmente o tempo de processamento e a necessidade de armazenamento de dados. Reduzir o tempo de solução dos sistemas lineares é, portanto, uma forma de melhorar o desempenho do método. De um modo geral, problemas de programação linear de grande porte possuem matrizes esparsas. Uma vez que os sistemas lineares a serem resolvidos são simétricos positivos definidos, métodos iterativos como o método dos gradientes conjugados precondicionado podem ser utilizados na resolução dos mesmos. Além disso, fatores de Cholesky incompletos podem ser utilizados como precondicionadores para o problema. Por outro lado, fatorações incompletas podem sofrer falhas na diagonal durante o processo de fatoração, e quando tais falhas ocorrem uma correção é efetuada somando-se um valor positivo aos elementos da diagonal da matriz do sistema linear e a fatoração da nova matriz é reiniciada, aumentando dessa forma o tempo de precondicionamento, quer seja devido a reconstrução do precondicionador, quer seja devido a perda de qualidade do mesmo. O precondicionador fatoração controlada de Cholesky tem um bom desempenho nas iterações iniciais do método de pontos interiores e tem sido importante nas implementações de abordagens de precondicionamento híbrido. No entanto, sendo uma fatoração incompleta, o mesmo não está livre da ocorrência de falhas no cálculo do pivô. Neste estudo propomos duas modificações à fatoração controlada de Cholesky a fim de evitar ou diminuir o número de reinícios da fatoração das matrizes diagonalmente modificadas. Resultados computacionais mostram que a técnica pode reduzir significativamente o tempo de resolução de certas classes de problemas de programação linear via método de pontos interiores / Abstract: The interior point method solves large linear programming problems in few iterations. However, each iteration requires computing the solution of one or more linear systems. This constitutes the most expensive step of the method by greatly increasing the processing time and the need for data storage. According to it, reducing the time to solve the linear system is a way of improving the method performance. In general, large linear programming problems have sparse matrices. Since the linear systems to be solved are symmetric positive definite, iterative methods such as the preconditioned conjugate gradient method can be used to solve them. Furthermore, incomplete Cholesky factor can be used as a preconditioner to the problem. On the other hand, breakdown may occur during incomplete factorizations. When such failure occur, a correction is made by adding a positive number to diagonal elements of the linear system matrix and the factorization of the new matrix is restarted, thus increasing the time of preconditioning, either due to computing the preconditioner, or due to loss of its quality. The controlled Cholesky factorization preconditioner performs well in early iterations of interior point methods and has been important on implementations of hybrid preconditioning approaches. However, being an incomplete factorization, it is not free from faulty pivots. In this study we propose two modifications to the controlled Cholesky factorization in order to avoid or decrease the refactoring diagonally modified matrices number. Computational results show that the proposed techniques can significantly reduces the time for solving linear programming problems by interior point method / Doutorado / Matematica Aplicada / Doutor em Matemática Aplicada
|
13 |
Multiple objetive network flow problemsTorres Guardia, Luis Ernesto, Lacerda, Nelson N. 25 September 2017 (has links)
In this work, it is presented the multiple objective networkflow problems. This kind of problem is converted into singleo bjective problem and solved by using the primal dual interior point method. The linear system associated to the interior point method is solved by using the Cholesky decomposition, implemented in MATLAB code. Networks of different dimensions are constructed and the computational results show the efficiency of the mentioned interior point method for solving multiple objective network flow problems.
|
14 |
Optimisation of flat dielectric lenses using an interior point methodEk, Jonatan January 2021 (has links)
This thesis aims to study how flat dielectric lenses can be designed. The usage of flat lenses is steadily increasing as they are smaller and less bulky than traditional convex lenses. Instead of a lens with a curved surface the permittivity in the lens is varied to achieve the same effect. Two different computational methods were investigated when approaching this problem: physical and geometrical optics. In physical optics the incoming radio waves are treated as waves in contrast to geometrical optics where it is considered as rays. Both methods are used as approximations of Maxwell's equations. The variation of permittivity in the lens was formulated as an optimisation problem where the lens' focusing abilities were maximised. The optimisation was implemented with an interior point method. Both arbitrary permittivity distributions as well as predetermined distributions were examined in this work. All optimised lens models were then simulated in a full wave commercial simulation software to verify and compare the two. The simulations showed that both approaches gave promising results as they focused the electromagnetic wave in a satisfying way. However the physical optics approach was more prominent as the focused radio waves had a much higher magnitude than the approach based on geometrical optics. The conclusion was therefore that physical optics is the preferred approach.
|
15 |
Solving Large Security-Constrained Optimal Power Flow for Power Grid Planning and OperationsZhang, Fan 07 September 2020 (has links)
No description available.
|
16 |
Alternative Methods for Operational Optimization of Hydro Power Plants / Alternativa Metoder för Driftoptimering av VattenkraftverkAlmgrund, Jonas January 2019 (has links)
The aim of this thesis is to optimize hydro power plants with data generated from observations and field tests at the plants. The output is optimal production tables and curves in order to operate and plan hydro power plants in an optimized way concerning power output, efficiency and distribution of water. The thesis is performed in collaboration with Vattenfall AB, which currently use an internal optimization program called SEVAP. Two alternative methods have been selected, employed and compared with the current optimization program, these are Interior-Point Method and Sequential Quadratic Programming. Three start-point strategies are created to increase the probability of finding a global optima. A heuristic rule is used for selection of strategy in order to prevent rapid changes in load distribution for small variations in dispatched water. The optimization is performed at three plants in Sweden with different size and setup. The results of this evaluation showed marginally better results for the employed methods in comparison to the currently used optimization. Further, the developed program is more flexible and compatible to integrate with future digitalization projects. / Syftet med detta examensarbete är att optimera vattenkraftverk med data som genererats från indextester vid kraftverken. Resultatet är optimala produktionstabeller och kurvor för drift och planering av vattenkraftverk. Dessa är baserade på att optimalt fördela vattnet mellan aggregaten för att maximera uteffekt och verkningsgrad. Detta arbete har utförts i samarbete med Vattenfall AB, som för närvarande använder ett internt optimeringsprogram som heter SEVAP. Två optimeringsmetoder har valts, implementerats och jämförts med det nuvarande optimeringsprogrammet. Dessa metoder är inrepunktsmetoden (IPM) och sekventiell kvadratiskt programmering (SQP). Tre startpunktsstrategier har används för att öka sannolikheten att hitta ett globalt optima. För att förhindra hastiga förändringar i lastfördelning för små variationer av avsänt vatten har en heuristisk regel används. Optimeringen har utförts på tre stationer med olika uppsättning och storlek. Resultatet av detta examensarbete visar marginellt bättre resultat för de använda metoderna i jämförelse med den nuvarande optimeringen. Det utvecklade programmet är flexibelt och kompatibelt att integrera med framtida digitaliseringsprojekt.
|
17 |
Interior Point Optimization of Low-Thrust Spacecraft TrajectoriesFrederiksen, Jordan D 01 August 2021 (has links) (PDF)
Low-thrust interplanetary spacecraft trajectory optimization poses a uniquely difficult problem to solve because of the inherent nonlinearities of the dynamics and constraints as well as the large size of the search space of possible solutions. Tools currently exist that optimize low-thrust interplanetary trajectories, but these tools are rarely openly available to the public, and when they are available they require multiple interfaces between multiple different packages. The goal of this work is to present a new piece of low-thrust interplanetary spacecraft trajectory optimization software that is open-source and entirely self-contained so that more people can have access to the ability to design interplanetary trajectories.
To achieve this goal, a gradient-descent based nonlinear programming method, called the interior point method, was used. The nonlinear programming method was chosen so that results from this work could be compared and contrasted with results from Spacecraft Trajectory Optimization Suite (STOpS), which uses heuristics to iterate towards a solution. Interior point methods are popular because of their ability to handle large amounts of equality and inequality constraints, which is a characteristic that is valuable for low-thrust interplanetary spacecraft trajectories. The software developed, Interior Point Optimizer (IP Optimizer), was then validated against test cases with known solutions to ensure that the software delivered the intended results. Lastly, a constraint satisfaction, a minimum-time, and a maximum-final-mass optimization problem were solved and compared with literature to illustrate the advantages of IP Optimizer and the methods it employs.
For the constraint satisfaction problem, IP Optimizer was able to find a solution that exactly satisfied the desired terminal constraints whereas STOpS had an error of 2.29 percent. In this case, IP Optimizer had a reduced runtime of 15 percent compared to STOpS as well. When minimizing time for a spacecraft transfer, IP Optimizer improved upon the solution found by STOpS by 5.3 percent. The speed of convergence for IP Optimizer was almost twice as fast as STOpS for this case. These results show that IP Optimizer is faster than STOpS at converging on a solution and the solution it converges to has a better objective value and more accurately satisfies the terminal constraints than STOpS. Lastly, the maximum-final-mass problem resulted in an objective value that was only 0.5 percent lower than the value found in literature.
|
18 |
Evaluating the Benefits of Optimal Allocation of Wind Turbines for Distribution Network OperatorsSiano, P., Mokryani, Geev January 2015 (has links)
No / This paper proposes a hybrid optimization method for optimal allocation of wind turbines (WTs) that combines a fast and elitist multiobjective genetic algorithm (MO-GA) and the market-based optimal power flow (OPF) to jointly minimize the total energy losses and maximize the net present value associated with the WT investment over a planning horizon. The method is conceived for distributed-generator-owning distribution network operators to find the optimal numbers and sizes of WTs among different potential combinations. MO-GA is used to select, among all the candidate buses, the optimal sites and sizes of WTs. A nondominated sorting GA II procedure is used for finding multiple Pareto-optimal solutions in a multiobjective optimization problem, while market-based OPF is used to simulate an electricity market session. The effectiveness of the method is demonstrated with an 84-bus 11.4-kV radial distribution system.
|
19 |
O Método Primal Dual Barreira Logarítmica aplicado ao problema de fluxo de carga ótimo / Optimal power flow by a Logarithmic-Barrier Primal-Dual methodSouza, Alessandra Macedo de 18 February 1998 (has links)
Neste trabalho será apresentado um algoritmo de pontos interiores para a solução do problema de fluxo de carga ótimo (FCO). A abordagem proposta é o método primai dual barreira logarítmica. As restrições de desigualdade do problema de FCO são transformadas em igualdades pelo uso de variáveis de folga, e estas são incorporadas na função objetivo através da função barreira logarítmica. A esparsidade da matriz Lagrangeana é explorada e o processo de fatoração é feito por elementos e não por submatrizes. Resultados numéricos de testes realizados em sistemas de 3, 14, 30 e 118 barras serão apresentados com o objetivo de mostrar a eficiência do método. / In this thesis an interior point algorithm is presented for the solution of the optimal power flow problem (OPF). The approach proposed here is the logarithmic barrier primal-dual method. The inequality constraints of the optimal power flow problem are transformed into equalities by slack variables that are incorporated into the objective function through the logarithmic barrier function. The sparsity of the Lagrangian matrix is explored and the factorization process is carried out by elements rather than submatrices. Numerical tests results obtained with systems of 3, 14, 30 and 118 buses are presented to show the efficiency of the method.
|
20 |
Sequential Quadratic Programming-Based Contingency Constrained Optimal Power FlowPajic, Slobodan 30 April 2003 (has links)
The focus of this thesis is formulation and development of a mathematical framework for the solution of the contingency constrained optimal power flow (OPF) based on sequential quadratic programming. The contingency constrained optimal power flow minimizes the total cost of a base case operating state as well as the expected cost of recovery from contingencies such as line or generation outages. The sequential quadratic programming (SCP) OPF formulation has been expanded in order to recognize contingency conditions and the problem is solved as a single entity by an efficient interior point method. The new formulation takes into account the system corrective capabilities in response to contingencies introduced through ramp-rate constraints. Contingency constrained OPF is a very challenging problem, because each contingency considered introduces a new problem as large as the base case problem. By proper system reduction and benefits of constraint relaxation (active set) methods, in which transmission constraints are not introduced until they are violated, the size of the system can be reduced significantly Therefore, restricting our attention to the active set constraint set makes this large problem significantly smaller and computationally feasible.
|
Page generated in 0.0825 seconds