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

A penalty method for nonlinear programming

2019 ◽  
Vol 53 (1) ◽  
pp. 29-38
Author(s):  
Larbi Bachir Cherif ◽  
Bachir Merikhi
Keyword(s):  
Nonlinear Programming ◽  
Convex Programming ◽  
Penalty Method ◽  
Line Search ◽  
Penalty Methods ◽  
Descent Direction ◽  
Type Method ◽  
Numerical Tests ◽  
Line Searches ◽  
Majorant Function

This paper presents a variant of logarithmic penalty methods for nonlinear convex programming. If the descent direction is obtained through a classical Newton-type method, the line search is done on a majorant function. Numerical tests show the efficiency of this approach versus classical line searches.

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.

A Genetic Algorithm Approach for Multi-Product Multi-Machine CONWIP Production System

2011 ◽  
Vol 110-116 ◽  
pp. 3624-3630
Author(s):  
Saeede Ajorlou ◽  
Issac Shams ◽  
Mirbahador G. Aryanezhad
Keyword(s):  
Genetic Algorithm ◽  
Nonlinear Programming ◽  
Programming Model ◽  
Search Algorithms ◽  
Mixed Integer ◽  
Simplified Model ◽  
Mathematical Programming Model ◽  
Production Lines ◽  
Work In Process ◽  
Genetic Algorithm Approach

In this paper, a new mathematical programming model is developed to address common issues relating to single-stage CONstant-Work-In-Process based production lines. A Ge-netic Algorithm (GA) approach is then proposed to directly solve the model in order to simultaneously determines the optimal job sequence and WIP level. Unlike many existing approaches, which are based on deterministic search algorithms such as nonlinear programming and mixed integer programming, our proposed method does not rely on a linearized or simplified model of the system. results from a comprehensive numerical example indicate computational efficiency and validation of our method.

scholarly journals A globally convergent primal-dual interior-point filter method for nonlinear programming

2004 ◽  
Vol 100 (2) ◽  
pp. 379-410 ◽  
Author(s):  
Michael Ulbrich ◽  
Stefan Ulbrich ◽  
Lu�s N. Vicente
Keyword(s):  
Nonlinear Programming ◽  
Interior Point ◽  
Filter Method ◽  
Globally Convergent ◽  
Primal Dual

Line search algorithms with guaranteed sufficient decrease

1994 ◽  
Vol 20 (3) ◽  
pp. 286-307 ◽  
Author(s):  
Jorge J. Moré ◽  
David J. Thuente
Keyword(s):  
Line Search ◽  
Search Algorithms ◽  
Sufficient Decrease
Sign in / Sign up

Export Citation Format

Share Document