The class HCL_TrustRegionSolver_d is an abstract base clase for algorithms for solving the trust region subproblem:min q(s) = <g,s> + 1/2<s,Bs> s
![]() | Parameters () The method Parameters returns the parameter table of the algorithm |
![]() | SetScaling ( HCL_LinearOpAdjInv_d * S ) Alternate version of SetScaling. |
![]() | SetScaling ( HCL_LinearOpAdj_d * S, HCL_LinearSolver_d * lsolver ) SetScaling defines a new inner product in terms of a symmetric, positive definite operator S: <x,y> = (x,Sy) |
![]() | Solve ( const HCL_LinearOp_d & B, const HCL_Vector_d & g, HCL_Vector_d & p ) The method Solve attempts to compute an approximate solution of the trust region subproblem defined by the inputs of the method |
![]() | UnSetScaling () UnSetScaling returns the inner product to the default. |
The class HCL_TrustRegionSolver_d is an abstract base clase for algorithms for solving the trust region subproblem:min q(s) = <g,s> + 1/2<s,Bs> s.t. <s,Cs> <= Delta^2
where g is a given vector, B is a symmetric linear operator, and C is a symmetric and positive definite linear operator.
double MinStep
double MaxStep
double Multiplier
virtual void SetScaling( HCL_LinearOpAdj_d * S, HCL_LinearSolver_d * lsolver )
virtual void SetScaling( HCL_LinearOpAdjInv_d * S )
virtual void UnSetScaling()
virtual void Solve( const HCL_LinearOp_d & B, const HCL_Vector_d & g, HCL_Vector_d & p )
this page has been generated automatically by doc++
(c)opyright by Malte Zöckler, Roland Wunderling
contact: doc++@zib.de