residual algorithm
Recently Published Documents


TOTAL DOCUMENTS

43
(FIVE YEARS 3)

H-INDEX

11
(FIVE YEARS 0)

2021 ◽  
Vol 2108 (1) ◽  
pp. 012062
Author(s):  
Biqi Liu ◽  
Danni Wang ◽  
Yunpeng Li ◽  
Lin Qiao ◽  
Shuo Chen

Abstract Because of low measurement redundancy and frequent switch changes, it is difficult to identify the correct topology structure. In this paper, a topology recognition method of distribution network based on branch active power is proposed. Firstly, branch active power residual algorithm is used to identify the topological structure. The topology obtained by this method has the highest matching degree with the real-time measured data. Then genetic algorithm is used to optimize the inverse recognition of power grid topology. The numerical example shows that the method is reasonable, effective, rapid and simple. It also has good adaptability with a large number of measurement errors.





Author(s):  
Shangtong Zhang ◽  
Wendelin Boehmer ◽  
Shimon Whiteson

We revisit residual algorithms in both model-free and model-based reinforcement learning settings. We propose the bidirectional target network technique to stabilize residual algorithms, yielding a residual version of DDPG that significantly outperforms vanilla DDPG in commonly used benchmarks. Moreover, we find the residual algorithm an effective approach to the distribution mismatch problem in model-based planning. Compared with the existing TD(k) method, our residual-based method makes weaker assumptions about the model and yields a greater performance boost.



Author(s):  
Alessandra Papini ◽  
Margherita Porcelli ◽  
Cristina Sgattoni

AbstractWe present a derivative-free method for solving systems of nonlinear equations that belongs to the class of spectral residual methods. We will show that by endowing a previous version of the algorithm with a suitable new linesearch strategy, standard global convergence results can be attained under mild general assumptions. The robustness of the new method is therefore potentially improved with respect to the previous version as shown by the reported numerical experiments.



2020 ◽  
Vol 33 (5) ◽  
pp. 1505-1516 ◽  
Author(s):  
Dan SONG ◽  
Chuang SHI ◽  
Zhipeng WANG ◽  
Cheng WANG ◽  
Guifei JING


Filomat ◽  
2018 ◽  
Vol 32 (15) ◽  
pp. 5307-5318 ◽  
Author(s):  
Masoud Hajarian

The present paper is concerned with the solution of the coupled generalized Sylvester-transpose matrix equations {A1XB1 + C1XD1 + E1XTF1 = M1, A2XB2 + C2XD2 + E2XTF2 = M2, including the well-known Lyapunov and Sylvester matrix equations. Based on a variant of biconjugate residual (BCR) algorithm, we construct and analyze an efficient algorithm to find the (least Frobenius norm) solution of the general Sylvester-transpose matrix equations within a finite number of iterations in the absence of round-off errors. Two numerical examples are given to examine the performance of the constructed algorithm.



Sign in / Sign up

Export Citation Format

Share Document