min qp_grad' * pz + (1/2) * pz' * rHL * pz.
More...
#include <MoochoPack_TangentialStepWithoutBounds_Step.hpp>
Inheritance diagram for MoochoPack::TangentialStepWithoutBounds_Step:
Overridden from AlgorithmStep | |
| bool | do_step (Algorithm &algo, poss_type step_poss, IterationPack::EDoStepType type, poss_type assoc_step_poss) |
| | |
| void | print_step (const Algorithm &algo, poss_type step_poss, IterationPack::EDoStepType type, poss_type assoc_step_poss, std::ostream &out, const std::string &leading_str) const |
| | |
min qp_grad' * pz + (1/2) * pz' * rHL * pz.
The solution to this system is just:
pz = inv(rHL) *qp_grad.
If use_qp_correc is false then:
qp_grad = rGf else
qp_grad = rGf + zeta * ZtHLYpy.
Then
Zpz = Z * pz
Definition at line 49 of file MoochoPack_TangentialStepWithoutBounds_Step.hpp.
|
||||||||||||||||||||
|
Definition at line 53 of file MoochoPack_TangentialStepWithoutBounds_Step.cpp. |
|
||||||||||||||||||||||||||||
|
Definition at line 135 of file MoochoPack_TangentialStepWithoutBounds_Step.cpp. |
1.3.9.1