Nonlinear Global Optimization Using Curdling Algorithm

Software · Fri Mar 01 05:00:00 EST 1996

OSTI ID:1230340

Loehle, Craig

An algorithm for performing curdling optimization which is a derivative-free, grid-refinement approach to nonlinear optimization was developed and implemented in software. This approach overcomes a number of deficiencies in existing approaches. Most notably, it finds extremal regions rather than only single external extremal points. The program is interactive and collects information on control parameters and constraints using menus. For up to four dimensions, function convergence is displayed graphically. Because the algorithm does not compute derivatives, gradients or vectors, it is numerically stable. It can find all the roots of a polynomial in one pass. It is an inherently parallel algorithm. Constraints are handled as being initially fuzzy, but become tighter with each iteration.

• Short Name / Acronym: OPTIMIZE; 001077MLTPL00
• Version: 00
• Programming Language(s): Medium: X; OS: UNIX
• Research Organization: Argonne National Laboratory (ANL), Argonne, IL (United States)
• Sponsoring Organization: DOE/ER
• DOE Contract Number: P
• OSTI ID: 1230340
• Country of Origin: United States