nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Calabi-Polyak convexity theorem, Yuan’s lemma and S-lemma: extensions and applications
|
Song, Mengmeng |
|
|
85 |
3 |
p. 743-756 |
artikel |
2 |
Comparing reference point based interactive multiobjective optimization methods without a human decision maker
|
Chen, Lu |
|
|
85 |
3 |
p. 757-788 |
artikel |
3 |
Computational advances in polynomial optimization: RAPOSa, a freely available global solver
|
González-Rodríguez, Brais |
|
|
85 |
3 |
p. 541-568 |
artikel |
4 |
Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization
|
Wilhelm, Matthew E. |
|
|
85 |
3 |
p. 569-594 |
artikel |
5 |
Directional derivatives and subdifferentials for set-valued maps applied to set optimization
|
Durea, Marius |
|
|
85 |
3 |
p. 687-707 |
artikel |
6 |
EFIX: Exact fixed point methods for distributed optimization
|
Jakovetić, Dušan |
|
|
85 |
3 |
p. 637-661 |
artikel |
7 |
New bounds for nonconvex quadratically constrained quadratic programming
|
Zamani, Moslem |
|
|
85 |
3 |
p. 595-613 |
artikel |
8 |
On the structure of regularization paths for piecewise differentiable regularization terms
|
Gebken, Bennet |
|
|
85 |
3 |
p. 709-741 |
artikel |
9 |
Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints
|
Su, Tran Van |
|
|
85 |
3 |
p. 663-685 |
artikel |
10 |
Relaxed-inertial proximal point type algorithms for quasiconvex minimization
|
Grad, S.-M. |
|
|
85 |
3 |
p. 615-635 |
artikel |