C# Class Cscobyla.Tests.Cobyla2Tests

Afficher le fichier Open project: anders9ustafsson/cscobyla

Private Properties

Свойство	Type	Description
FindMinimum_LogOutputToConsole_VisualInspection	void
TestProblem	void

Méthodes publiques

Méthode	Description
RunTestProblem ( CalcfcDelegate calcfc, int n, int m, double rhoend, double xopt ) : double
calcfc1 ( int n, int m, double x, double &f, double con ) : void	Minimization of a simple quadratic function of two variables.
calcfc10 ( int n, int m, double x, double &f, double con ) : void	This problem is taken from page 415 of Luenberger's book Applied Nonlinear Programming. It is to maximize the area of a hexagon of unit diameter.
calcfc2 ( int n, int m, double x, double &f, double con ) : void	Easy two dimensional minimization in unit circle.
calcfc3 ( int n, int m, double x, double &f, double con ) : void	Easy three dimensional minimization in ellipsoid.
calcfc4 ( int n, int m, double x, double &f, double con ) : void	Weak version of Rosenbrock's problem.
calcfc5 ( int n, int m, double x, double &f, double con ) : void	Intermediate version of Rosenbrock's problem.
calcfc6 ( int n, int m, double x, double &f, double con ) : void	This problem is taken from Fletcher's book Practical Methods of Optimization and has the equation number (9.1.15).
calcfc7 ( int n, int m, double x, double &f, double con ) : void	This problem is taken from Fletcher's book Practical Methods of Optimization and has the equation number (14.4.2).
calcfc8 ( int n, int m, double x, double &f, double con ) : void	This problem is taken from page 66 of Hock and Schittkowski's book Test Examples for Nonlinear Programming Codes. It is their test problem Number 43, and has the name Rosen-Suzuki.
calcfc9 ( int n, int m, double x, double &f, double con ) : void	This problem is taken from page 111 of Hock and Schittkowski's book Test Examples for Nonlinear Programming Codes. It is their test problem Number 100.

Private Methods

Méthode	Description
FindMinimum_LogOutputToConsole_VisualInspection ( ) : void
TestProblem ( System.Tuple testCase ) : void

Method Details

RunTestProblem() public méthode

public RunTestProblem ( CalcfcDelegate calcfc, int n, int m, double rhoend, double xopt ) : double
calcfc	CalcfcDelegate
n	int
m	int
rhoend	double
xopt	double
Résultat	double

calcfc1() public static méthode

Minimization of a simple quadratic function of two variables.

public static calcfc1 ( int n, int m, double x, double &f, double con ) : void
n	int
m	int
x	double
f	double
con	double
Résultat	void

calcfc10() public static méthode

This problem is taken from page 415 of Luenberger's book Applied Nonlinear Programming. It is to maximize the area of a hexagon of unit diameter.

public static calcfc10 ( int n, int m, double x, double &f, double con ) : void
n	int
m	int
x	double
f	double
con	double
Résultat	void

calcfc2() public static méthode

Easy two dimensional minimization in unit circle.

public static calcfc2 ( int n, int m, double x, double &f, double con ) : void
n	int
m	int
x	double
f	double
con	double
Résultat	void

calcfc3() public static méthode

Easy three dimensional minimization in ellipsoid.

public static calcfc3 ( int n, int m, double x, double &f, double con ) : void
n	int
m	int
x	double
f	double
con	double
Résultat	void

calcfc4() public static méthode

Weak version of Rosenbrock's problem.

public static calcfc4 ( int n, int m, double x, double &f, double con ) : void
n	int
m	int
x	double
f	double
con	double
Résultat	void

calcfc5() public static méthode

Intermediate version of Rosenbrock's problem.

public static calcfc5 ( int n, int m, double x, double &f, double con ) : void
n	int
m	int
x	double
f	double
con	double
Résultat	void

calcfc6() public static méthode

This problem is taken from Fletcher's book Practical Methods of Optimization and has the equation number (9.1.15).

public static calcfc6 ( int n, int m, double x, double &f, double con ) : void
n	int
m	int
x	double
f	double
con	double
Résultat	void

calcfc7() public static méthode

This problem is taken from Fletcher's book Practical Methods of Optimization and has the equation number (14.4.2).

public static calcfc7 ( int n, int m, double x, double &f, double con ) : void
n	int
m	int
x	double
f	double
con	double
Résultat	void

calcfc8() public static méthode

This problem is taken from page 66 of Hock and Schittkowski's book Test Examples for Nonlinear Programming Codes. It is their test problem Number 43, and has the name Rosen-Suzuki.

public static calcfc8 ( int n, int m, double x, double &f, double con ) : void
n	int
m	int
x	double
f	double
con	double
Résultat	void

calcfc9() public static méthode

This problem is taken from page 111 of Hock and Schittkowski's book Test Examples for Nonlinear Programming Codes. It is their test problem Number 100.

public static calcfc9 ( int n, int m, double x, double &f, double con ) : void
n	int
m	int
x	double
f	double
con	double
Résultat	void