The step size is computed using the formula \( \alpha_{i} = C - K \times \text{tanh}(a \frac{\|f(\mathbf{q}_i)\|}{\epsilon^2} + b) \), where. More...
#include <hpp/constraints/solver/hierarchical-iterative.hh>
Public Member Functions | |
| ErrorNormBased (value_type alphaMin, value_type _a, value_type _b) | |
| ErrorNormBased (value_type alphaMin=0.2) | |
| template<typename SolverType > | |
| bool | operator() (const SolverType &solver, vectorOut_t arg, vectorOut_t darg) |
Public Attributes | |
| value_type | C |
| value_type | K |
| value_type | a |
| value_type | b |
The step size is computed using the formula \( \alpha_{i} = C - K \times \text{tanh}(a \frac{\|f(\mathbf{q}_i)\|}{\epsilon^2} + b) \), where.
| hpp::constraints::solver::lineSearch::ErrorNormBased::ErrorNormBased | ( | value_type | alphaMin, |
| value_type | _a, | ||
| value_type | _b | ||
| ) |
| hpp::constraints::solver::lineSearch::ErrorNormBased::ErrorNormBased | ( | value_type | alphaMin = 0.2 | ) |
|
inline |
| value_type hpp::constraints::solver::lineSearch::ErrorNormBased::a |
| value_type hpp::constraints::solver::lineSearch::ErrorNormBased::b |
| value_type hpp::constraints::solver::lineSearch::ErrorNormBased::C |
| value_type hpp::constraints::solver::lineSearch::ErrorNormBased::K |