| Optimization with dynamic functions |
| Full text |
Pdf
(319 KB)
|
| Source
|
International Conference on APL
archive
Proceedings of the APL98 conference on Array processing language
table of contents
Rome, Italy
Pages: 222 - 227
Year of Publication: 1998
ISBN:1-58113-181-X
Also published in ...
|
|
Author
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 11, Citation Count: 0
|
|
|
ABSTRACT
Many optimization methods are iterative in nature and require users to specify constraints and objectives. The normal way to handle this type of problem would be to create a loop with an execute statement inside the body of the loop. The loop is necessary because of the iterative nature of the algorithm and the execute statement is necessary because the objective function is user-defined."Execute" can be costly inside a loop. While there are existing ways to remove "execute" from the loop, they are awkward. However, dynamic functions can be built ahead of time and called inside the loop. Defined operators allow an arbitrary optimization function to be passed to the looping function.The method of simulated annealing can deal with large-scale optimization problems without getting trapped in local minima. Constraints can be treated as objectives with a high penalty for violations. Hence we can eliminate constraints and deal only with objectives. A series of objectives is combined into a single objective function. Since the objectives are defined by the user, a dynamic function is created. The goal is to reduce the result of the dynamic function to zero (negative values are not permitted). The function is called iteratively until a specific tolerance is reached.This paper will use an example from the mortgage industry to demonstrate the use of dynamic functions in iterative optimization methods.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
ROSS, PHILIP J (1988), Taguchi Techniques for Quality Engineerinb McGraw Hill.
|
| |
3
|
FREUND, JOHN E. (1992), Modem Elementary Statmics, 8th Ed., Prentice Hall
|
| |
4
|
HILI.rF.R and LtEBERMANN, (1986) Introduction w Operations Research ,Chapter 15, McGraw Hill.
|
| |
5
|
BOENDER and ROMEIJN (1995), "Stochastic Methods", Handbook of Global Optimization, Klower Academic Publishers.
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|