| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
An improved model for estimating optimal VRP solution values
|
Kou, Shuhan
|
|
|
18 |
3 |
p. 697-703
|
article
|
| 2 |
A novel one-parameter filled function method with an application to pathological analysis
|
Yan, Qian
|
|
|
18 |
3 |
p. 803-824
|
article
|
| 3 |
Exact QR factorizations of rectangular matrices
|
Lourenco, Christopher
|
|
|
18 |
3 |
p. 681-695
|
article
|
| 4 |
Linear convergence rate analysis of a class of exact first-order distributed methods for weight-balanced time-varying networks and uncoordinated step sizes
|
Malaspina, Greta
|
|
|
18 |
3 |
p. 825-846
|
article
|
| 5 |
Local convergence analysis of an inexact trust-region method for nonsmooth optimization
|
Baraldi, Robert J.
|
|
|
18 |
3 |
p. 663-680
|
article
|
| 6 |
On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential
|
Hejazi, Mansoureh Alavi
|
|
|
18 |
3 |
p. 705-726
|
article
|
| 7 |
Optimal step length for the maximal decrease of a self-concordant function by the Newton method
|
Ivanova, Anastasia
|
|
|
18 |
3 |
p. 847-854
|
article
|
| 8 |
Plants’ competition under autotoxicity effect: an evolutionary game
|
Karagiannis-Axypolitidis, Nikolaos
|
|
|
18 |
3 |
p. 855-872
|
article
|
| 9 |
Practical approximation algorithms for ℓ1-regularized sparse rank-1 approximation to higher-order tensors
|
Mao, Xianpeng
|
|
|
18 |
3 |
p. 767-781
|
article
|
| 10 |
Random-reshuffled SARAH does not need full gradient computations
|
Beznosikov, Aleksandr
|
|
|
18 |
3 |
p. 727-749
|
article
|
| 11 |
Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection
|
Atsmony, Matan
|
|
|
18 |
3 |
p. 751-766
|
article
|
| 12 |
Strong convergence theorem for a new Bregman extragradient method with a different line-search process for solving variational inequality problems in reflexive Banach spaces
|
Hu, Shaotao
|
|
|
18 |
3 |
p. 783-801
|
article
|
Journal description