Optimization with sequential simplex of variable size - Maple Application Center
Application Center Applications Optimization with sequential simplex of variable size

Optimization with sequential simplex of variable size

: John Ogilvie
Engineering software solutions from Maplesoft
This Application runs in Maple. Don't have Maple? No problem!
 Try Maple free for 15 days!
We present an algorithm for unconstrained optimization of experimental data in chemical kinetics using as method a sequential simplex of variable size. An animated plot of progress of a triangular simplex descending across a surface of to converge to an absolute minimum illustrates an implementation of this approach.

Application Details

Publish Date: July 31, 2002
Created In: Maple 8
Language: English

More Like This

Classroom Tips and Techniques: Bivariate Limits - Then and Now
Classroom Tips and Techniques: Introduction to Maple's GraphTheory Package
Classroom Tips and Techniques: Steepest-Ascent Curves
Classroom Tips and Techniques: Partial Derivatives by Subscripting
DirectSearch optimization package, version 2
The Nelder-Mead Method for Optimization in Two Dimensions
Fibonacci search method for unimodal optimization
Classroom Tips and Techniques: An Inequality-Constrained Optimization Problem