New Features in DOT Version 6.0

DOTTM Version 6 represents a major rewrite and enhancement of Versions 5.x. Following is a partial list of enhancements contained in Version 6.0.

  • A few minor bugs have been corrected to make the basic optimization capability more robust. Most of these fixes are transparent to the average user, but are important to the overall reliability of the program. We have solved thousands of optimization problems in our quest to make DOT as robust as possible.
  • The Golden Section Method is now available for use in the one-dimensional search. After the bounds have been reduced to the desired tolerance, polynomial interpolation is applied for a final refinement. If function evaluations are cheap, tightening the Golden Section tolerance will usually provide a better optimum.
  • Major changes were made in the Modified Method of Feasible Directions (METHOD=1) to better follow curved constraints.
  • Major changes were made in the Sequential Quadratic Programming Method, including addition of the Golden Section Method in the one-dimensional search.
  • A SIMPLEX algorithm with built in upper bounds has been added to the Sequential Linear Programming Method (METHOD=2). In the past, the Modified Method of Feasible Directions was used to solve the linear sub-problem.
  • Significant enhancements have been made to the Sequential Quadratic Programming algorithm (METHOD=3) to improve efficiency and robustness.
  • Memory allocation has been greatly simplified.
  • Subroutine DOT510, which estimates memory requirements, is still available to provide desired and maximum memory requirements. DOT510 no longer provides a minimum memory value since this unnecessarily restricted memory.
  • Print levels have been modified to reduce the amount of output for lower IPRINT values.

For more information please contact

Follow Us: Facebook Youtube