We've updated our Privacy Policy to make it clearer how we use your personal data.

We use cookies to provide you with a better experience. You can read our Cookie Policy here.

Advertisement

Chemists’ Guide for Solving Optimization Problems now Available from NAG


Want a FREE PDF version of This Product News?

Complete the form below and we will email you a PDF version of "Chemists’ Guide for Solving Optimization Problems now Available from NAG"

Technology Networks Ltd. needs the contact information you provide to us to contact you about our products and services. You may unsubscribe from these communications at any time. For information on how to unsubscribe, as well as our privacy practices and commitment to protecting your privacy, check out our Privacy Policy

Worldwide chemists designing the most cost-effective purification systems can get easy to follow step-by-step instructions on how to select the best-suited local or global optimization routines, from the Numerical Algorithms Group (NAG) Library, by making use of the Decision Trees for optimization, according to NAG.

NAG, a not-for-profit numerical software development organization, devotes R&D resources to continually advance methods for solving optimization problems and similar computational challenges. The NAG Decision Trees are part of the documentation for one of the most rigorously tested and documented sets of optimization routines and other mathematical and statistical algorithms in the world, collected into the Numerical Algorithms Group Library. The NAG Library of routines, including the optimization chapters, can be called from diverse environments such as C++, Fortran, MATLAB and R.

Many of those who use NAG’s routines, as the building blocks of their applications, rely on the knowledge base in NAG’s exhaustive documentation as a part of the “future-proofing” of their application development investments. The Decision Trees, which are a feature of this documentation, are especially useful in helping both new and experienced users to select the appropriate routine for the problem at hand in a matter of minutes.

Dr. David Sayers, a Principal Technical Consultant at NAG commenting on the complexities of selecting optimization algorithms says, ‘For maximum efficiency, different algorithms should be used for a different problem types. Often these types are characterized by the type of objective function – that is to be minimized or maximized – and by the types of constraints that are to be applied. Objective functions might be linear, quadratic (positive-definite or indefinite) or nonlinear. They may have a special form, like a sum of squares. They may be sparse or dense and they may be smooth or discontinuous. Combine these with the options for constraints: none, simple bound, linear or genuine nonlinear and we can see that a comprehensive chapter of optimization routines can be very large. To help the user to choose the right routine decision trees are invaluable.’
Advertisement