PDS: Direct Search Methods for Unconstrained Optimization on Either Sequential or Parallel Machines

Abstract

PDS is a collection of Fortran subroutines for solving unconstrained nonlinear optimization problems using direct search methods. The software is written so that execution on sequential machines is straightforward while execution on Intel distributed memory machines, such as the iPSC/2, the iPSC/860 or the Touchstone Delta, can be accomplished simply by including a few well-defined routines containing calls to Intel-specific Fortran libraries. Those interested in using the methods on other distributed memory machines, even something as basic as a network of workstations or personal computers, need only modify these few subroutines to handle the global communication requirements. Furthermore, since the parallelism is clearly defined at the "doloop" level, it is a simple matter to insert compiler directives that allow for execution on shared memory parallel machines. Included here is an example of such directives, contained in comment statements, for execution on a Sequent Symmetry S81.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1992
Accession Number
ADA455473

Entities

People

  • Virginia Torczon

Organizations

  • Rice University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Applied Mathematics
  • Computer Programs
  • Computers
  • Directives
  • Global Communications
  • Information Operations
  • Mathematics
  • Operations Research
  • Optimization
  • Personal Computers
  • Procedures (Computers)

Fields of Study

  • Computer science

Readers

  • Computer Science.
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Parallel and Distributed Computing.