PolynomialUnderestimator2 Class Reference

Class to compute Polynomial underestimators of nonconvex functions. More...

#include <polynom.h>

Collaboration diagram for PolynomialUnderestimator2:

Public Member Functions
	PolynomialUnderestimator2 (Pointer< Param > param_=NULL)
void	polynomial_underestimator (MinlpProblem &prob, MINLPData &minlpdata, ivector &ineq_index, SparseVector< double > &obj_c_add, vector< SparseVector< double > > &con_c_add)
Pointer< SepQcFunc >	polynomial_underestimator (Pointer< SepQcFunc > f, bool eq, dvector &lower, dvector &upper, dvector &primal)
void	new_sampleset (const dvector &lower, const dvector &upper)
void	check_for_nan (const Func &f)
bool	add_point_to_sampleset (const dvector &point)
bool	add_minimizer_to_sample (Pointer< Func > f, const dvector &lower, const dvector &upper, dvector &start)
void	remove_last_point_from_sample ()
void	check (MinlpProblem &prob, MinlpProblem &quad, ivector &ineq_index)
Public Attributes
SparseVector< double >	c_add1
SparseVector< double >	c_add2
Private Member Functions
void	new_multiindices (const SparsityInfo &si, int n)
void	polynomial_underestimator (SparseMatrix2 &A, SparseVector< double > &b, double &c, Func &f, ivector &indices)
Private Attributes
Pointer< Param >	param
int	max_degree
int	maxdegree1_size
int	maxdegree2_size
Sampling	sampling0
Sampling	sampling1
Sampling	sampling2
Sampling_Vertices	sampling_vertices
Sampling_Minimizer	sampling_minimizer
int	sampling_initial
vector< dvector >	sample_set
ivector	ss_size
list< MultiIndex >	multiindices
list< Monom >	monoms
Decomposition	decomp

Detailed Description

Class to compute Polynomial underestimators of nonconvex functions.

Parameters:

	Polynomial	Underestimator K? sample set ... level 1 All sample set parameters starts with "Polynomial Underestimator Kx" here, with x=0,1,2. Check Sampling section for additional parameters.
	Polynomial	Underestimator K? sample set initial options 0 or 1 default 0 level 1 If 1, adds the point given in add to the sample set K?.
	Polynomial	Underestimator max polynom degree options integer $ 0$ default 2 The maximum degree, a polynomial understimator is allowed to have.

Definition at line 146 of file polynom.h.

PolynomialUnderestimator2::PolynomialUnderestimator2 ( Pointer< Param > param_ = NULL )

void PolynomialUnderestimator2::new_multiindices	(	const SparsityInfo &	si,
		int	n
	)			`[private]`

void PolynomialUnderestimator2::polynomial_underestimator	(	SparseMatrix2 &	A,
		SparseVector< double > &	b,
		double &	c,
		Func &	f,
		ivector &	indices
	)			`[private]`

void PolynomialUnderestimator2::polynomial_underestimator	(	MinlpProblem &	prob,
		MINLPData &	minlpdata,
		ivector &	ineq_index,
		SparseVector< double > &	obj_c_add,
		vector< SparseVector< double > > &	con_c_add
	)

Pointer<SepQcFunc> PolynomialUnderestimator2::polynomial_underestimator	(	Pointer< SepQcFunc >	f,
		bool	eq,
		dvector &	lower,
		dvector &	upper,
		dvector &	primal
	)