C# 클래스 Cscobyla.Tests.Cobyla2Tests

파일 보기 프로젝트 열기: anders9ustafsson/cscobyla

Private Properties

프로퍼티	타입	설명
FindMinimum_LogOutputToConsole_VisualInspection	void
TestProblem	void

공개 메소드들

메소드	설명
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.

비공개 메소드들

메소드	설명
FindMinimum_LogOutputToConsole_VisualInspection ( ) : void
TestProblem ( System.Tuple testCase ) : void

메소드 상세

RunTestProblem() 공개 메소드

public RunTestProblem ( CalcfcDelegate calcfc, int n, int m, double rhoend, double xopt ) : double
calcfc	CalcfcDelegate
n	int
m	int
rhoend	double
xopt	double
리턴	double

calcfc1() 공개 정적인 메소드

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
리턴	void

calcfc10() 공개 정적인 메소드

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
리턴	void

calcfc2() 공개 정적인 메소드

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
리턴	void

calcfc3() 공개 정적인 메소드

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
리턴	void

calcfc4() 공개 정적인 메소드

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
리턴	void

calcfc5() 공개 정적인 메소드

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
리턴	void

calcfc6() 공개 정적인 메소드

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
리턴	void

calcfc7() 공개 정적인 메소드

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
리턴	void

calcfc8() 공개 정적인 메소드

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
리턴	void

calcfc9() 공개 정적인 메소드

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
리턴	void