nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A New branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation
|
Luo, Hezhi |
|
|
90 |
1 |
p. 257-301 |
artikel |
2 |
Approximate bregman proximal gradient algorithm for relatively smooth nonconvex optimization
|
Takahashi, Shota |
|
|
90 |
1 |
p. 227-256 |
artikel |
3 |
A real moment-HSOS hierarchy for complex polynomial optimization with real coefficients
|
Wang, Jie |
|
|
90 |
1 |
p. 53-75 |
artikel |
4 |
Efficient proximal subproblem solvers for a nonsmooth trust-region method
|
Baraldi, Robert J. |
|
|
90 |
1 |
p. 193-226 |
artikel |
5 |
Fast convergence of the primal-dual dynamical system and corresponding algorithms for a nonsmooth bilinearly coupled saddle point problem
|
Ding, Ke-wei |
|
|
90 |
1 |
p. 151-192 |
artikel |
6 |
Generating representative sets for multiobjective discrete optimization problems with specified coverage errors
|
Kirlik, Gokhan |
|
|
90 |
1 |
p. 27-51 |
artikel |
7 |
On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
|
Nishioka, Akatsuki |
|
|
90 |
1 |
p. 303-336 |
artikel |
8 |
Optimization schemes on manifolds for structured matrices with fixed eigenvalues
|
Chehab, Jean-Paul |
|
|
90 |
1 |
p. 1-26 |
artikel |
9 |
Solving convex optimization problems via a second order dynamical system with implicit Hessian damping and Tikhonov regularization
|
László, Szilárd Csaba |
|
|
90 |
1 |
p. 113-149 |
artikel |
10 |
The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results
|
Kanzow, Christian |
|
|
90 |
1 |
p. 77-112 |
artikel |