| 1 | -- | 19 | Betty Shea, Mark Schmidt 0001. Greedy Newton: Newton's method with exact line search |
| 21 | -- | 36 | Yang Xu, Zheng-Hai Huang. Local error bounds for the generalized polynomial complementarity problem |
| 37 | -- | 51 | Sonali Sharma, Rani Deb, Arup Kumar Das. Symmetric positive subdefinite tensors |
| 53 | -- | 65 | Fenghui Wang, Hongtruong Pham. Improvement of convergence criteria for finding common fixed points of multiple finite demicontractive mappings |
| 67 | -- | 87 | Jinbao Jian, Mingxia Wang, Jianghua Yin. A hybrid acceleration Douglas-Rachford splitting method for solving large-scale absolute value equations |
| 89 | -- | 108 | Gustavo Angulo, Burak Kocuk, Diego Alejandro Morán Ramírez. Generator subadditive functions for mixed-integer programs |
| 109 | -- | 122 | Bohan Li, Pengjie Liu, Hu Shao, Ting Wu 0009, Jiawei Xu. A proximal alternating direction method of multipliers with a proximal-perturbed Lagrangian function for nonconvex and nonsmooth structured optimization |
| 123 | -- | 141 | Jianping Li 0007, Lijian Cai, Junran Lichen, Pengxiang Pan. Exact combinatorial algorithms for solving the bin covering problems with strong divisibility and rejection profit |
| 143 | -- | 161 | Kaiyuan Guan, Jingyong Tang. Expected value method for a class of stochastic linear circular cone complementarity problems |
| 163 | -- | 176 | Radoslav G. Vuchkov, Drew P. Kouri. A randomized sketching trust-region secant method for low-memory dynamic optimization |
| 177 | -- | 195 | Yuge Bai, Mengdi Gu. Does risk aversion decrease the order quantity? |
| 197 | -- | 212 | Pham Duy Khanh, Vu Vinh Huy Khoa, Vo Thanh Phat, Le Duc Viet. Lipschitz modulus of convex functions via function values |
| 213 | -- | 230 | Do Duy Thanh, Pham Ngoc Anh, Cao Th Thu Trang. Halpern relaxed projection methods for solving variational inequality problems |
| 231 | -- | 255 | Aloïs Duguet, Margarida Carvalho, Gabriele Dragotto, Sandra Ulrich Ngueveu. Computing approximate Nash equilibria for integer programming games |