最优化方法完整课件

[{"title":"（ 19 个子文件 2.62MB ） 最优化方法完整课件","children":[{"title":"最优化方法","children":[{"title":"6一维搜索.doc <span style='color:#111;'> 638.50KB </span>","children":null,"spread":false},{"title":"附录4：《最优化方法》复习提要.doc <span style='color:#111;'> 1.90MB </span>","children":null,"spread":false},{"title":"附录5：《最优化方法》复习题.DOC <span style='color:#111;'> 880.00KB </span>","children":null,"spread":false},{"title":"联系方式.doc <span style='color:#111;'> 23.50KB </span>","children":null,"spread":false},{"title":"8无约束最优化的直接法.doc <span style='color:#111;'> 443.00KB </span>","children":null,"spread":false},{"title":"10罚函数法.doc <span style='color:#111;'> 358.50KB </span>","children":null,"spread":false},{"title":"附录1：线性规划的阅读材料.DOC <span style='color:#111;'> 155.00KB </span>","children":null,"spread":false},{"title":"附录2：罚函数法的阅读材料.doc <span style='color:#111;'> 351.50KB </span>","children":null,"spread":false},{"title":"1最优化问题与数学预备知识.doc <span style='color:#111;'> 478.50KB </span>","children":null,"spread":false},{"title":"12线性分式规划.doc <span style='color:#111;'> 101.50KB </span>","children":null,"spread":false},{"title":"附录3：四个算法的程序设计.doc <span style='color:#111;'> 52.50KB </span>","children":null,"spread":false},{"title":"四个算法.doc <span style='color:#111;'> 156.50KB </span>","children":null,"spread":false},{"title":"5算法的概念.doc <span style='color:#111;'> 227.50KB </span>","children":null,"spread":false},{"title":"7无约束最优化的解析法.doc <span style='color:#111;'> 861.00KB </span>","children":null,"spread":false},{"title":"9可行方向法.doc <span style='color:#111;'> 324.50KB </span>","children":null,"spread":false},{"title":"2凸性.doc <span style='color:#111;'> 578.00KB </span>","children":null,"spread":false},{"title":"3最优性条件.doc <span style='color:#111;'> 792.50KB </span>","children":null,"spread":false},{"title":"11二次规划与割平面法.doc <span style='color:#111;'> 1.03MB </span>","children":null,"spread":false},{"title":"4线性规划的基本理论.doc <span style='color:#111;'> 1.31MB </span>","children":null,"spread":false}],"spread":false}],"spread":true}]