Name
Abstract | ||
|---|---|---|
Significant advances have been made over the past decade in the development of powerful function minimization methods. Although the essential structure of each of these methods is fixed, several auxiliary features invariably remain to be selected by the user in any actual implementation. The effectiveness of the methods can, furthermore, be greatly influenced by the choice made by the user in this regard. The sensitivity of a variety of different methods to three of these features is examined through a series of computational experiments. These features are 1) the type of gradient information used (exact or approximated), 2) the precision requested in the solution of the line search subproblem, and 3) the superposition, on the basic algorithm, of a policy of periodic reinitialization. |
Year | DOI | Venue |
|---|---|---|
1976 | 10.1109/TSMC.1976.5409234 | IEEE Transactions on Systems, Man and Cybernetics |
Keywords | Field | DocType |
approximation algorithms,computer experiment,minimization,sensitivity,line search,power function,algorithm design and analysis,engineering management,quantum computing | Superposition principle,Computer science,Quantum computer,Line search,Minification,Artificial intelligence,Approximation algorithm,Mathematical optimization,Algorithm design,Algorithm,Periodic graph (geometry),Function minimization,Machine learning | Journal |
Volume | Issue | ISSN |
6 | 3 | 0018-9472 |
Citations | PageRank | References |
2 | 0.70 | 9 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Louis G. Birta | 1 | 32 | 6.51 |