#include <alpaqa/problem/sparsity-conversions.hpp>
#include <alpaqa/problem/sparsity.hpp>
#include <alpaqa/qpalm/qpalm-adapter.hpp>
#include <qpalm/sparse.hpp>
#include <cmath>
#include <stdexcept>
Go to the source code of this file.
|
| bool | is_bound (const Box< config_t > &C, index_t i) |
| |
| void | add_bound_constr_to_constr_matrix (ladel_sparse_matrix &A, const Box< config_t > &C) |
| | Update the constraint matrix A, such that for each constraint C(i) with finite bounds, a row is inserted into A with a one in the i-th column.
|
| |
| void | combine_bound_constr (Box< config_t > &b, const Box< config_t > &C, const Box< config_t > &D, crvec g) |
| | For each constraint C(i) with finite bounds, insert these bounds into b(i), followed by all bounds D, shifted by g.
|
| |
| int | convert_symmetry (sparsity::Symmetry symmetry) |
| |
| OwningQPALMData | build_qpalm_problem (const TypeErasedProblem< EigenConfigd > &problem) |
| |