All Downloads are FREE. Search and download functionalities are using the official Maven repository.

Download all versions of jcobyla JAR files with all dependencies


jcobyla from group de.xypron.jcobyla (version 1.4)

COBYLA2 is an implementation of Powell's nonlinear derivative free constrained optimization that uses a linear approximation approach. The algorithm is a sequential trust region algorithm that employs linear approximations to the objective and constraint functions, where the approximations are formed by linear interpolation at n + 1 points in the space of the variables and tries to maintain a regular shaped simplex over iterations. It solves nonsmooth NLP with a moderate number of variables (about 100). Inequality constraints only. The initial point X is taken as one vertex of the initial simplex with zero being another, so, X should not be entered as the zero vector.

Group: de.xypron.jcobyla Artifact: jcobyla
Show documentation Show source 
Download jcobyla.jar (1.4)
 

3 downloads

jcobyla from group de.xypron.jcobyla (version 1.3)

COBYLA2 is an implementation of Powell's nonlinear derivative free constrained optimization that uses a linear approximation approach. The algorithm is a sequential trust region algorithm that employs linear approximations to the objective and constraint functions, where the approximations are formed by linear interpolation at n + 1 points in the space of the variables and tries to maintain a regular shaped simplex over iterations. It solves nonsmooth NLP with a moderate number of variables (about 100). Inequality constraints only. The initial point X is taken as one vertex of the initial simplex with zero being another, so, X should not be entered as the zero vector.

Group: de.xypron.jcobyla Artifact: jcobyla
Show documentation Show source 
Download jcobyla.jar (1.3)
 

3 downloads

jcobyla from group de.xypron.jcobyla (version 1.2)

COBYLA2 is an implementation of Powell's nonlinear derivative free constrained optimization that uses a linear approximation approach. The algorithm is a sequential trust region algorithm that employs linear approximations to the objective and constraint functions, where the approximations are formed by linear interpolation at n + 1 points in the space of the variables and tries to maintain a regular shaped simplex over iterations. It solves nonsmooth NLP with a moderate number of variables (about 100). Inequality constraints only. The initial point X is taken as one vertex of the initial simplex with zero being another, so, X should not be entered as the zero vector.

Group: de.xypron.jcobyla Artifact: jcobyla
Show documentation Show source 
Download jcobyla.jar (1.2)
 

3 downloads

jcobyla from group de.xypron.jcobyla (version 1.1)

COBYLA2 is an implementation of Powell's nonlinear derivative free constrained optimization that uses a linear approximation approach. The algorithm is a sequential trust region algorithm that employs linear approximations to the objective and constraint functions, where the approximations are formed by linear interpolation at n + 1 points in the space of the variables and tries to maintain a regular shaped simplex over iterations. It solves nonsmooth NLP with a moderate number of variables (about 100). Inequality constraints only. The initial point X is taken as one vertex of the initial simplex with zero being another, so, X should not be entered as the zero vector.

Group: de.xypron.jcobyla Artifact: jcobyla
Show documentation Show source 
Download jcobyla.jar (1.1)
 

3 downloads



Page 1 from 1 (items total 4)


© 2015 - 2024 Weber Informatics LLC | Privacy Policy