42 #include "MoochoPack_QuasiRangeSpaceStepStd_Strategy.hpp"
43 #include "MoochoPack_NLPAlgoState.hpp"
44 #include "AbstractLinAlgPack_MatrixOpNonsing.hpp"
45 #include "AbstractLinAlgPack_VectorSpace.hpp"
46 #include "AbstractLinAlgPack_LinAlgOpPack.hpp"
48 namespace MoochoPack {
52 ,
const Vector& xo,
const Vector& c_xo, VectorMutable* v
56 using LinAlgOpPack::V_StMtV;
58 &R_k = s->R().get_k(0);
59 VectorSpace::vec_mut_ptr_t
60 vy = R_k.space_rows().create_member();
71 out << L <<
"*** Compute the approximate range space step:\n"
72 << L <<
"vy = inv(R_k) * c_xo\n"
73 << L <<
"v = -Y_k*vy\n";
rSQP Algorithm control class.
void print_step(std::ostream &out, const std::string &leading_str) const
Reduced space SQP state encapsulation interface.
void V_InvMtV(VectorMutable *v_lhs, const MatrixNonsing &M_rhs1, BLAS_Cpp::Transp trans_rhs1, const Vector &v_rhs2)
bool solve_quasi_range_space_step(std::ostream &out, EJournalOutputLevel olevel, NLPAlgo *algo, NLPAlgoState *s, const Vector &xo, const Vector &c_xo, VectorMutable *v)
Solves the range space problem with the old decomposition at x_k.