#include <decomp.h>
Collaboration diagram for Decomposition:
Public Member Functions | |
Decomposition (Pointer< Param > param_=NULL) | |
(Default-)Constructor. | |
void | set_sparsity_pattern (MinlpProblem &prob, const vector< vector< dvector > > &sample_set) |
Pointer< MinlpProblem > | decompose (MinlpProblem &prob, vector< vector< dvector > > &sample_set) |
Decompose a problem. | |
Pointer< MinlpProblem > | decompose (MinlpProblem &prob, vector< Pointer< SplittingScheme2 > > &ss) |
void | decompose (SepQcFunc &f, int block_offset, const SepQcFunc &old_f, int k, const SplittingScheme2 &ss, Pointer< dvector > primal) |
Pointer< SplittingScheme2 > | get_splittingscheme (MinlpProblem &prob, int blocknr) |
Pointer< SepQcFunc > | decompose (Pointer< Func > old_f, const dvector &primal) |
Public Attributes | |
Pointer< set< int > > | I_var |
Private Attributes | |
bool | replace_if_quadratic |
Indicates, whether a (s-)function should be replaced, if it seems to be quadratic (constant hessian). | |
int | avg_blocksize |
The average block size, we should try to achieve. | |
Pointer< Param > | param |
Parameters. |
Constructs also sparsity pattern and computes nonlinear and nonquadratic variable indices.
Decomposition | replace quadratic options 0 or 1 default 1 If 1, (s-)functions with constant hessians are replaced by their quadratic approximation. | |
Decomposition | average blocksize options integer $ 1$ default 5 level 1 The average blocksize, we should try to partition the sparsity graph into. |
Definition at line 261 of file decomp.h.
void Decomposition::set_sparsity_pattern | ( | MinlpProblem & | prob, | |
const vector< vector< dvector > > & | sample_set | |||
) |
Pointer<MinlpProblem> Decomposition::decompose | ( | MinlpProblem & | prob, | |
vector< vector< dvector > > & | sample_set | |||
) |
Decompose a problem.
Computes sparsity patterns and indices of quadratic and nonquadratic variables. Decompose sparsity-graphs. Constructs SplittingScheme. Decompose problem according to this information.
ss | A reference to a Pointer, where we can store the SplittingScheme in. | |
prob | The problem to decompose. | |
sample_set | Points to compute the hessian for to get sparsity pattern, needed for functions, where s[k]!=NULL. |
Pointer<MinlpProblem> Decomposition::decompose | ( | MinlpProblem & | prob, | |
vector< Pointer< SplittingScheme2 > > & | ss | |||
) |
void Decomposition::decompose | ( | SepQcFunc & | f, | |
int | block_offset, | |||
const SepQcFunc & | old_f, | |||
int | k, | |||
const SplittingScheme2 & | ss, | |||
Pointer< dvector > | primal | |||
) |
Pointer<SplittingScheme2> Decomposition::get_splittingscheme | ( | MinlpProblem & | prob, | |
int | blocknr | |||
) |
bool Decomposition::replace_if_quadratic [private] |
int Decomposition::avg_blocksize [private] |
Pointer<Param> Decomposition::param [private] |
Pointer<set<int> > Decomposition::I_var |