skip to main content
Department of Computer Science University of Colorado Boulder
cu: home | engineering | mycuinfo | about | cu a-z | search cu | contact cu cs: about | calendar | directory | catalog | schedules | mobile | contact cs
home · events · colloquia · 2002-2003 · 
 

Colloquium - Kolda

 
10/3/2002
3:30pm-4:30pm
ECCR 265

An Asynchronous and Fault-Tolerant Pattern Search Method for Science and Engineering Optimization Applications
Sandia National Laboratories - Livermore

Pattern search is a derivative-free optimization method that is widely applicable to science and engineering optimization. We have extended the parallel version of pattern search to be both asynchronous and fault-tolerant, resulting in the Asynchronous Parallel Pattern Search (APPS) algorithm. This method has proven to be extremely effective on several engineering problems at Sandia National Labs and elsewhere. We will discuss issues of the parallelization, the convergence analysis, and future challenges.

Sponsored jointly with the Department of Applied Mathematics.
Hosted by Richard Byrd.
Refreshments will be served immediately following the talk in ECOT 831.


The Department holds colloquia throughout the Fall and Spring semesters. These colloquia, open to the public, are typically held on Thursday afternoons, but sometimes occur at other times as well. If you would like to receive email notification of upcoming colloquia, subscribe to our Colloquia Mailing List. If you would like to schedule a colloquium, see Colloquium Scheduling.

Sign language interpreters are available upon request. Please contact Stephanie Morris at least five days prior to the colloquium.

 
See also:
Department of Computer Science
College of Engineering and Applied Science
University of Colorado Boulder
Boulder, CO 80309-0430 USA
Questions/Comments?
Send email to

Engineering Center Office Tower
ECOT 717
+1-303-492-7514
FAX +1-303-492-2844
XHTML 1.0/CSS2 ©2012 Regents of the University of Colorado
Privacy · Legal · Trademarks
May 5, 2012 (13:29)
 
.