OOIR: Observatory of International Research

Papers

(The TQCC of Optimization Methods & Software is 2. 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 2020-11-01 to 2024-11-01.)

Article	Citations
Inexact model: a framework for optimization and variational inequalities	31
Weakly-convex–concave min–max optimization: provable algorithms and applications in machine learning	27
Stochastic distributed learning with gradient quantization and double-variance reduction	18
An efficient hybrid conjugate gradient method for unconstrained optimization	16
A Benson-type algorithm for bounded convex vector optimization problems with vertex selection	14
Quasi-Newton methods for machine learning: forget the past, just sample	13
A class of smooth exact penalty function methods for optimization problems with orthogonality constraints	11
On the numerical performance of finite-difference-based methods for derivative-free optimization	10
Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments	9
An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality problems	9
A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems	8
Inexact basic tensor methods for some classes of convex optimization problems	8
Two families of hybrid conjugate gradient methods with restart procedures and their applications	7
Reflected three-operator splitting method for monotone inclusion problem	7
A fully stochastic second-order trust region method	6
Improved high-dimensional regression models with matrix approximations applied to the comparative case studies with support vector machines	6
Quadratic rates of asymptotic regularity for the Tikhonov–Mann iteration	6
Global optimization for sparse solution of least squares problems	6
AB/Push-Pull method for distributed optimization in time-varying directed networks	6
Accelerated gradient methods with absolute and relative noise in the gradient	5
An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization	5
A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation	5
On the Barzilai–Borwein gradient methods with structured secant equation for nonlinear least squares problems	5
HyKKT: a hybrid direct-iterative method for solving KKT linear systems	4
On minty variational principle for quasidifferentiable vector optimization problems	4

Solving SDP completely with an interior point oracle	4
Urban air mobility: from complex tactical conflict resolution to network design and fairness insights	4
Solution approaches for the vehicle routing problem with occasional drivers and time windows	4
A Newton-type proximal gradient method for nonlinear multi-objective optimization problems	4
An algorithm for nonsymmetric conic optimization inspired by MOSEK	4
On well-structured convex–concave saddle point problems and variational inequalities with monotone operators	4
Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization	4
Robust piecewise linearL₁-regression via nonsmooth DC optimization	4
Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number	3
A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions	3
Gradient methods with memory	3
Stochastic approximation versus sample average approximation for Wasserstein barycenters	3
Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software	3
Decentralized gradient tracking with local steps	3
Full-low evaluation methods for derivative-free optimization	3
Outer approximation algorithms for convex vector optimization problems	3
Efficient numerical methods to solve sparse linear equations with application to PageRank	2
Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming	2
Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case	2
Stochastic block projection algorithms with extrapolation for convex feasibility problems	2
A class of projected-search methods for bound-constrained optimization	2
A two-step new modulus-based matrix splitting method for vertical linear complementarity problem	2
A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results	2
A new multipoint symmetric secant method with a dense initial matrix	2
The role of local steps in local SGD	2
Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays	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
Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments	2
Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space	2
A penalty decomposition approach for multi-objective cardinality-constrained optimization problems	2
Study on precoding optimization algorithms in massive MIMO system with multi-antenna users	2
Off-line exploration of rectangular cellular environments with a rectangular obstacle	2
Data-driven distributionally robust risk parity portfolio optimization	2
A modified direction approach for proper efficiency of multiobjective optimization	2
An active set method for bound-constrained optimization	2