Optimization Methods & Software

Papers
(The TQCC of Optimization Methods & Software is 3. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2022-01-01 to 2026-01-01.)
ArticleCitations
An adaptive regularization method in Banach spaces40
Discretization and quantification for distributionally robust optimization with decision-dependent ambiguity sets22
FLECS: a federated learning second-order framework via compression and sketching22
A majorization penalty method for SVM with sparse constraint19
Exact gradient methods with memory18
Sparse convex optimization toolkit: a mixed-integer framework18
Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations16
Correction14
A two-step new modulus-based matrix splitting method for vertical linear complementarity problem14
The largest- K -norm for general measure spaces and a DC reformulation for L 0 -constrained problems in function sp13
Practical perspectives on symplectic accelerated optimization11
A proximal-gradient inertial algorithm with Tikhonov regularization: strong convergence to the minimal norm solution11
Numerical simulation of differential-algebraic equations with embedded global optimization criteria11
Toward state estimation by high gain differentiators with automatic differentiation10
Spatially sparse optimization problems in fractional order Sobolev spaces8
Conic optimization-based algorithms for nonnegative matrix factorization7
Two RMIL-type schemes with compressed sensing applications7
Data-driven distributionally robust risk parity portfolio optimization7
Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems6
The Dai–Liao-type conjugate gradient methods for solving vector optimization problems6
A mixed-integer programming formulation for optimizing the double row layout problem6
Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software6
A hybrid optimal control problem constrained with hyperelasticity and the global injectivity condition6
One-point feedback for composite optimization with applications to distributed and federated learning5
Sequential hierarchical least-squares programming for prioritized non-linear optimal control5
An efficient hybrid conjugate gradient method for unconstrained optimization5
Indirect methods for optimal control of parabolic hybrid PDE-dynamical/switching systems using relaxation5
On the proximal point algorithm for strongly quasiconvex functions in Hadamard spaces5
On the numerical performance of finite-difference-based methods for derivative-free optimization5
Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods4
Robust GAN inversion4
Proximal subgradient method for non-Lipschitz objective functions4
Decentralized gradient tracking with local steps4
Cone-compactness of a set and related topological properties: stability issues and applications4
A note on the generalized Hessian of the least squares associated with systems of linear inequalities4
Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization4
AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems4
Customized Douglas-Rachford splitting methods for structured inverse variational inequality problems4
The role of local steps in local SGD4
A family of limited memory three term conjugate gradient methods4
Three-operator reflected forward-backward splitting algorithm with double inertial effects4
Inexact tensor methods and their application to stochastic convex optimization3
A meta-heuristic extension of the Lagrangian heuristic framework3
An efficient model for the multiple allocation hub maximal covering problem3
Towards global parameter estimation exploiting reduced data sets3
Dual spectral projected gradient method for generalized log-det semidefinite programming3
A novel approach for solving a class of diffusion identification problems3
Numerical methods for distributed stochastic compositional optimization problems with aggregative structure3
Barzilai–Borwein-like rules in proximal gradient schemes for ℓ 1 -regularized problems3
On the complexity of a quadratic regularization algorithm for minimizing nonsmooth and nonconvex functions3
Two modified conjugate gradient methods for unconstrained optimization3
FRanDI: data-free neural network compression via feature regression and deep inversion3
Foreword3
Superlinear convergence of an interior point algorithm on linear semi-definite feasibility problems3
Interior point methods for solving Pareto eigenvalue complementarity problems3
Accelerated gradient methods with absolute and relative noise in the gradient3
A general framework for floating point error analysis of first-order simplex derivatives3
A gradient descent akin method for constrained optimization: algorithms and applications3
On pseudoinverse-free randomized methods for linear systems: unified framework and acceleration3
Distributionally robust joint chance-constrained programming with Wasserstein metric3
A trust-region scheme for constrained multi-objective optimization problems with superlinear convergence property3
Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection3
0.063360929489136