An optimization program based on the method of feasible directions : Theory and users guide
- Author
- Belegundu, Ashok D.
- Published
- Jan 1, 1994.
- Physical Description
- 1 electronic document
- Additional Creators
- Berke, Laszlo and Patnaik, Surya N.
Online Version
- hdl.handle.net , Connect to this object online.
- Restrictions on Access
- Unclassified, Unlimited, Publicly available.
Free-to-read Unrestricted online access - Summary
- The theory and user instructions for an optimization code based on the method of feasible directions are presented. The code was written for wide distribution and ease of attachment to other simulation software. Although the theory of the method of feasible direction was developed in the 1960's, many considerations are involved in its actual implementation as a computer code. Included in the code are a number of features to improve robustness in optimization. The search direction is obtained by solving a quadratic program using an interior method based on Karmarkar's algorithm. The theory is discussed focusing on the important and often overlooked role played by the various parameters guiding the iterations within the program. Also discussed is a robust approach for handling infeasible starting points. The code was validated by solving a variety of structural optimization test problems that have known solutions obtained by other optimization codes. It has been observed that this code is robust: it has solved a variety of problems from different starting points. However, the code is inefficient in that it takes considerable CPU time as compared with certain other available codes. Further work is required to improve its efficiency while retaining its robustness.
- Other Subject(s)
- Collection
- NASA Technical Reports Server (NTRS) Collection.
- Note
- Document ID: 19940023362.
Accession ID: 94N27865.
NASA-TM-4552.
NAS 1.15:4552.
E-8124. - Terms of Use and Reproduction
- No Copyright.
View MARC record | catkey: 15659673