Asynchronous parallel generating set search for linearly-constrained optimization.
Generating set search (GSS) is a family of direct search methods that encompasses generalized pattern search and related methods. We describe an algorithm for asynchronous linearly-constrained GSS, which has some complexities that make it different from both the asynchronous bound-constrained case as well as the synchronous linearly-constrained case. The algorithm has been implemented in the APPSPACK software framework and we present results from an extensive numerical study using CUTEr test problems. We discuss the results, both positive and negative, and conclude that GSS is a reliable method for solving small-to-medium sized linearly-constrained optimization problems without derivatives.
- Research Organization:
- Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 891372
- Report Number(s):
- SAND2006-4621; TRN: US200621%%803
- Country of Publication:
- United States
- Language:
- English
Similar Records
Asynchronous parallel generating set search for linearly-constrained optimization.
Nonlinearly-constrained optimization using asynchronous parallel generating set search.
APPSPACK 4.0 : asynchronous parallel pattern search for derivative-free optimization.
Technical Report
·
Sun Apr 01 00:00:00 EDT 2007
·
OSTI ID:891372
Nonlinearly-constrained optimization using asynchronous parallel generating set search.
Technical Report
·
Tue May 01 00:00:00 EDT 2007
·
OSTI ID:891372
APPSPACK 4.0 : asynchronous parallel pattern search for derivative-free optimization.
Technical Report
·
Wed Dec 01 00:00:00 EST 2004
·
OSTI ID:891372