A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs T. D. ChuongV. JeyakumarG. Li OriginalPaper 27 September 2019 Pages: 885 - 919
A finite \(\epsilon \)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables Can LiIgnacio E. Grossmann OriginalPaper 23 August 2019 Pages: 921 - 947
A manifold-based approach to sparse global constraint satisfaction problems Ali BaharevArnold NeumaierHermann Schichl OriginalPaper Open access 12 July 2019 Pages: 949 - 971
Noisy Euclidean distance matrix completion with a single missing node Stefan SremacFei WangLucas Pettersson OriginalPaper Open access 26 August 2019 Pages: 973 - 1002
Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions Yaohua HuCarisa Kwok Wai YuXiaoqi Yang OriginalPaper 12 August 2019 Pages: 1003 - 1028
Inexact proximal \(\epsilon \)-subgradient methods for composite convex optimization problems R. Díaz MillánM. Pentón Machado OriginalPaper 18 July 2019 Pages: 1029 - 1060
Stability of a convex feasibility problem Carlo Alberto De BernardiEnrico MiglierinaElena Molho OriginalPaper 18 July 2019 Pages: 1061 - 1077
Surrogate-assisted Bounding-Box approach for optimization problems with tunable objectives fidelity M. RivierP. M. Congedo OriginalPaper 28 August 2019 Pages: 1079 - 1109
Online hole healing for sensor coverage Zhao ZhangZaixin LuDing-Zhu Du OriginalPaper 07 September 2019 Pages: 1111 - 1131
Approximation algorithm for the partial set multi-cover problem Yishuo ShiYingli RanDing-Zhu Du OriginalPaper 03 July 2019 Pages: 1133 - 1146