- Quan Yu, Xinzhen Zhang. A smoothing proximal gradient algorithm for matrix rank minimization problem. Comp. Opt. and Appl., 81(2):519-538, 2022.
- Qihang Lin, Runchao Ma, Yangyang Xu. Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization. Comp. Opt. and Appl., 82(1):175-224, 2022.
- Xiubo Liang, Guoqiang Wang, Bo Yu. A reduced proximal-point homotopy method for large-scale non-convex BQP. Comp. Opt. and Appl., 81(2):539-567, 2022.
- Viviana A. Ramirez, Graciela N. Sottosanto. Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems. Comp. Opt. and Appl., 81(3):769-788, 2022.
- Ernesto G. Birgin, José M. Martínez. Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients. Comp. Opt. and Appl., 81(3):689-715, 2022.
- Peter Benner, Jan Heiland, Steffen W. R. Werner. ∞ -controllers. Comp. Opt. and Appl., 82(1):225-249, 2022.
- Murwan Siddig, Yongjia Song. Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse. Comp. Opt. and Appl., 81(1):201-250, 2022.
- WenJie Zhao, GuangMing Zhou. Local saddle points for unconstrained polynomial optimization. Comp. Opt. and Appl., 82(1):89-106, 2022.
- Tianxiang Liu, Akiko Takeda. An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems. Comp. Opt. and Appl., 82(1):141-173, 2022.
- Xin Jiang, Lieven Vandenberghe. Bregman primal-dual first-order method and application to sparse semidefinite programming. Comp. Opt. and Appl., 81(1):127-159, 2022.