skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information



SGOPT is a C++ library that includes implementations of several algorithms for stochastic global optimization and derivative free optimization.

Publication Date:
Research Org.:
Sandia National Laboratories
Sponsoring Org.:
OSTI Identifier:
Report Number(s):
SGOPTV2; 001376MLTPL00
DOE Contract Number:
Resource Type:
Software Revision:
Software Package Number:
Software Package Contents:
Abstract, Readme file, Media includes Media Directory, Source Code, Compilation Instructions, Installation Instructions, User Guide, and Linking instructions.
Software CPU:
Open Source:
Source Code Available:
Other Software Info:
There is no commercial interest.
Country of Publication:
United States

Citation Formats

Hart, William E. C++ LIBRARY OF ALOGRITHMS FOR STOCHASTIC GLOBAL OPTIMIZATION. Computer software. Vers. 00. USDOE. 25 Oct. 2001. Web.
Hart, William E. (2001, October 25). C++ LIBRARY OF ALOGRITHMS FOR STOCHASTIC GLOBAL OPTIMIZATION (Version 00) [Computer software].
Hart, William E. C++ LIBRARY OF ALOGRITHMS FOR STOCHASTIC GLOBAL OPTIMIZATION. Computer software. Version 00. October 25, 2001.
author = {Hart, William E.},
abstractNote = {SGOPT is a C++ library that includes implementations of several algorithms for stochastic global optimization and derivative free optimization.},
doi = {},
year = 2001,
month = ,
note =

To order this software, request consultation services, or receive further information, please fill out the following request.

Save / Share:
  • GENI Project: Sandia National Laboratories is working with several commercial and university partners to develop software for market management systems (MMSs) that enable greater use of renewable energy sources throughout the grid. MMSs are used to securely and optimally determine which energy resources should be used to service energy demand across the country. Contributions of electricity to the grid from renewable energy sources such as wind and solar are intermittent, introducing complications for MMSs, which have trouble accommodating the multiple sources of price and supply uncertainties associated with bringing these new types of energy into the grid. Sandia’s software willmore » bring a new, probability-based formulation to account for these uncertainties. By factoring in various probability scenarios for electricity production from renewable energy sources in real time, Sandia’s formula can reduce the risk of inefficient electricity transmission, save ratepayers money, conserve power, and support the future use of renewable energy.« less
  • A novel algorithm for the global optimization of functions (C-RTS) is presented, in which a combinatorial optimization method cooperates with a stochastic local minimizer. The combinatorial optimization component, based on the Reactive Tabu Search proposed by the authors and based on Glover`s Tabu Search, locates the most promising {open_quotes}boxes{close_quotes}, where starting points for the local minimizer are generated. The method is designed with adaptive mechanisms: the box size is adapted to the local structure of the function to be optimized, the search parameters are adapted to obtain a proper balance of exploration and exploitation. The RTS algorithm is briefly described,more » with the related software engineering and VLSI realization projects. Then the modifications to obtain C-RTS are motivated and discussed, and some experimental results are presented for a suite of benchmark tasks.« less
  • We discuss new global optimization algorithms that are related to the stochastic methods of Rinnooy Kan and Timmer, and to our previous static, synchronous parallel version of this method. The new algorithms have two main new features. First, they adaptively concentrate the computation in the areas of the domain space that appear most likely to produce the global minimum. Secondly, on parallel computers, they use an asynchronous approach, combined with a central work scheduler, to avoid load balancing problems. We investigate several mechanisms for deciding when and how to make the adaptive adjustments. We also describe both algorithmic and implementationmore » considerations involved in constructing the parallel asynchronous algorithm. Computational tests on sequential and parallel computers show that the adaptive and asynchronous features of our new method can substantially reduce the number of function evaluations, and the execution time, required by previous stochastic methods to solve global optimization problems.« less
  • A stochastic approach to solving continuous function global optimization problems is presented. It builds on the tunneling approach to deterministic optimization presented by Barhen et al, by combining a series of local descents with stochastic searches. The method uses a rejection-based stochastic procedure to locate new local minima descent regions and a fixed Lipschitz-like constant to reject unpromising regions in the search space, thereby increasing the efficiency of the tunneling process. The algorithm is easily implemented in low-dimensional problems and scales easily to large problems. It is less effective without further heuristics in these latter cases, however. Several improvements tomore » the basic algorithm which make use of approximate estimates of the algorithms parameters for implementation in high-dimensional problems are also discussed. Benchmark results are presented, which show that the algorithm is competitive with the best previously reported global optimization techniques. A successful application of the approach to a large-scale seismology problem of substantial computational complexity using a low-dimensional approximation scheme is also reported.« less
  • Simulated annealing has been widely used in the solution of optimization problems. As known by many researchers, the global optima cannot be guaranteed to be located by simulated annealing unless a logarithmic cooling schedule is used. However, the logarithmic cooling schedule is so slow that no one can afford to have such a long CPU time. This paper proposes a new stochastic optimization algorithm, the so-called simulated stochastic approximation annealing algorithm, which is a combination of simulated annealing and the stochastic approximation Monte Carlo algorithm. Under the framework of stochastic approximation Markov chain Monte Carlo, it is shown that themore » new algorithm can work with a cooling schedule in which the temperature can decrease much faster than in the logarithmic cooling schedule, e.g., a square-root cooling schedule, while guaranteeing the global optima to be reached when the temperature tends to zero. The new algorithm has been tested on a few benchmark optimization problems, including feed-forward neural network training and protein-folding. The numerical results indicate that the new algorithm can significantly outperform simulated annealing and other competitors.« less

To initiate an order for this software, request consultation services, or receive further information, fill out the request form below. You may also reach us by email at: .

OSTI staff will begin to process an order for scientific and technical software once the payment and signed site license agreement are received. If the forms are not in order, OSTI will contact you. No further action will be taken until all required information and/or payment is received. Orders are usually processed within three to five business days.

Software Request