- Natasa Krklec Jerinkic, Federica Porta, Valeria Ruggiero, Ilaria Trombini. Variable metric proximal stochastic gradient methods with additional sampling. Comp. Opt. and Appl., 93(1):157-207, January 2026.
- Juan Pablo Fernández-Gutiérrez, Juan G. Villegas, José Fernando Camacho Vallejo. A simple and effective exact method for the medianoid problem with multipurpose trips. Comp. Opt. and Appl., 93(2):851-897, March 2026.
- M. Marques Alves, Dirk A. Lorenz, Emanuele Naldi. A general framework for inexact splitting algorithms with relative errors and applications to Chambolle-Pock and Davis-Yin methods. Comp. Opt. and Appl., 93(2):729-763, March 2026.
- Matteo Bergamaschi, Andrea Cristofari, Vyacheslav Kungurtsev, Francesco Rinaldi. Probabilistic iterative hard thresholding for sparse learning. Comp. Opt. and Appl., 93(1):57-83, January 2026.
- Gabriel R. S. Grillo, Elias S. Helou, Sandra A. Santos 0001. Inexact FISTA-like Methods with Adaptive Backtracking. Comp. Opt. and Appl., 93(3):1259-1304, April 2026.
- Santanu Soe, Matthew K. Tam, Vellaichamy Vetrivel. The golden ratio primal-dual algorithm with two new stepsize rules for convex-concave saddle point problems. Comp. Opt. and Appl., 93(3):1355-1399, April 2026.
- Amal Alphonse, Constantin Christof, Michael Hintermüller, Ioannis P. A. Papadopoulos. A globalized inexact semismooth Newton method for nonsmooth fixed-point equations involving variational inequalities. Comp. Opt. and Appl., 93(1):1-55, January 2026.
- Zeguan Wu, Xiu Yang, Tamás Terlaky. A preconditioned inexact infeasible quantum interior point method for linear optimization. Comp. Opt. and Appl., 93(3):1225-1257, April 2026.
- Keisuke Murakami, Takeaki Uno. A heuristic algorithm for the cluster editing problem. Comp. Opt. and Appl., 93(1):267-301, January 2026.
- Yingying Li 0011, Hongwei Liu 0001, Hailong You, Zexian Liu, Fang Zhang. Multi-objective k-way parallel hypergraph partitioning with proximal gradient algorithm. Comp. Opt. and Appl., 93(3):1069-1105, April 2026.