Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation Sourour ElloumiAmélie LambertArnaud Lazare OriginalPaper 04 January 2021 Pages: 231 - 248
Convexification techniques for linear complementarity constraints Trang T. NguyenJean-Philippe P. RichardMohit Tawarmalani OriginalPaper 27 January 2021 Pages: 249 - 286
Convexification of bilinear forms through non-symmetric lifting Marcia FampaJon Lee OriginalPaper 07 January 2021 Pages: 287 - 305
Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks Frauke LiersAlexander MartinDennis Michaels OriginalPaper Open access 22 February 2021 Pages: 307 - 340
Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension Zhuoyi XuYong XiaJiulin Wang OriginalPaper 09 January 2021 Pages: 341 - 356
On tackling reverse convex constraints for non-overlapping of unequal circles Akang WangChrysanthos E. Gounaris OriginalPaper 04 January 2021 Pages: 357 - 385
A robust method based on LOVO functions for solving least squares problems E. V. CastelaniR. LopesF. N. C. Sobral OriginalPaper 04 January 2021 Pages: 387 - 414
A smoothing quasi-Newton method for solving general second-order cone complementarity problems Jingyong TangJinchuan Zhou OriginalPaper 24 November 2020 Pages: 415 - 438
A method for convex black-box integer global optimization Jeffrey LarsonSven LeyfferStefan M. Wild OriginalPaper 27 February 2021 Pages: 439 - 477
Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning Hideaki Iiduka OriginalPaper 04 January 2021 Pages: 479 - 505