- Ying Cui 0004, Ziyu He, Jong-Shi Pang. Nonconvex robust programming via value-function optimization. Comp. Opt. and Appl., 78(2):411-450, 2021.
- David Ek, Anders Forsgren. Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization. Comp. Opt. and Appl., 79(1):155-191, 2021.
- Pedro Borges, Claudia A. Sagastizábal, Mikhail V. Solodov. Decomposition Algorithms for Some Deterministic and Two-Stage Stochastic Single-Leader Multi-Follower Games. Comp. Opt. and Appl., 78(3):675-704, 2021.
- Yuzhu Wang, Akihiro Tanaka, Akiko Yoshise. Polyhedral approximations of the semidefinite cone and their application. Comp. Opt. and Appl., 78(3):893-913, 2021.
- Charles Audet, Kwassi Joseph Dzahini, Michael Kokkolaras, SĂ©bastien Le Digabel. Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates. Comp. Opt. and Appl., 79(1):1-34, 2021.
- Peixuan Li, Yuan Shen, Suhong Jiang, Zehua Liu, Caihua Chen. Convergence study on strictly contractive Peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms. Comp. Opt. and Appl., 78(1):87-124, 2021.
- Laurentiu Leustean, Pedro Pinto. Quantitative results on a Halpern-type proximal point algorithm. Comp. Opt. and Appl., 79(1):101-125, 2021.
- Christian Kanzow, Theresa Lechner. Globalized inexact proximal Newton-type methods for nonconvex composite functions. Comp. Opt. and Appl., 78(2):377-410, 2021.
- Caroline Geiersbach, Teresa Scarinci. Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces. Comp. Opt. and Appl., 78(3):705-740, 2021.
- Sander Dedoncker, Wim Desmet, Frank Naets. Generating set search using simplex gradients for bound-constrained black-box optimization. Comp. Opt. and Appl., 79(1):35-65, 2021.