| 231 | -- | 248 | Sourour Elloumi, Amélie Lambert, Arnaud Lazare. Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation |
| 249 | -- | 286 | Trang T. Nguyen, Jean-Philippe P. Richard, Mohit Tawarmalani. Convexification techniques for linear complementarity constraints |
| 287 | -- | 305 | Marcia Fampa, Jon Lee 0001. Convexification of bilinear forms through non-symmetric lifting |
| 307 | -- | 340 | Frauke Liers, Alexander Martin 0001, Maximilian Merkert, Nick Mertens, Dennis Michaels. Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks |
| 341 | -- | 356 | Zhuoyi Xu, Yong Xia, Jiulin Wang. Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension |
| 357 | -- | 385 | Akang Wang, Chrysanthos E. Gounaris. On tackling reverse convex constraints for non-overlapping of unequal circles |
| 387 | -- | 414 | Emerson V. Castelani, Ronaldo Lopes, Wesley V. I. Shirabayashi, F. N. C. Sobral. A robust method based on LOVO functions for solving least squares problems |
| 415 | -- | 438 | Jingyong Tang, Jinchuan Zhou. A smoothing quasi-Newton method for solving general second-order cone complementarity problems |
| 439 | -- | 477 | Jeffrey Larson, Sven Leyffer, Prashant Palkar, Stefan M. Wild. A method for convex black-box integer global optimization |
| 479 | -- | 505 | Hideaki Iiduka. Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning |