1 | -- | 20 | Philipp Hungerländer, Franz Rendl. A computational study and survey of methods for the single-row facility layout problem |
21 | -- | 47 | Ryoichi Nishimura, Shunsuke Hayashi, Masao Fukushima. SDP reformulation for robust optimization problems based on nonconvex QP duality |
49 | -- | 71 | Aiqun Huang, Chengxian Xu. A trust region method for solving semidefinite programs |
73 | -- | 0 | Aiqun Huang, Chengxian Xu. Erratum to: A trust region method for solving semidefinite programs |
75 | -- | 111 | Dinh Quoc Tran, Carlo Savorgnan, Moritz Diehl. Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems |
113 | -- | 135 | Viviane Köhler, Marcia Fampa, Olinto Araújo. Mixed-Integer Linear Programming Formulations for the Software Clustering Problem |
137 | -- | 153 | Sabine Burgdorf, Kristijan Cafuta, Igor Klep, Janez Povh. Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials |
155 | -- | 172 | Xinsheng Xu, Zhiqing Meng, Jianwu Sun, LiGuo Huang, Rui Shen. A second-order smooth penalty function algorithm for constrained optimization problems |
173 | -- | 196 | Hongwei Liu, Xiangli Li. Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization |
197 | -- | 225 | Falk M. Hante, Sebastian Sager. Relaxation methods for mixed-integer optimal control of partial differential equations |
227 | -- | 263 | H. Kasumba, K. Kunisch. Vortex control of instationary channel flows using translation invariant cost functionals |