sqp method
Recently Published Documents


TOTAL DOCUMENTS

183
(FIVE YEARS 15)

H-INDEX

22
(FIVE YEARS 1)

Energies ◽  
2021 ◽  
Vol 14 (10) ◽  
pp. 2832
Author(s):  
Andrzej J. Osiadacz ◽  
Małgorzata Kwestarz

The major optimization problem of the gas transmission system is to determine how to operate the compressors in a network to deliver a given flow within the pressure bounds while using minimum compressor power (minimum fuel consumption or maximum network efficiency). Minimization of fuel usage is a major objective to control gas transmission costs. This is one of the problems that has received most of the attention from both practitioners and researchers because of its economic impact. The article describes the algorithm of steady-state optimization of a high-pressure gas network of any structure that minimizes the operating cost of compressors. The developed algorithm uses the “sequential quadratic programming (SQP)” method. The tests carried out on the real network segment confirmed the correctness of the developed algorithm and, at the same time, proved its computational efficiency. Computational results obtained with the SQP method demonstrate the viability of this approach.


2021 ◽  
pp. 109-120
Author(s):  
Francisco Facchinei ◽  
Vyacheslav Kungurtsev ◽  
Lorenzo Lampariello ◽  
Gesualdo Scutari

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Peijie Li ◽  
Ling Zhu ◽  
Xiaoqing Bai ◽  
Hua Wei

Due to the nonsmoothness of the small-signal stability constraint, calculating the available transfer capability (ATC) limited by small-signal stability rigorously through the nonlinear programming is quite difficult. To tackle this challenge, this paper proposes a sequential quadratic programming (SQP) method combined with gradient sampling (GS) in a dual formulation. The highlighted feature is the sample size of the gradient changes dynamically in every iteration, yielding an adaptive gradient sampling (AGS) process. Thus, the computing efficiency is greatly improved owing to the decrease and the parallelization of gradient evaluation, which dominates the computing time of the whole algorithm. Simulations on an IEEE 10-machine 39-bus system and an IEEE 54-machine 118-bus system prove the effectiveness and high efficiency of the proposed method.


Author(s):  
Mario Schenk ◽  
Annette Muetze ◽  
Klaus Krischan ◽  
Christian Magele

Purpose The purpose of this paper is to evaluate the worst-case behavior of a given electronic circuit by varying the values of the components in a meaningful way in order not to exceed pre-defined currents or voltages limits during a transient operation. Design/methodology/approach An analytic formulation is used to identify the time-dependent solution of voltages or currents using proper state equations in closed form. Circuits with linear elements can be described by a system of differential equations, while circuits composing nonlinear elements are described by piecewise-linear models. A sequential quadratic program (SQP) is used to find the worst-case scenario. Findings It is found that the worst-case scenario can be obtained with as few solutions to the forward problem as possible by applying an SQP method. Originality/value The SQP method in combination with the analytic forward solver approach shows that the worst-case limit converges in a few steps even if the worst-case limit is not on the boundary of the parameters.


Sign in / Sign up

Export Citation Format

Share Document