| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A branch and cut algorithm for the capacitated star–star telecommunication network problem
|
Güden, Hüseyin
|
|
2018
|
13 |
4 |
p. 825-836
|
artikel
|
| 2 |
“Active-set complexity” of proximal gradient: How long does it take to find the sparsity pattern?
|
Nutini, Julie
|
|
2018
|
13 |
4 |
p. 645-655
|
artikel
|
| 3 |
A filled function which has the same local minimizer of the objective function
|
Lin, Hongwei
|
|
2018
|
13 |
4 |
p. 761-776
|
artikel
|
| 4 |
An approximation algorithm for multi-agent scheduling on two uniform parallel machines
|
Gu, Manzhan
|
|
2018
|
13 |
4 |
p. 907-933
|
artikel
|
| 5 |
An equivalent tensor equation to the tensor complementarity problem with positive semi-definite Z-tensor
|
Xu, Hong-Ru
|
|
2018
|
13 |
4 |
p. 685-694
|
artikel
|
| 6 |
A note on the forward-Douglas–Rachford splitting for monotone inclusion and convex optimization
|
Raguet, Hugo
|
|
2018
|
13 |
4 |
p. 717-740
|
artikel
|
| 7 |
A proximal point algorithm with asymmetric linear term
|
Cai, Xingju
|
|
2018
|
13 |
4 |
p. 777-793
|
artikel
|
| 8 |
Distributionally robust $$L_1$$L1-estimation in multiple linear regression
|
Gong, Zhaohua
|
|
2018
|
13 |
4 |
p. 935-947
|
artikel
|
| 9 |
Improved price of anarchy for machine scheduling games with coordination mechanisms
|
Zhang, Long
|
|
2018
|
13 |
4 |
p. 949-959
|
artikel
|
| 10 |
Limits of maximal monotone operators driven by their representative functions
|
García, Yboon
|
|
2018
|
13 |
4 |
p. 795-803
|
artikel
|
| 11 |
On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives
|
Hong, Zhe
|
|
2018
|
13 |
4 |
p. 891-906
|
artikel
|
| 12 |
Optimality conditions for $${\varvec{\epsilon }}$$ϵ-quasi solutions of optimization problems via $${\varvec{\epsilon }}$$ϵ-upper convexificators with applications
|
Capătă, Adela
|
|
2018
|
13 |
4 |
p. 857-873
|
artikel
|
| 13 |
Optimal K-node disruption on a node-capacitated network
|
Karakose, Gokhan
|
|
2018
|
13 |
4 |
p. 695-715
|
artikel
|
| 14 |
Partial sample average approximation method for chance constrained problems
|
Cheng, Jianqiang
|
|
2018
|
13 |
4 |
p. 657-672
|
artikel
|
| 15 |
Proper initialization is crucial for the Nelder–Mead simplex search
|
Wessing, Simon
|
|
2018
|
13 |
4 |
p. 847-856
|
artikel
|
| 16 |
Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem
|
Xu, Zi
|
|
2018
|
13 |
4 |
p. 837-845
|
artikel
|
| 17 |
Sequential parametric convex approximation algorithm for bilinear matrix inequality problem
|
Lee, Donghwan
|
|
2018
|
13 |
4 |
p. 741-759
|
artikel
|
| 18 |
Strengthening the sequential convex MINLP technique by perspective reformulations
|
D’Ambrosio, Claudia
|
|
2018
|
13 |
4 |
p. 673-684
|
artikel
|
| 19 |
Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases
|
Rada, Miroslav
|
|
2018
|
13 |
4 |
p. 875-890
|
artikel
|
| 20 |
The modified second APG method for DC optimization problems
|
Lin, Daoling
|
|
2018
|
13 |
4 |
p. 805-824
|
artikel
|
Tijdschrift beschrijving