- Anwa Zhou, Shiqian Yin, Jinyan Fan. All saddle points for polynomial optimization. Comp. Opt. and Appl., 90(3):721-752, April 2025.
- Ryan H. Vogt, Sven Leyffer, Todd S. Munson. A mixed-integer PDE-constrained optimization formulation for constructing electromagnetic cloaks with multiple materials. Comp. Opt. and Appl., 90(2):337-360, March 2025.
- Jianchao Bai, Miao Zhang, Hongchao Zhang. An inexact ADMM for separable nonconvex and nonsmooth optimization. Comp. Opt. and Appl., 90(2):445-479, March 2025.
- Huiling Zhang, Zi Xu. An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems. Comp. Opt. and Appl., 90(2):557-582, March 2025.
- Christian Kanzow, Alexandra Schwartz, Felix Weiß. The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results. Comp. Opt. and Appl., 90(1):77-112, January 2025.
- Felipe Atenas. Understanding the Douglas-Rachford splitting method through the lenses of Moreau-type envelopes. Comp. Opt. and Appl., 90(3):881-910, April 2025.
- Szilárd Csaba László. Solving convex optimization problems via a second order dynamical system with implicit Hessian damping and Tikhonov regularization. Comp. Opt. and Appl., 90(1):113-149, January 2025.
- Robert J. Baraldi, Drew P. Kouri. Efficient proximal subproblem solvers for a nonsmooth trust-region method. Comp. Opt. and Appl., 90(1):193-226, January 2025.
- Jiawang Nie, Defeng Sun, Xindong Tang, Min Zhang. Solving polynomial variational inequality problems via Lagrange multiplier expressions and Moment-SOS relaxations. Comp. Opt. and Appl., 90(2):361-394, March 2025.
- Hezhi Luo, Youmin Xu, Huixian Wu, Guoqiang Wang. A New branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation. Comp. Opt. and Appl., 90(1):257-301, January 2025.