scholarly journals Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization

2018 ◽  
Vol 28 (2) ◽  
pp. 1448-1477 ◽  
Author(s):  
Clément W. Royer ◽  
Stephen J. Wright
Keyword(s):  
Nonconvex Optimization ◽  
Line Search ◽  
Complexity Analysis ◽  
Search Algorithms ◽  
Second Order ◽  
Order Line

scholarly journals A Nonmonotone Weighting Self-Adaptive Trust Region Algorithm for Unconstrained Nonconvex Optimization

2015 ◽  
Vol 2015 ◽  
pp. 1-8
Author(s):  
Yunlong Lu ◽  
Weiwei Yang ◽  
Wenyu Li ◽  
Xiaowei Jiang ◽  
Yueting Yang
Keyword(s):  
Nonconvex Optimization ◽  
Line Search ◽  
Optimization Problems ◽  
Trust Region Method ◽  
Trust Region ◽  
Search Technique ◽  
Trust Region Algorithm ◽  
Unconstrained Optimization Problems ◽  
Line Search Technique ◽  
Self Adaptive

A new trust region method is presented, which combines nonmonotone line search technique, a self-adaptive update rule for the trust region radius, and the weighting technique for the ratio between the actual reduction and the predicted reduction. Under reasonable assumptions, the global convergence of the method is established for unconstrained nonconvex optimization. Numerical results show that the new method is efficient and robust for solving unconstrained optimization problems.

scholarly journals Comparison of Filter Line Search Algorithms in the Primal-Dual Barrier Approach for Nonlinear Programming

2009 ◽  
Author(s):  
M. Fernanda P. Costa ◽  
Edite M. G. P. Fernandes ◽  
Theodore E. Simos ◽  
George Psihoyios ◽  
Ch. Tsitouras
Keyword(s):  
Nonlinear Programming ◽  
Line Search ◽  
Search Algorithms ◽  
Primal Dual

On the Contact Search Algorithms for Wheel/Rail Contact Problems

2009 ◽  
Vol 4 (4) ◽  
Author(s):  
Hiroyuki Sugiyama ◽  
Yoshihiro Suda
Keyword(s):  
Vehicle Dynamics ◽  
Line Search ◽  
Point Contact ◽  
Contact Problems ◽  
Search Algorithms ◽  
Railroad Vehicle Dynamics ◽  
Contact Points ◽  
Contact Search ◽  
On Line ◽  
Railroad Vehicle

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