OOIR: Observatory of International Research

Papers

(The median citation count of Optimization Methods & Software is 1. 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.)

Article	Citations
An adaptive regularization method in Banach spaces	40
Discretization and quantification for distributionally robust optimization with decision-dependent ambiguity sets	22
FLECS: a federated learning second-order framework via compression and sketching	22
A majorization penalty method for SVM with sparse constraint	19
Exact gradient methods with memory	18
Sparse convex optimization toolkit: a mixed-integer framework	18
Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations	16
Correction	14
A two-step new modulus-based matrix splitting method for vertical linear complementarity problem	14
The largest- K -norm for general measure spaces and a DC reformulation for L ⁰ -constrained problems in function sp	13
Numerical simulation of differential-algebraic equations with embedded global optimization criteria	11
Practical perspectives on symplectic accelerated optimization	11
A proximal-gradient inertial algorithm with Tikhonov regularization: strong convergence to the minimal norm solution	11
Toward state estimation by high gain differentiators with automatic differentiation	10
Spatially sparse optimization problems in fractional order Sobolev spaces	8
Data-driven distributionally robust risk parity portfolio optimization	7
Conic optimization-based algorithms for nonnegative matrix factorization	7
Two RMIL-type schemes with compressed sensing applications	7
Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software	6
A hybrid optimal control problem constrained with hyperelasticity and the global injectivity condition	6
Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems	6
The Dai–Liao-type conjugate gradient methods for solving vector optimization problems	6
A mixed-integer programming formulation for optimizing the double row layout problem	6
On the proximal point algorithm for strongly quasiconvex functions in Hadamard spaces	5
On the numerical performance of finite-difference-based methods for derivative-free optimization	5

One-point feedback for composite optimization with applications to distributed and federated learning	5
Sequential hierarchical least-squares programming for prioritized non-linear optimal control	5
An efficient hybrid conjugate gradient method for unconstrained optimization	5
Indirect methods for optimal control of parabolic hybrid PDE-dynamical/switching systems using relaxation	5
A note on the generalized Hessian of the least squares associated with systems of linear inequalities	4
Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization	4
AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems	4
Customized Douglas-Rachford splitting methods for structured inverse variational inequality problems	4
The role of local steps in local SGD	4
A family of limited memory three term conjugate gradient methods	4
Three-operator reflected forward-backward splitting algorithm with double inertial effects	4
Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods	4
Robust GAN inversion	4
Proximal subgradient method for non-Lipschitz objective functions	4
Decentralized gradient tracking with local steps	4
Cone-compactness of a set and related topological properties: stability issues and applications	4
Accelerated gradient methods with absolute and relative noise in the gradient	3
A general framework for floating point error analysis of first-order simplex derivatives	3
A gradient descent akin method for constrained optimization: algorithms and applications	3
On pseudoinverse-free randomized methods for linear systems: unified framework and acceleration	3
Distributionally robust joint chance-constrained programming with Wasserstein metric	3
A trust-region scheme for constrained multi-objective optimization problems with superlinear convergence property	3
Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection	3
Inexact tensor methods and their application to stochastic convex optimization	3
A meta-heuristic extension of the Lagrangian heuristic framework	3
An efficient model for the multiple allocation hub maximal covering problem	3
Towards global parameter estimation exploiting reduced data sets	3
Dual spectral projected gradient method for generalized log-det semidefinite programming	3
A novel approach for solving a class of diffusion identification problems	3
Numerical methods for distributed stochastic compositional optimization problems with aggregative structure	3
Barzilai–Borwein-like rules in proximal gradient schemes for ℓ ₁ -regularized problems	3
On the complexity of a quadratic regularization algorithm for minimizing nonsmooth and nonconvex functions	3
Two modified conjugate gradient methods for unconstrained optimization	3
FRanDI: data-free neural network compression via feature regression and deep inversion	3
Foreword	3
Superlinear convergence of an interior point algorithm on linear semi-definite feasibility problems	3
Interior point methods for solving Pareto eigenvalue complementarity problems	3
Distributed learning with compressed gradient differences	2
An inexact restoration direct multisearch filter approach to multiobjective constrained derivative-free optimization	2
Sequential approximate optimization with adaptive parallel infill strategy assisted by inaccurate Pareto front	2
Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures	2
On minty variational principle for quasidifferentiable vector optimization problems	2
Preface	2
Reduced basis model predictive control for semilinear parabolic partial differential equations	2
Approximating Hessian matrices using Bayesian inference: a new approach for quasi-Newton methods in stochastic optimization	2
New iterative algorithms with self-adaptive step size for solving split equality fixed point problem and its applications	2
Two efficient spectral hybrid CG methods based on memoryless BFGS direction and Dai–Liao conjugacy condition	2
Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network	2
A penalty decomposition approach for multi-objective cardinality-constrained optimization problems	2
An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions	2

