- Pooriya Beyhaghi, Ryan Alimo, Thomas Bewley. A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging. Comp. Opt. and Appl., 76(1):1-31, 2020.
- Patrick Mehlitz. A comparison of solution approaches for the numerical treatment of or-constrained optimization problems. Comp. Opt. and Appl., 76(1):233-275, 2020.
- Xiao Wang, Xinzhen Zhang, GuangMing Zhou. SDP relaxation algorithms for $\mathbf {P}(\mathbf {P}_0)$-tensor detection. Comp. Opt. and Appl., 75(3):739-752, 2020.
- Tianxiao Sun, Ion Necoara, Quoc Tran-Dinh. Composite convex optimization with global and local inexact oracles. Comp. Opt. and Appl., 76(1):69-124, 2020.
- Zexian Liu, Hongwei Liu, Yu-Hong Dai. An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization. Comp. Opt. and Appl., 75(1):145-167, 2020.
- Nazli Dolu, Umur Hastürk, Mustafa Kemal Tural. Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances. Comp. Opt. and Appl., 75(2):537-560, 2020.
- Takashi Nakagaki, Mituhiro Fukuda, Sunyoung Kim, Makoto Yamashita. A dual spectral projected gradient method for log-determinant semidefinite problems. Comp. Opt. and Appl., 76(1):33-68, 2020.
- Enrico Bettiol, Lucas Létocart, Francesco Rinaldi, Emiliano Traversi. A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs. Comp. Opt. and Appl., 75(2):321-360, 2020.
- Olivier Fercoq, Zheng Qu. Restarting the accelerated coordinate descent method with a rough strong convexity estimate. Comp. Opt. and Appl., 75(1):63-91, 2020.
- Si-Tong Lu, Miao Zhang, Qing-Na Li. Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints. Comp. Opt. and Appl., 76(2):535-569, 2020.