#include <proxsuite/linalg/dense/core.hpp>#include <proxsuite/linalg/sparse/core.hpp>#include <proxsuite/linalg/sparse/factorize.hpp>#include <proxsuite/linalg/sparse/update.hpp>#include <proxsuite/linalg/sparse/rowmod.hpp>#include <proxsuite/proxqp/timings.hpp>#include <proxsuite/proxqp/settings.hpp>#include <proxsuite/proxqp/dense/views.hpp>#include <proxsuite/linalg/veg/vec.hpp>#include "proxsuite/proxqp/sparse/views.hpp"#include "proxsuite/proxqp/sparse/model.hpp"#include "proxsuite/proxqp/results.hpp"#include "proxsuite/proxqp/sparse/utils.hpp"#include <memory>#include <Eigen/IterativeLinearSolvers>#include <unsupported/Eigen/IterativeSolvers>Go to the source code of this file.
Classes | |
| struct | proxsuite::proxqp::sparse::Ldlt< T, I > |
| struct | proxsuite::proxqp::sparse::Workspace< T, I > |
| This class defines the workspace of the sparse solver. More... | |
Namespaces | |
| namespace | proxsuite |
| namespace | proxsuite::proxqp |
| namespace | proxsuite::proxqp::sparse |
Macros | |
| #define | PROX_QP_ALL_OF(...) |
| #define | PROX_QP_ANY_OF(...) |
Functions | |
| template<typename T, typename I> | |
| void | proxsuite::proxqp::sparse::refactorize (Workspace< T, I > &work, Results< T > const &results, Settings< T > const &settings, proxsuite::linalg::sparse::MatMut< T, I > kkt_active, proxsuite::linalg::veg::SliceMut< bool > active_constraints, Model< T, I > const &data, proxsuite::linalg::veg::dynstack::DynStackMut stack, proxsuite::linalg::veg::Tag< T > &xtag) |
| #define PROX_QP_ALL_OF | ( | ... | ) |
| #define PROX_QP_ANY_OF | ( | ... | ) |