C# Класс Cscobyla.Tests.Cobyla2Tests

Показать файл Открыть проект

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