Solving a large nonlinear programming problem on a vector processing computer
In an earlier paper, the authors formulated an acoustic antenna array design problem as a nonlinear program. Computation times for large problems (about 400 sensors) were in the range of 8 to 10 hours on a Vax 11/780. Most of this time was spent in computing the objective function and its gradient. This paper describes how these computations (and these only) were recoded to exploit the vector processing capabilities of a Cray 1-M computer. Run times are reduced to less than one minute. The results have implications for many nonlinear programs whose function evaluations are very time consuming.
KeywordsObjective Function Computation Time Function Evaluation Programming Problem Design Problem
- L.S. Lasdon, J.C. Plummer, B. Buehler andA.D. Waren, Optimal design of efficient acoustic antenna arrays;Mathematical Programming 39 (1987) 131.Google Scholar
- W. Mossberg, Quiet Defender,The Wall Street Journal, May 19 (1983) pp. 1 and 22.Google Scholar
- L.S. Lasdon andA.D. Waren, in: Generalized reduced gradient software for linearly and nonlinearly constrained problems,Design and Implementation of Optimization Software, ed. H. Greenberg (Sijthoff and Noordhoff, 1978) p. 363.Google Scholar
- H. Cox andJ. Thurston,Advanced Conformal Submarine Acoustic Sensor Beamforming Engineering, Report No. 5258, Bolt Beranek and Newman Inc., Suite 400, 1300 N. 17th St., Arlington VA 22209, (March 1983).Google Scholar