| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A block coordinate gradient descent method for regularized convex separable optimization and covariance selection
|
Yun, Sangwoon
|
|
2011
|
129 |
2 |
p. 331-355
|
artikel
|
| 2 |
A note on the complexity of Lp minimization
|
Ge, Dongdong
|
|
2011
|
129 |
2 |
p. 285-299
|
artikel
|
| 3 |
A stackelberg game approach to distributed spectrum management
|
Razaviyayn, Meisam
|
|
2011
|
129 |
2 |
p. 197-224
|
artikel
|
| 4 |
Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
|
Zheng, Xiao Jin
|
|
2011
|
129 |
2 |
p. 301-329
|
artikel
|
| 5 |
Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
|
So, Anthony Man-Cho
|
|
2011
|
129 |
2 |
p. 357-382
|
artikel
|
| 6 |
Distributed multi-agent optimization with state-dependent communication
|
Lobel, Ilan
|
|
2011
|
129 |
2 |
p. 255-284
|
artikel
|
| 7 |
Incremental proximal methods for large scale convex optimization
|
Bertsekas, Dimitri P.
|
|
2011
|
129 |
2 |
p. 163-195
|
artikel
|
| 8 |
On the complexity of computing the handicap of a sufficient matrix
|
Klerk, Etienne de
|
|
2011
|
129 |
2 |
p. 383-402
|
artikel
|
| 9 |
Preface
|
Bertsekas, Dimitri P.
|
|
2011
|
129 |
2 |
p. 159-162
|
artikel
|
| 10 |
Random algorithms for convex minimization problems
|
Nedić, Angelia
|
|
2011
|
129 |
2 |
p. 225-253
|
artikel
|
Tijdschrift beschrijving