Generic Optimization Program

Abstract

GenOpt is a generic optimization program for nonlinear, constrained optimization. For evaluating the objective function, any simulation program that communicates over text files can be coupled to GenOpt without code modification. No analytic properties of the objective function are used by GenOpt. Optimization algorithms and numerical methods can be implemented in a library and shared among users. GenOpt offers an interlace between the optimization algorithm and its kernel to make the implementation of new algorithms fast and easy. Different algorithms of constrained and unconstrained minimization can be added to a library. Algorithms for approximation derivatives and performing line-search will be implemented. The objective function is evaluated as a black-box function by an external simulation program. The kernel of GenOpt deals with the data I/O, result storage and report, interlace to the external simulation program, and error handling. An abstract optimization class offers methods to interface the GenOpt kernel and the optimization algorithm library.
Developers:
Release Date:
1998-07-01
Project Type:
Open Source, No Publicly Available Repository
Software Type:
Scientific
Licenses:
Other (Commercial or Open-Source): https://simulationresearch.lbl.gov/GO/license.html
Sponsoring Org.:
Code ID:
54664
Site Accession Number:
4287; CR-1517
Research Org.:
Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
Country of Origin:
United States

Citation Formats

Wetter, Michael. Generic Optimization Program. Computer Software. USDOE. 01 Jul. 1998. Web. doi:10.11578/dc.20210416.26.
Wetter, Michael. (1998, July 01). Generic Optimization Program. [Computer software]. https://doi.org/10.11578/dc.20210416.26.
Wetter, Michael. "Generic Optimization Program." Computer software. July 01, 1998. https://doi.org/10.11578/dc.20210416.26.
@misc{ doecode_54664,
title = {Generic Optimization Program},
author = {Wetter, Michael},
abstractNote = {GenOpt is a generic optimization program for nonlinear, constrained optimization. For evaluating the objective function, any simulation program that communicates over text files can be coupled to GenOpt without code modification. No analytic properties of the objective function are used by GenOpt. Optimization algorithms and numerical methods can be implemented in a library and shared among users. GenOpt offers an interlace between the optimization algorithm and its kernel to make the implementation of new algorithms fast and easy. Different algorithms of constrained and unconstrained minimization can be added to a library. Algorithms for approximation derivatives and performing line-search will be implemented. The objective function is evaluated as a black-box function by an external simulation program. The kernel of GenOpt deals with the data I/O, result storage and report, interlace to the external simulation program, and error handling. An abstract optimization class offers methods to interface the GenOpt kernel and the optimization algorithm library.},
doi = {10.11578/dc.20210416.26},
url = {https://doi.org/10.11578/dc.20210416.26},
howpublished = {[Computer Software] \url{https://doi.org/10.11578/dc.20210416.26}},
year = {1998},
month = {jul}
}