|
Mundy: Multibody Nonlocal Dynamics Version of the Day
|
Constrained quadratic programming problem (CQPP) formulation. More...
#include <convex.hpp>
Public Types | |
| using | backend_t = Backend |
| using | linear_op_storage_t = LinearOpStorage |
| using | vector_storage_t = QVectorStorage |
| using | linear_op_t = impl::unwrapped_storage_t<linear_op_storage_t> |
| using | vector_t = impl::unwrapped_storage_t<vector_storage_t> |
| using | space_t = ConvexSpace |
| using | workspace_t = Workspace |
| using | value_type = impl::vector_value_type<vector_t> |
Public Member Functions | |
| CQPPProblem (Backend, linear_op_storage_t A, vector_storage_t q, const space_t &space) | |
| CQPPProblem (Backend, linear_op_storage_t A, vector_storage_t q, const space_t &space, workspace_t workspace) | |
| Backend | backend () const |
| const auto & | A () const |
| const auto & | q () const |
| const space_t & | space () const |
| workspace_t & | workspace () const |
This is for a constrained quadratic programming problem of the form: x^* = argmin_{x in Omega} 0.5 x^T A x + q^T x where A is a symmetric positive semi-definite matrix, q is a vector, and Omega is a convex space.
| Backend | The backend to use for operations (e.g., KokkosBackend, MundyMathBackend) |
| using mundy::convex::CQPPProblem< Backend, LinearOpStorage, QVectorStorage, ConvexSpace, Workspace >::backend_t = Backend |
| using mundy::convex::CQPPProblem< Backend, LinearOpStorage, QVectorStorage, ConvexSpace, Workspace >::linear_op_storage_t = LinearOpStorage |
| using mundy::convex::CQPPProblem< Backend, LinearOpStorage, QVectorStorage, ConvexSpace, Workspace >::vector_storage_t = QVectorStorage |
| using mundy::convex::CQPPProblem< Backend, LinearOpStorage, QVectorStorage, ConvexSpace, Workspace >::linear_op_t = impl::unwrapped_storage_t<linear_op_storage_t> |
| using mundy::convex::CQPPProblem< Backend, LinearOpStorage, QVectorStorage, ConvexSpace, Workspace >::vector_t = impl::unwrapped_storage_t<vector_storage_t> |
| using mundy::convex::CQPPProblem< Backend, LinearOpStorage, QVectorStorage, ConvexSpace, Workspace >::space_t = ConvexSpace |
| using mundy::convex::CQPPProblem< Backend, LinearOpStorage, QVectorStorage, ConvexSpace, Workspace >::workspace_t = Workspace |
| using mundy::convex::CQPPProblem< Backend, LinearOpStorage, QVectorStorage, ConvexSpace, Workspace >::value_type = impl::vector_value_type<vector_t> |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |