Single‐step algorithm for the cascade assembly of multiple S‐parameters based multiports networks

2022 ◽  
Author(s):  
Francesco de Paulis ◽  
Simone Scafati ◽  
Carlo Olivieri ◽  
Antonio Orlandi
Keyword(s):  
Single Step ◽  
S Parameters ◽  
Step Algorithm

A single-step algorithm for oscillatory problems

1989 ◽  
Vol 5 (2) ◽  
pp. 113-120 ◽  
Author(s):  
R. M. Thomas ◽  
S. J. Evans
Keyword(s):  
Single Step ◽  
Step Algorithm

A HYBRID ADAPTIVE ALGORITHM FOR LINEAR OPTIMIZATION

2009 ◽  
Vol 26 (02) ◽  
pp. 235-256
Author(s):  
MAZIAR SALAHI ◽  
TAMÁS TERLAKY
Keyword(s):  
Adaptive Algorithm ◽  
Linear Optimization ◽  
Single Step ◽  
Central Path ◽  
Search Direction ◽  
Worst Case ◽  
One Dimensional ◽  
Barrier Parameter ◽  
Dimensional Equation ◽  
Step Algorithm

Recently, using the framework of self-regularity, Salahi in his Ph.D. thesis proposed an adaptive single step algorithm which takes advantage of the current iterate information to find an appropriate barrier parameter rather than using a fixed fraction of the current duality gap. However, his algorithm might do at most one bad step after each good step in order to keep the iterate in a certain neighborhood of the central path. In this paper, using the same framework, we propose a hybrid adaptive algorithm. Depending on the position of the current iterate, our new algorithm uses either the classical Newton search direction or a self-regular search direction. The larger the distance from the central path, the larger the barrier degree of the self-regular search direction is. Unlike the classical approach, here we control the iterates by guaranteeing certain reduction of the proximity measure. This itself leads to a one dimensional equation which determines the target barrier parameter at each iteration. This allows us to have a large update algorithm without any need for safeguard or special steps. Finally, we prove that our hybrid adaptive algorithm has an [Formula: see text] worst case iteration complexity.

An alternative single-step algorithm for dynamic problems

1980 ◽  
Vol 8 (1) ◽  
pp. 31-40 ◽  
Author(s):  
O. C. Zienkiewicz ◽  
W. L. Wood ◽  
R. L. Taylor
Keyword(s):  
Single Step ◽  
Dynamic Problems ◽  
Step Algorithm
Sign in / Sign up

Export Citation Format

Share Document