lcp.hpp File Reference

Classes
class	mundy::LCP< Backend, LinearOp, QVector, Workspace >
	Linear complementarity problem (LCP) formulation. More...

Namespaces
namespace	mundy

Functions
template<class Backend, class LinearOp, class QVector>
auto	mundy::to_cqpp (const LCP< Backend, LinearOp, QVector > &P)
	Reduce an LCP to the equivalent non-negativity-constrained CQPP (x >= 0).
Factory functions
template<typename Backend, typename LinearOp, typename QVector>
auto	mundy::make_lcp (LinearOp &&A, QVector &&q)
template<typename Backend, typename LinearOpDT, typename LinearOpM, typename LinearOpD, typename QVector>
auto	mundy::make_lcp (LinearOpDT &&DT, LinearOpM &&M, LinearOpD &&D, QVector &&q)
template<typename Backend, typename LinearOpDT, typename LinearOpM, typename LinearOpD, typename QVector, typename FVector, typename UVector>
auto	mundy::make_lcp (LinearOpDT &&DT, LinearOpM &&M, LinearOpD &&D, QVector &&q, FVector &&f, UVector &&u)
template<typename Backend, typename LinearOp, typename QVector, typename Workspace>
auto	mundy::make_lcp (LinearOp &&A, QVector &&q, Workspace &&workspace)
template<class Problem, class Strategy, class State>
auto	mundy::solve_lcp (const Problem &prob, const Strategy &strat, State &state)
	Solve a linear complementarity problem (LCP): 0 <= A x + q _|_ x >= 0.