Optimization#
Minimize a function over a given range by brute force. |
|
Find a root x0 of a function f in a bracketing interval [a, b] using Brent's method. |
|
Use a Nelder-Mead simplex algorithm to find the minimum of function of one or more variables. |
|
Minimize a function using the BFGS algorithm. |
|
Minimize a function func using the L-BFGS-B algorithm. |
|
Perform unconstrained minimization of a function using the Newton-CG method. |
|
Minimize a function using Sequential Least Squares Programming. |
|
Solve the following optimization problem with a linear objective function and a set of linear constraints. |
|
Solve the following optimization problem with a quadratic objective function and a set of linear constraints. |
|
Solve the following optimization problem with a linear objective function and a set of constraints including a quadratic constraint. |
|
Solve the following optimization problem with a quadratic objective function and a set of linear constraints. |
|
Solve the following optimization problem for the objective function with given constraints: |
|
It generates the vector b that solves X*b=Y. |
|
Solve SOCP problems and calculate the minimum of the objective function under specified constraints. |