IPM_SampleV1.1

代码说明：

  使用内点法，解决凸优化问题，此方法(Interior Point Method)是一种求解线性规划或非线性凸优化问题的算法。(The interior point method is used to solve the convex optimization problem. This method (Interior, Point, Method) is an algorithm for solving linear programming or nonlinear convex optimization problems.)

文件列表：

IPM_SampleV1.1\backtracking.m
IPM_SampleV1.1\fun1.m
IPM_SampleV1.1\fun2.m
IPM_SampleV1.1\gfun1.m
IPM_SampleV1.1\gfun2.m
IPM_SampleV1.1\Hess1.m
IPM_SampleV1.1\Hess2.m
IPM_SampleV1.1\ipm.m
IPM_SampleV1.1\newton.m
IPM_SampleV1.1\test1.m
IPM_SampleV1.1\test2.m
IPM_SampleV1.1
IPM_SampleV1.1\maple.mw
IPM_SampleV1.1\readme.txt