Nonlinear Network Programming on Vector Supercomputers: A Study on the CRAY X-MP

Stavros Zenios and John M. Mulvey
Additional contact information
John M. Mulvey: Princeton University, Princeton, New Jersey

Operations Research, 1986, vol. 34, issue 5, 667-682

Abstract: The parallelism built into vector supercomputers raises several challenging issues for designers of optimization algorithms. We survey recent trends in parallel computer systems and study the impact of vector computing on nonlinear network programming. We propose a general framework for migrating fortran optimization software to a vector computer, and apply it in the context of two nonlinear network codes: NLPNETG, based on the primal truncated Newton algorithm, and GNSD, based on the simplicial decomposition method. We include computational experiments on a CRAY X-MP/24 system that tested the nonlinear network codes and compared the results with those of MINOS, a general purpose optimizer. Our experience indicates that vectorized codes can achieve significant improvements in performance (as much as 80% for primal truncated Newton), but achieve only modest improvements (15% for simplicial decomposition) for other algorithms.

Keywords: 61 vector computing; 481 nonlinear programming; 642 large-scale network optimization (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.34.5.667 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:34:y:1986:i:5:p:667-682

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().