nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A method for convex black-box integer global optimization
|
Larson, Jeffrey |
|
|
80 |
2 |
p. 439-477 |
artikel |
2 |
A robust method based on LOVO functions for solving least squares problems
|
Castelani, E. V. |
|
|
80 |
2 |
p. 387-414 |
artikel |
3 |
A smoothing quasi-Newton method for solving general second-order cone complementarity problems
|
Tang, Jingyong |
|
|
80 |
2 |
p. 415-438 |
artikel |
4 |
Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
|
Xu, Zhuoyi |
|
|
80 |
2 |
p. 341-356 |
artikel |
5 |
Convexification of bilinear forms through non-symmetric lifting
|
Fampa, Marcia |
|
|
80 |
2 |
p. 287-305 |
artikel |
6 |
Convexification techniques for linear complementarity constraints
|
Nguyen, Trang T. |
|
|
80 |
2 |
p. 249-286 |
artikel |
7 |
Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning
|
Iiduka, Hideaki |
|
|
80 |
2 |
p. 479-505 |
artikel |
8 |
On tackling reverse convex constraints for non-overlapping of unequal circles
|
Wang, Akang |
|
|
80 |
2 |
p. 357-385 |
artikel |
9 |
Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks
|
Liers, Frauke |
|
|
80 |
2 |
p. 307-340 |
artikel |
10 |
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
|
Elloumi, Sourour |
|
|
80 |
2 |
p. 231-248 |
artikel |