The LFOPC leap-frog algorithm for constrained optimization

This paper describes an accurate and reliable new algorithm (LFOPC) for solving constrained optimization problems, through a three-phase application of the well-established leap-frog method for unconstrained optimization, to penalty function formulations of the original constrained problems. The alg...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & mathematics with applications (1987) 2000-10, Vol.40 (8), p.1085-1096
1. Verfasser:	Snyman, J.A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Constrained optimization Leap-frog method Penalty function formulations Robust algorithm
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!