Primal-dual Logarithmic Barrier Method Research Articles

A resolução do problema de despacho ótimo de reativos pelo método da função lagrangiana-barreira relaxada

Este artigo apresenta a aplicação do método da função Lagrangiana-barreira relaxada ao problema de despacho ótimo de reativos, o qual é um problema não-linear não convexo e de grande porte. Nesta abordagem as restrições de desigualdade são tratadas pela associação dos métodos de barreira modificada e primal-dual barreira logarítmica. Essas restrições são transformadas em igualdades através de variáveis auxiliares positivas e são relaxadas pelo parâmetro de barreira. Uma função Lagrangiana é associada ao problema modificado. As condições necessárias de primeira-ordem são aplicadas gerando um sistema não-linear o qual é resolvido pelo método de Newton. A relaxação das variáveis auxiliares resulta na expansão da região factível do problema original, permitindo atingir o limite das restrições de desigualdade. Testes numéricos nos sistemas CESP 53 barras, o equivalente brasileiro sul-sudeste e o teste comparativo com o método primal-dual barreira logarítmica indicam que o método apresentado é eficiente na resolução do problema de despacho ótimo de reativos.

Fluxo de potência ótimo reativo via método da função lagrangiana barreira modificada

Este artigo apresenta uma nova abordagem para a resolução do problema de Fluxo de Potência Ótimo Reativo. Nesta abordagem, as restrições de desigualdade são tratadas pela associação dos métodos de Barreira Modificada e Primal-Dual Barreira Logarítmica (PDBL). As restrições de desigualdade são transformadas em igualdades introduzindo variáveis de folga positivas e são relaxadas através do parâmetro de barreira. Uma função Lagrangiana é associada ao problema modificado. As condições necessárias de primeira ordem são aplicadas à função Lagrangiana, gerando um sistema de equações não-lineares, o qual é linearizado pelo método de Newton. A relaxação das variáveis de folga resulta na expansão da região factível do problema original, permitindo que os limites das restrições de desigualdade sejam atingidos. Testes numéricos utilizando os sistemas CESP-440kV e SUL-SUDESTE BRASILEIRO e um teste comparativo com o método PDBL indicam que a nova abordagem é eficiente na resolução do problema Fluxo de Potência Ótimo Reativo.

Optimal Reactive Dispatch Problem via Improved Newton Approach

This article proposes a new approach to solve the optimal reactive dispatch problem, based on Newton approach and the primal-dual logarithmic barrier method. A Lagrangian function is associated with the modified problem. The first-order necessary conditions for optimality are fulfilled by Newton's method and by updating the penalty and barrier terms. The proposed approach does not require the set of binding constraints to be identified and can be utilized from an infeasible starting point. The effectiveness of the proposed approach has been examined by solving the Brazilian 53-bus and 662-bus systems.

Primal-Dual Logarithmic Barrier and Augmented Lagrangian Function to the Loss Minimization in Power Systems

This article presents a new approach to minimize the losses in electrical power systems. This approach considers the application of the primal-dual logarithmic barrier method to voltage magnitude and tap-changing transformer variables, and the other inequality constraints are treated by augmented Lagrangian method. The Lagrangian function aggregates all the constraints. The first-order necessary conditions are reached by Newton's method, and by updating the dual variables and penalty factors. Test results are presented to show the good performance of this approach.

Atomic Decomposition by Basis Pursuit

The time-frequency and time-scale communities have recently developed a large number of overcomplete waveform dictionaries---stationary wavelets, wavelet packets, cosine packets, chirplets, and warplets, to name a few. Decomposition into overcomplete systems is not unique, and several methods for decomposition have been proposed, including the method of frames (MOF), matching pursuit (MP), and, for special dictionaries, the best orthogonal basis (BOB). Basis pursuit (BP) is a principle for decomposing a signal into an "optimal"' superposition of dictionary elements, where optimal means having the smallest l1 norm of coefficients among all such decompositions. We give examples exhibiting several advantages over MOF, MP, and BOB, including better sparsity and superresolution. BP has interesting relations to ideas in areas as diverse as ill-posed problems, abstract harmonic analysis, total variation denoising, and multiscale edge denoising. BP in highly overcomplete dictionaries leads to large-scale optimization problems. With signals of length 8192 and a wavelet packet dictionary, one gets an equivalent linear program of size 8192 by 212,992. Such problems can be attacked successfully only because of recent advances in linear and quadratic programming by interior-point methods. We obtain reasonable success with a primal-dual logarithmic barrier method and conjugate-gradient solver.

Atomic Decomposition by Basis Pursuit

The time-frequency and time-scale communities have recently developed a large number of overcomplete waveform dictionaries --- stationary wavelets, wavelet packets, cosine packets, chirplets, and warplets, to name a few. Decomposition into overcomplete systems is not unique, and several methods for decomposition have been proposed, including the method of frames (MOF), Matching pursuit (MP), and, for special dictionaries, the best orthogonal basis (BOB). Basis Pursuit (BP) is a principle for decomposing a signal into an "optimal" superposition of dictionary elements, where optimal means having the smallest l1 norm of coefficients among all such decompositions. We give examples exhibiting several advantages over MOF, MP, and BOB, including better sparsity and superresolution. BP has interesting relations to ideas in areas as diverse as ill-posed problems, in abstract harmonic analysis, total variation denoising, and multiscale edge denoising. BP in highly overcomplete dictionaries leads to large-scale optimization problems. With signals of length 8192 and a wavelet packet dictionary, one gets an equivalent linear program of size 8192 by 212,992. Such problems can be attacked successfully only because of recent advances in linear programming by interior-point methods. We obtain reasonable success with a primal-dual logarithmic barrier method and conjugate-gradient solver.

Solving a class of LP problems with a primal-dual logarithmic barrier method

Applying a higher order primal-dual logarithmic barrier method for solving large real-life linear programming problems is addressed in this paper. The efficiency of an interior point algorithm on these problems is compared with the one of the state-of-the-art simplex code MINOS version 5.3. Based on such experience, a wide class of LP problems is identified for which logarithmic barrier approach seems advantageous over the simplex one. Additionally, some practical rules for model builders are derived that should allow them to create problems that can easily be solved with logarithmic barrier algorithms.