01 2025 档案

摘要:SI152: Numerical Optimization Lecture 14: Quadratic Programming Active-set Method If an optimal active-set A∗ (i.e., a set of inequalities satisfied a 阅读全文
posted @ 2025-01-02 01:15 Coinred 编辑
摘要:SI152: Numerical Optimization Lec 12: Gradient Projection and Frank-Wolfe algorithms optimize f within a feasible set . Convex set constraint 阅读全文
posted @ 2025-01-02 00:38 Coinred 编辑
摘要:SI152: Numerical Optimization Lec 9: Nonlinear Programming,Line Search Method Fundamentals for nonlinear unstrained optimization Theorem 1 (Mean Value 阅读全文
posted @ 2025-01-01 22:08 Coinred 编辑
摘要:SI152: Numerical Optimization Lec 7. Integer Programming, Cutting Plane, Branch and Bound Integer Programming \[\begin{aligned} (IP) \min_{x}~ & c^T x 阅读全文
posted @ 2025-01-01 22:08 Coinred 编辑
摘要:SI152: Numerical Optimization Lec 3. Linear Programming General form of LP \[\begin{aligned} \min_{x}~ & c^T x \\ \text{s.t. }~ & a_i^T x \geq b_i , i 阅读全文
posted @ 2025-01-01 22:07 Coinred 编辑

点击右上角即可分享
微信分享提示