Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Basic Descent Structure of Local Methods

The fundamental structure of local iterative techniques for solving unconstrained minimization problems is simple. A starting point is chosen, a direction of movement is prescribed according to some algorithm, and a line search [Pg.20]

The basic structure of an iterative local optimization algorithm is one of greedy descent . It is based on one of the following two algorithmic frameworks line-search or trust-region methods. Both are found throughout the literature and in software packages and are essential components of effective... [Pg.1146]

See other pages where Basic Descent Structure of Local Methods is mentioned: [Pg.20] [Pg.21] [Pg.23] [Pg.25] [Pg.27] [Pg.20] [Pg.21] [Pg.23] [Pg.25] [Pg.27] [Pg.18]

SEARCH

Basic descent

Basic methods

Basic structure

Basicity structures

Local structure

Local structuring

Localization methods

Structural methods