A geometric branch and bound method for robust maximization of convex functions Fengqiao LuoSanjay Mehrotra OriginalPaper 11 June 2021 Pages: 835 - 859
Branch-and-price for a class of nonconvex mixed-integer nonlinear programs Andrew AllmanQi Zhang OriginalPaper 07 May 2021 Pages: 861 - 880
On global subdifferentials with applications in nonsmooth optimization Felipe LaraAlireza Kabgani OriginalPaper 06 January 2021 Pages: 881 - 900
A power penalty approach to a mixed quasilinear elliptic complementarity problem Yarui DuanSong WangYuying Zhou OriginalPaper 12 February 2021 Pages: 901 - 918
Integer programming formulations and efficient local search for relaxed correlation clustering Eduardo QueirogaAnand SubramanianYuri Frota OriginalPaper 13 February 2021 Pages: 919 - 966
ORCA: Outlier detection and Robust Clustering for Attributed graphs Srinivas EswarRamakrishnan KannanHaesun Park OriginalPaper 03 May 2021 Pages: 967 - 989
Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization Ting TaoShaohua PanShujun Bi OriginalPaper 03 September 2021 Pages: 991 - 1017
Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations Chungen ShenXiao Liu OriginalPaper 05 May 2021 Pages: 1019 - 1055
Experimental analysis of local searches for sparse reflexive generalized inverses Marcia FampaJon LeeLuze Xu OriginalPaper 23 September 2021 Pages: 1057 - 1093
Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity T. D. ChuongV. JeyakumarD. Woolnough OriginalPaper 05 July 2021 Pages: 1095 - 1117