搜索资源列表
Convex11
- Matlab采用障碍法及原对偶内点法解决不等式约束凸优化问题-barry method, Original dual interior point method
Matlabrule
- 用matlab编程求解无约束优化问题、线性规划问题即在一组线性不等式或等式组的约束条件下求某个线性函数的最值问题-Matlab programming for solving unconstrained optimization problems, linear programming problems that most value problem for a linear function under the constraints of a set of linear inequaliti
SQP_local_eqineqz
- 用matlab编写的SQP优化函数。可以求解目标函数和约束函数(等式和不等式)都为非线性的优化问题。-SQP solving function
complex
- 本程序为任意维度的复合形程序(适用于解决含不等式约束的优化问题),只需修改相应的初始复合形、目标函数及约束条件等即可求出极小值。-This procedure for any dimension of complex procedures (applicable to solve the optimization problem with inequality constraints).The reader only needs to modify the corresponding initi