Optimized convergence of stochastic gradient descent by weighted averaging	2
Parametric transformation approach for non-linear interval fractional programming: a case study on water-efficient cultivation	2
A bundle trust-region algorithm for nonsmooth nonconvex constrained optimization	2
Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments	2
Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods	2
Robust reverse 1-center problems on trees with interval costs	2
An incremental descent method for multi-objective optimization	2
Convergences for robust bilevel polynomial programmes with applications	2
Bilevel optimization with a multi-objective lower-level problem: risk-neutral and risk-averse formulations	2
Near-optimal algorithm with complexity separation for strongly convex-strongly concave composite saddle point problems	1
Projection onto the exponential cone: a univariate root-finding problem	1
A new multipoint symmetric secant method with a dense initial matrix	1
Length-constrained cycle partition with an application to UAV routing*	1
IntSat: integer linear programming by conflict-driven constraint learning	1
SLiSeS: subsampled line search spectral gradient method for finite sums	1
Two families of hybrid conjugate gradient methods with restart procedures and their applications	1
An active set method for bound-constrained optimization	1
Distributionally robust expected residual minimization for stochastic variational inequality problems	1
Complexity and performance for two classes of noise-tolerant first-order algorithms	1
Linear programming with nonparametric penalty programs and iterated thresholding	1
Outer approximation algorithms for convex vector optimization problems	1
Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem	1
AB /Push-Pull method for distributed optimization in time-varying directed networks	1
Delay-tolerant distributed Bregman proximal algorithms	1
Shape-changing trust-region methods using multipoint symmetric secant matrices	1
Using general triangle inequalities within quadratic convex reformulation method	1
On the implementation of a quasi-Newton interior-point method for PDE-constrained optimization using finite element discretizations	1
A first-order regularized approach to the order-value optimization problem	1
A highly efficient algorithm for solving exclusive lasso problems	1
Operator splitting for adaptive radiation therapy with nonlinear health dynamics	1
A new inertial projected reflected gradient method with application to optimal control problems	1
Optimal order multigrid preconditioners for the distributed control of parabolic equations with coarsening in space and time	1
Complexity of a class of first-order objective-function-free optimization algorithms	1
Exponential convergence rates of a second-order dynamic system and algorithm for a linear equality constrained optimization problem	1
GBOML: a structure-exploiting optimization modelling language in Python	1
Closing duality gaps of SDPs completely through perturbation when singularity degree is one	1
PDE-constrained shape optimization with first-order and Newton-type methods in the W ^1,∞ topology	1
Tensor decompositions for count data that leverage stochastic and deterministic optimization	1
Least squares monotonic unimodal approximations to successively updated data and an application to a Covid-19 outbreak	1
Crossing edge minimization in radial outerplanar layered graphs using segment paths	1
A new spectral conjugate subgradient method with application in computed tomography image reconstruction	1
On a Frank-Wolfe approach for abs-smooth functions	1
A quasi-Newton method in shape optimization for a transmission problem	1
A branch and bound method solving the max–min linear discriminant analysis problem	1
Gradient-type methods for decentralized optimization problems with Polyak–Łojasiewicz condition over time-varying networks	1
PathWyse: a flexible, open-source library for the resource constrained shortest path problem	1
A derivative free projection method for the singularities of vector fields with convex constraints on Hadamard manifolds	1
Solution approaches for the vehicle routing problem with occasional drivers and time windows	1
Implementation of a projection and rescaling algorithm for second-order conic feasibility problems	1
Stochastic distributed learning with gradient quantization and double-variance reduction	1
Improved high-dimensional regression models with matrix approximations applied to the comparative case studies with support vector machines	1
A finite convergence algorithm for solving linear-quadratic network games with strategic complements and bounded strategies	1
A gradient-based method for joint chance-constrained optimization with continuous distributions	1