On the worst-case evaluation complexity of non-monotone line search algorithms

2017 ◽  
Vol 68 (3) ◽  
pp. 555-577 ◽  
Author(s):  
Geovani N. Grapiglia ◽  
Ekkehard W. Sachs
2016 ◽  
Vol 163 (1-2) ◽  
pp. 359-368 ◽  
Author(s):  
E. G. Birgin ◽  
J. L. Gardenghi ◽  
J. M. Martínez ◽  
S. A. Santos ◽  
Ph. L. Toint

2009 ◽  
Author(s):  
M. Fernanda P. Costa ◽  
Edite M. G. P. Fernandes ◽  
Theodore E. Simos ◽  
George Psihoyios ◽  
Ch. Tsitouras

Author(s):  
Hiroyuki Sugiyama ◽  
Yoshihiro Suda

In this investigation, contact search algorithms for the analysis of wheel/rail contact problems are discussed, and the on-line and off-line hybrid contact search method is developed for multibody railroad vehicle dynamics simulations using the elastic contact formulation. In the hybrid algorithm developed in this investigation, the off-line search that can be effectively used for the tread contact is switched to the on-line search when the contact point is jumped to the flange region. In the two-point contact scenarios encountered in curve negotiations, the on-line search is used for both tread and flange contacts to determine the two-point contact configuration. By so doing, contact points on the flange region given by the off-line tabular search are never used, but rather used as an initial estimate for the online iterative procedure for improving the numerical convergence. Furthermore, the continual on-line detection of the second point of contact is replaced with a simple table look-up. It is demonstrated by several numerical examples that include flange climb and curve negotiation scenarios that the proposed hybrid contact search algorithm can be effectively used for modeling wheel/rail contacts in the analysis of general multibody railroad vehicle dynamics.


Sign in / Sign up

Export Citation Format

Share Document