Electronic Resource
Springer
Journal of optimization theory and applications
23 (1977), S. 229-243
ISSN:
1573-2878
Keywords:
Gradient methods
;
ill-posed problems
;
computing methods
;
numerical methods
;
failure analysis
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract An extensive failure analysis of the steepest-descent optimization algorithm has been made. Each of the ways in which the algorithm can fail is discussed in terms of both the mathematical and numerical manifestations of a failure and the information which each type of failure provides about the formulation of the physical problem. Numerical tests for each of the various types of failure are described; several faulty problem formulations are presented, each of which illustrates a particular type of failure. A table is presented in which all failure modes are summarized and the corresponding numerical tests are exhibited.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00933050
Permalink
|
Location |
Call Number |
Expected |
Availability |