| 317 | -- | 344 | Hikaru Komeiji, Sunyoung Kim, Makoto Yamashita. On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems |
| 345 | -- | 385 | Lori Badea. Additive and restricted additive Schwarz-Richardson methods for inequalities with nonlinear monotone operators |
| 387 | -- | 441 | Andreas M. Tillmann. Computing the spark: mixed-integer programming for the (vector) matroid girth problem |
| 443 | -- | 480 | Najmeh Hoseini Monjezi, S. Nobakhtian. A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization |
| 481 | -- | 516 | Jingqun Li, Ratnasingham Tharmarasa, Daly Brown, Thia Kirubarajan, Krishna R. Pattipati. A novel convex dual approach to three-dimensional assignment problem: theoretical analysis |
| 517 | -- | 545 | Ron Teller, Moshe Zofi, Moshe Kaspi. Minimizing the average searching time for an object within a graph |
| 547 | -- | 582 | Jifeng Bao, Carisa Kwok Wai Yu, Jinhua Wang, Yaohua Hu, Jen-Chih Yao. Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems |
| 583 | -- | 621 | Chee-Khian Sim. Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence |