The step size is computed using the recursion: \( \alpha \gets \alpha - K \times (\alpha_{max} - \alpha) \). More...
#include <hpp/constraints/iterative-solver.hh>
Public Member Functions | |
FixedSequence () | |
template<typename SolverType > | |
bool | operator() (const SolverType &solver, vectorOut_t arg, vectorOut_t darg) |
Public Attributes | |
value_type | alpha |
value_type | alphaMax |
value_type | K |
The step size is computed using the recursion: \( \alpha \gets \alpha - K \times (\alpha_{max} - \alpha) \).
hpp::constraints::lineSearch::FixedSequence::FixedSequence | ( | ) |
|
inline |
value_type hpp::constraints::lineSearch::FixedSequence::alpha |
value_type hpp::constraints::lineSearch::FixedSequence::alphaMax |
value_type hpp::constraints::lineSearch::FixedSequence::K |