NOX::LineSearch::FullStep Class Reference

Simplest line search - always take the full step. More...

#include <NOX_LineSearch_FullStep.H>

Inheritance diagram for NOX::LineSearch::FullStep:

Collaboration diagram for NOX::LineSearch::FullStep:
List of all members.

Public Member Functions

 FullStep (NOX::Parameter::List &params)
 ~FullStep ()
bool reset (NOX::Parameter::List &params)
 Reset parameters.
bool compute (NOX::Abstract::Group &newgrp, double &step, const NOX::Abstract::Vector &dir, const NOX::Solver::Generic &s)
 Perform a line search.

Detailed Description

Simplest line search - always take the full step.

This line search can be called via NOX::LineSearch::Manager.

The following parameters can be specified in the "Full Step" sublist of the "Line Search" sublist:

Member Function Documentation

bool FullStep::compute NOX::Abstract::Group newgrp,
double &  step,
const NOX::Abstract::Vector dir,
const NOX::Solver::Generic s

Perform a line search.


  • $x_{\rm new}$ denotes the new solution to be calculated (corresponding to grp)
  • $\lambda$ denotes the step to be calculated (step),
  • $d$ denotes the search direction (dir).
  • $x_{\rm old}$ denotes the previous solution (i.e., the result of s.getPreviousSolutionGroup().getX())

In the end, we should have computed $ \lambda $ and updated grp so that

\[ x_{\rm new} = x_{\rm old} + \lambda d. \]

Ideally, $ \|F(x_{\rm new})\| < \|F(x_{\rm old})\| $.

Implements NOX::LineSearch::Generic.

The documentation for this class was generated from the following files:
Generated on Thu Sep 18 12:40:51 2008 for NOX by doxygen