| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
|
Qian, Yitian
|
|
|
84 |
3 |
p. 875-919
|
artikel
|
| 2 |
A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization
|
Pei, Yonggang
|
|
|
84 |
3 |
p. 1005-1033
|
artikel
|
| 3 |
A smoothing proximal gradient algorithm with extrapolation for the relaxation of ℓ0 regularization problem
|
Zhang, Jie
|
|
|
84 |
3 |
p. 737-760
|
artikel
|
| 4 |
Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
|
Chicoisne, Renaud
|
|
|
84 |
3 |
p. 789-831
|
artikel
|
| 5 |
Conic formulation of QPCCs applied to truly sparse QPs
|
Bomze, Immanuel M.
|
|
|
84 |
3 |
p. 703-735
|
artikel
|
| 6 |
Lifted stationary points of sparse optimization with complementarity constraints
|
Liu, Shisen
|
|
|
84 |
3 |
p. 973-1003
|
artikel
|
| 7 |
Majorization-minimization-based Levenberg–Marquardt method for constrained nonlinear least squares
|
Marumo, Naoki
|
|
|
84 |
3 |
p. 833-874
|
artikel
|
| 8 |
On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions
|
Boyer, Claire
|
|
|
84 |
3 |
p. 921-972
|
artikel
|
| 9 |
Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition
|
Irwin, Brian
|
|
|
84 |
3 |
p. 651-702
|
artikel
|
| 10 |
T-product factorization based method for matrix and tensor completion problems
|
Yu, Quan
|
|
|
84 |
3 |
p. 761-788
|
artikel
|
Tijdschrift beschrijving