Sandia National Laboratories

Changes between Version 7 and Version 8 of WikiStart


Ignore:
Timestamp:
09/09/09 11:04:53 (9 years ago)
Author:
tplante
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • WikiStart

    v7 v8  
    11= Hybrid Optimization Parallel Search PACKage = 
    22 
    3 HOPSPACK solves derivative-free optimization problems with a C++ software framework.  The framework enables parallel operation using MPI (for distributed machine architectures) and multithreading (for single machines with multiple processors or cores).  Optimization problems can be very general: linear and nonlinear constraints are supported, and variables may be continuous or integer-valued.  Functions can be noisy, nonsmooth, and nonconvex.  HOPSPACK is released with two user communities in mind:  those who need an optimization problem solved, and those who wish to experiment with writing their own derivative-free solvers. 
     3HOPSPACK solves derivative-free optimization problems in a C++ software framework.  The framework enables parallel operation using MPI (for distributed machine architectures) and multithreading (for single machines with multiple processors or cores).  Optimization problems can be very general: functions can be noisy, nonsmooth and nonconvex, linear and nonlinear constraints are supported, and variables may be continuous or integer-valued.  HOPSPACK is released with two user communities in mind:  those who need an optimization problem solved, and those who wish to experiment with writing their own derivative-free solvers. 
    44 
    55Go to the Quick Start (TBD) page for instructions on using a precompiled binary. 
     
    99 
    1010 * Only function values are required for the optimization. 
    11  * The user simply provides a program that can evaluate the objective and nonlinear constraint functions at a given point.  The program runs separately from HOPSPACK for maximum flexibility. 
    12  * HOPSPACK can be run in parallel on a cluster of computers or on multi-core machines. 
    13  * A robust implementation of the Generating Set Search (GSS) algorithm is supplied. 
     11 * The user simply provides a separate program that can evaluate the objective and nonlinear constraint functions at a given point. 
     12 * Parallel resources are used and automatically load balanced, on either a cluster of computers or multi-core machines. 
     13 * A robust implementation of the Generating Set Search (GSS) solver is supplied. 
    1414 * Souce code builds on Linux, Windows, and Mac OSX using native compilers. 
    1515 * Multiple solvers can run simultaneously and are easily configured to share information.