ISSN:
1573-2878
Schlagwort(e):
Nonlinear programming
;
methods of feasible direction
;
numerical methods
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Mathematik
Notizen:
Abstract A variation of the Polak method of feasible directions for solving nonlinear programming problems is shown to be related to the Topkis and Veinott method of feasible directions. This new method is proven to converge to a Fritz John point under rather weak assumptions. Finally, numerical results show that the method converges with fewer iterations than that of Polak with a proper choice of parameters.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF02190059
Permalink
