Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 6 - Unconstrained Multivariate Gradient-Based Minimization

  • from Part II - From General Mathematical Background to General Nonlinear Programming Problems (NLP)
  • Vassilios S. Vassiliadis, University of Cambridge, Walter Kähm, Ehecatl Antonio del Rio Chanona, Imperial College London, Ye Yuan
  • Book:
    Optimization for Chemical and Biochemical Engineering
    Published online:
    17 December 2020
    Print publication:
    14 January 2021, pp 63-80

  • Summary

    Unconstrained multivariate gradient-based minimization is introduced by means of search direction-producing methods, focusing on steepest descent and Newton's method.Issues with both methods are discussed, highlighting what happens in the case of locally nonconvex functions, particularly in Newton's method.Linesearch is introduced, effectively rendering multidimensional optimization into a sequence of one-dimensional searches along the ray of the search directions produced.Linesearch criteria are discussed, such as the Armijo first condition, and efficient ways to cut the step size are discussed.