Nonlinear Programming
Nonlinear Programming
复制标题
DOI:
10.1137/1012119
复制
发表时间:
1969
期刊:
影响因子:
--
通讯作者:
O. Mangasarian
中科院分区:
文献类型:
--
作者:
O. Mangasarian
methods. Chapter 8 is concerned with computational aspects of unconstrainedminimization algorithms and contains a description of some of the better knownunconstrained algorithms such as Cauchys method of steepest descent, Fletcher-Reeves method, Davidon-Fletcher-Powell method, Newtons method, as wellas other methods. A numerical example in 5 variables shows that each of themethods requires fewer iterations than its predecessor as listed above. The bookterminates with a pertinent bibliography of 119 items.This book is one of the few books in nonlinear programming that strikes anextremely good balance between theory and computation. The computationalaspect emphasizes the sequential unconstrained methods which the authorshave had a major role in developing and testing. It is highly recommended bothfor individual and classroom study.