Exeter Software

Index to site:

Search our site

Order form

 

Loehle optimization software

Global Optimization 4.2 for Mathematica

Global Optimization 4.2 for Mathematica is a collection of functions for constrained and unconstrained global nonlinear optimization. It uses the Mathematica system as an interface for defining the nonlinear system to be solved and for computing function numeric values. Any function computable by Mathematica can be used as input, including degree of fit of a model against data, black-box functions, and simulation models. In use since early 1998, the package is well tested by a worldwide community of users.

Ten functions are provided in the package.

bulletThe function GlobalSearch is a hill-climbing algorithm for nonlinear functions with analytic equality and inequality constraints. It is designed to be robust to local minima and to solve problems with hundreds of variables. No derivatives are required, and the user objective function can even be nondifferentiable. Multiple starts allow the user to find multiple minima if they exist. This function is ideal for nonlinear regression, engineering design, model estimation, financial analysis, and other applications. Bounds are not required, nor is a close initial guess needed.  
bulletThe function GlobalPenaltyFn is a hill-climbing algorithm for nonlinear functions with nonanalytic equality and inequality constraints. It is designed to be robust to local minima and to solve problems with hundreds of variables. No derivatives are required, and the user objective function can even be nondifferentiable. Multiple starts allow the user to find multiple minima if they exist. Bounds are not required, nor is a close initial guess needed. 
bulletThe function IntervalMin solves problems using interval methods. It is designed to be robust to local minima, and the problems can have inequality constraints. No derivatives are required, and the user objective function can even be nondifferentiable. This function is ideal for nonlinear regression, engineering design, model estimation, financial analysis, and other applications. 
bulletThe function MultiStartMin is a hill-climbing algorithm for constrained (including bound constrained) and unconstrained nonlinear functions. It is designed to be robust to local minima and to solve midsized problems (up to 15 variables). No derivatives are required, and the user objective function can even be nondifferentiable. Multiple starts allow the user to find multiple minima if they exist. Variables can be any mix of continuous, integer, and discrete. The integer feature allows knapsack and similar problems to be solved. This function is ideal for nonlinear regression, engineering design, model estimation, financial analysis, and other applications. Bounds are not required, nor is a close initial guess needed. 
bulletThe function NLRegression solves nonlinear regression problems. A sensitivity analysis of parameter values around the solution point is provided. Confidence intervals are computed. Both L1 and L2 norms can be used. Constrained regression problems can also be solved. 
bulletThe function MaxLikelihood solves maximum likelihood estimation problems. Summary statistics are provided. Problems can be constrained to obtain better solutions. A library of common univariate functions that are optimized for speed is provided. The function InterchangeMethodMin is a function for 0-1 integer problems with a linear or nonlinear objective function. It can solve routing, traveling salesman, minimal spanning tree, and other discrete network problems even when the objective function is nonlinear. 
bulletThe function TabuSearchMin is a function for 0-1 integer problems with a linear or nonlinear objective function and is related to the interchange method approach described above. The tabu feature increases efficiency on complex problems. It can solve routing, traveling salesman, minimal spanning tree, and other discrete network problems even when the objective function is nonlinear. 
bulletThe function GlobalMinima solves smaller constrained or unconstrained global nonlinear models. This algorithm is based on the identification of feasible points that define the solution set at each iteration. As lower points are found during the grid refinement process, points far from the current optimum are pruned from the solution set. As a result, multiple minima, if they exist, can be found in a single run. The algorithm can also identify optimal regions rather than only single points. These optimal regions might represent the bounds on feasible management strategies that achieve an equivalent result, or they might depict confidence limits for a parameter estimation problem. 
bulletThe function MaxAllocation is designed for allocation problems such as arise in investment, where a fixed amount of money is to be allocated across a series of investment options. Such problems have a single equality constraint and a positivity restriction on all variables. The path-following algorithm used is able to solve this type of problem with high efficiency, leading to the solution of problems with many hundreds to over one thousand variables. This function is ideal for quadratic programming, investment allocation, and hedge fund creation applications. 

Developed and supported by Loehle Enterprises. Registered users receive free updates.

Global Optimization 4.2 requires Mathematica 3 or later and is available for all Windows platforms (95 and later), Macintosh, Linux, and all Unix platforms.

Global Penalty Function for C++

Global Penalty Function is an algorithm for constrained and unconstrained global nonlinear optimization. The function is a C++ translation of the popular Global Optimization for Mathematica GlobalPenaltyFn routine. The solver comes as a dll, with public subroutines for user definition of equations. Program written in ANSI C++ for complete portability. One function is provided in the package. A hill-climbing algorithm is used for nonlinear functions with analytic or nonanalytic equality and/or inequality constraints. It is designed to be robust to local minima and to solve problems with hundreds of variables. No derivatives are required, and the user objective function can even be nondifferentiable. Multiple starts allow the user to find multiple minima if they exist. Bounds are not required, nor is a close initial guess needed. The algorithm is extremely robust and is quite efficient.

Advanced Modern Control for Mathematica

Advanced Modern Control is an optimal projection controller design and model reduction package for use with Control System Professional (CSP). With the continuous controller design software, one may compute a full- or reduced-order controller for a continuous plant subject to certain H2 norm and/or H-infinity norm specifications. Likewise, the continuous model reduction software permits reduction of a continuous model subject to certain H2 norm specifications and, if so desired, also subject to certain H-infinity norm specifications. The discrete controller design software facilitates computing a full- or reduced-order controller for a discrete model subject to certain H2 norm specifications. Similarly, the discrete model reduction software allows reduction of a discrete model subject to certain H2 norm specifications.

Advanced Modern Control for Matlab

Advanced Modern Control is an optimal projection controller design and model reduction package. With the continuous controller design software, one may compute a full- or reduced-order controller for a continuous plant subject to certain H2 norm and/or H-infinity norm specifications. Likewise, the continuous model reduction software permits reduction of a continuous model subject to certain H2 norm specifications and, if so desired, also subject to certain H-infinity norm specifications. The discrete controller design software facilitates computing a full- or reduced-order controller for a discrete model subject to certain H2 norm specifications. Similarly, the discrete model reduction software allows reduction of a discrete model subject to certain H2 norm specifications.

Requirements: see above for each program.

Cost: Global Optimization  4.2 $595 , Global Penalty C++ code library $2,000, and Advanced Modern Control $495. Available for WIN, MAC, and Unix/Linux.

Ordering information:        
Orders may be placed by mail, e-mail, FAX, phone
, or by our secure order form

 

Payment can be made by American Express, MasterCard, VISA, money order, or checks drawn on US banks. Institutional purchase orders are also accepted within the USA. Call, FAX, or e-mail to place your order today! Orders will be sent out promptly. Shipping costs. Return policy. Try our convenient Currency converter.

e-mail: sales@exetersoftware.com
Phone:
1-631 339 4764, Toll-free within USA: 1-888-695-0285
FAX: 1-713-422-2361
47 Route 25A, Suite 2, Setauket, NY 11733-2870 USA
Request additional information.