2018-06-07から1日間の記事一覧

paper reading: Successive Lagrangian Relaxation Algorithm for Nonconvex Quadratic Optimization

https://www.keisu.t.u-tokyo.ac.jp/data/2017/METR17-08.pdf * branch-and-bound problem ```In the case Qi ⪰ O for every i = 0, · · · , m, (1) is a convex program. ```凸最適化 - Wikipedia * trust region 信頼領域 - Wikipedia * SOCP 二次錐計画問…