| 663 | -- | 680 | Robert J. Baraldi, Drew P. Kouri. Local convergence analysis of an inexact trust-region method for nonsmooth optimization |
| 681 | -- | 695 | Christopher J. Lourenco, Erick Moreno-Centeno. Exact QR factorizations of rectangular matrices |
| 697 | -- | 703 | Shuhan Kou, Bruce L. Golden, Luca Bertazzi. An improved model for estimating optimal VRP solution values |
| 705 | -- | 726 | Mansoureh Alavi Hejazi, Nooshin Movahedian. On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential |
| 727 | -- | 749 | Aleksandr Beznosikov, Martin Takác 0001. Random-reshuffled SARAH does not need full gradient computations |
| 751 | -- | 766 | Matan Atsmony, Gur Mosheiov. Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection |
| 767 | -- | 781 | Xianpeng Mao, Yuning Yang. 1-regularized sparse rank-1 approximation to higher-order tensors |
| 783 | -- | 801 | Shaotao Hu, Yuanheng Wang, Ping Jing, Qiao-Li Dong. Strong convergence theorem for a new Bregman extragradient method with a different line-search process for solving variational inequality problems in reflexive Banach spaces |
| 803 | -- | 824 | Qian Yan, Wang Chen, Xinmin Yang. A novel one-parameter filled function method with an application to pathological analysis |
| 825 | -- | 846 | Greta Malaspina, Dusan Jakovetic, Natasa Krejic. Linear convergence rate analysis of a class of exact first-order distributed methods for weight-balanced time-varying networks and uncoordinated step sizes |
| 847 | -- | 854 | Anastasia Ivanova, Roland Hildebrand. Optimal step length for the maximal decrease of a self-concordant function by the Newton method |
| 855 | -- | 872 | Nikolaos Karagiannis-Axypolitidis, Fabrizio Panebianco, Giuliano Bonanomi, Francesco Giannino. Plants' competition under autotoxicity effect: an evolutionary game |