conic linear programming-yinyu ye.zip

[{"title":"（ 25 个子文件 2.62MB ） conic linear programming-yinyu ye.zip","children":[{"title":"conic linear programming-yinyu ye","children":[{"title":"homework2_sol.pdf <span style='color:#111;'> 159.32KB </span>","children":null,"spread":false},{"title":"lecture12 First-Order Methods for Unconstrained Optimization.pdf <span style='color:#111;'> 71.37KB </span>","children":null,"spread":false},{"title":"homework4_sol.pdf <span style='color:#111;'> 144.32KB </span>","children":null,"spread":false},{"title":"homework3.pdf <span style='color:#111;'> 78.75KB </span>","children":null,"spread":false},{"title":"homework1.pdf <span style='color:#111;'> 20.52KB </span>","children":null,"spread":false},{"title":"lecture03 Conic Duality II.pdf <span style='color:#111;'> 56.58KB </span>","children":null,"spread":false},{"title":"lecture15 Applications of CLP- Robust Optimization.pdf <span style='color:#111;'> 78.21KB </span>","children":null,"spread":false},{"title":"lecture09 Interior-Point Algorithm for CLP I.pdf <span style='color:#111;'> 86.71KB </span>","children":null,"spread":false},{"title":"lecture16 Conic Linear Optimization Review.pdf <span style='color:#111;'> 65.54KB </span>","children":null,"spread":false},{"title":"lecture13 First-Order Methods for Conic Linear Programming.pdf <span style='color:#111;'> 62.75KB </span>","children":null,"spread":false},{"title":"homework3_sol.pdf <span style='color:#111;'> 116.71KB </span>","children":null,"spread":false},{"title":"lecture06 Applications of SDP Rank Reduction- QCQP.pdf <span style='color:#111;'> 108.39KB </span>","children":null,"spread":false},{"title":"lecture07 Applications of SDP Rank Reduction-SNL.pdf <span style='color:#111;'> 463.74KB </span>","children":null,"spread":false},{"title":"lecture04 Conic Linear Optimization and its Dual.pdf <span style='color:#111;'> 71.95KB </span>","children":null,"spread":false},{"title":"lecture17 CLP Research Topics.pdf <span style='color:#111;'> 81.93KB </span>","children":null,"spread":false},{"title":"homework2.pdf <span style='color:#111;'> 26.16KB </span>","children":null,"spread":false},{"title":"homework4.pdf <span style='color:#111;'> 104.57KB </span>","children":null,"spread":false},{"title":"lecture14 Applications of CLP-Regret Minimization.pdf <span style='color:#111;'> 60.12KB </span>","children":null,"spread":false},{"title":"lecture11 More CLP Methods.pdf <span style='color:#111;'> 94.34KB </span>","children":null,"spread":false},{"title":"lecture02 Conic Duality.pdf <span style='color:#111;'> 91.20KB </span>","children":null,"spread":false},{"title":"lecture08 Midterm Review.pdf <span style='color:#111;'> 70.99KB </span>","children":null,"spread":false},{"title":"lecture05 Rank Reduction for Semidefinite Programming.pdf <span style='color:#111;'> 93.65KB </span>","children":null,"spread":false},{"title":"lecture01 introduction.pdf <span style='color:#111;'> 448.84KB </span>","children":null,"spread":false},{"title":"homework1_sol.pdf <span style='color:#111;'> 216.57KB </span>","children":null,"spread":false},{"title":"lecture10 Interior-Point Algorithm for CLP II.pdf <span style='color:#111;'> 70.94KB </span>","children":null,"spread":false}],"spread":false}],"spread":true}]