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 2020-03-01 to 2024-03-01.)

Article	Citations
COCO: a platform for comparing continuous optimizers in a black-box setting	154
Modified Popov's explicit iterative algorithms for solving pseudomonotone equilibrium problems	40
A dual approach for optimal algorithms in distributed optimization over networks	27
Inexact model: a framework for optimization and variational inequalities	26
Complexity and performance of an Augmented Lagrangian algorithm	24
Weakly-convex–concave min–max optimization: provable algorithms and applications in machine learning	18
Primal–dual accelerated gradient methods with small-dimensional relaxation oracle	16
An ADMM-based interior-point method for large-scale linear programming	13
Inexact SARAH algorithm for stochastic optimization	13
EAGO.jl: easy advanced global optimization in Julia	11
A Benson-type algorithm for bounded convex vector optimization problems with vertex selection	10
An efficient hybrid conjugate gradient method for unconstrained optimization	9
A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization	9
On inexact solution of auxiliary problems in tensor methods for convex optimization	9
An efficient augmented Lagrangian method for support vector machine	8
Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass	7
Γ-robust linear complementarity problems	7
Tensor methods for finding approximate stationary points of convex functions	7
Stochastic distributed learning with gradient quantization and double-variance reduction	7
A class of smooth exact penalty function methods for optimization problems with orthogonality constraints	7
Quasi-Newton methods for machine learning: forget the past, just sample	7
Inexact basic tensor methods for some classes of convex optimization problems	7
Training GANs with centripetal acceleration	6
An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality problems	6
On basic operations related to network induction of discrete convex functions	6

Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments	6
Reflected three-operator splitting method for monotone inclusion problem	6
Newton projection method as applied to assembly simulation	5
A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems	5
On SOR-like iteration methods for solving weakly nonlinear systems	5
Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function	5
Improved high-dimensional regression models with matrix approximations applied to the comparative case studies with support vector machines	5
Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization	4
Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes	4
On the Barzilai–Borwein gradient methods with structured secant equation for nonlinear least squares problems	4
Stability analysis of a class of sparse optimization problems	4
Quadratic rates of asymptotic regularity for the Tikhonov–Mann iteration	4
An algorithm for nonsymmetric conic optimization inspired by MOSEK	4
On the numerical performance of finite-difference-based methods for derivative-free optimization	4
Global optimization for sparse solution of least squares problems	4
Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems	4
Robust piecewise linear L₁-regression via nonsmooth DC optimization	4
A DC approach for minimax fractional optimization programs with ratios of convex functions	4
A Newton-type proximal gradient method for nonlinear multi-objective optimization problems	3
Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number	3
A fully stochastic second-order trust region method	3
Projection-free accelerated method for convex optimization	3
Multistage stochastic programs with a random number of stages: dynamic programming equations, solution methods, and application to portfolio selection	3
Gradient methods with memory	3
Two families of hybrid conjugate gradient methods with restart procedures and their applications	3
Solving SDP completely with an interior point oracle	3
Solving quadratic multi-leader-follower games by smoothing the follower's best response	3
An alternating direction method of multipliers for the eigenvalue complementarity problem	3
On well-structured convex–concave saddle point problems and variational inequalities with monotone operators	3
A primal-dual interior point trust-region method for nonlinear semidefinite programming	3
Stochastic approximation versus sample average approximation for Wasserstein barycenters	3
Preference robust models in multivariate utility-based shortfall risk minimization	3
Further results on sum-of-squares tensors	3
An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions	2
A new multipoint symmetric secant method with a dense initial matrix	2
Study on precoding optimization algorithms in massive MIMO system with multi-antenna users	2
An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization	2
Accelerated gradient methods with absolute and relative noise in the gradient	2
A study of one-parameter regularization methods for mathematical programs with vanishing constraints	2
A penalty decomposition approach for multi-objective cardinality-constrained optimization problems	2
Solution approaches for the vehicle routing problem with occasional drivers and time windows	2
Cooperative differential games with continuous updating using Hamilton–Jacobi–Bellman equation	2
Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays	2
Gravity-magnetic cross-gradient joint inversion by the cyclic gradient method	2
A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results	2
Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case	2
Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software	2
Data-driven distributionally robust risk parity portfolio optimization	2
On the abs-polynomial expansion of piecewise smooth functions	2
Stochastic proximal linear method for structured non-convex problems	1

A class of projected-search methods for bound-constrained optimization	1
Off-line exploration of rectangular cellular environments with a rectangular obstacle	1
A modified direction approach for proper efficiency of multiobjective optimization	1
Exact penalties for decomposable convex optimization problems	1
Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods	1
A descent family of the spectral Hestenes–Stiefel method by considering the quasi-Newton method	1
Outer approximation algorithms for convex vector optimization problems	1
On minty variational principle for quasidifferentiable vector optimization problems	1
Tensorial total variation-based image and video restoration with optimized projection methods	1
Nonconvex equilibrium models for energy markets: exploiting price information to determine the existence of an equilibrium	1
A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates	1
On a transformation of the ∗-congruence Sylvester equation for the least squares optimization	1
Convergence analysis of stochastic higher-order majorization–minimization algorithms	1
Urban air mobility: from complex tactical conflict resolution to network design and fairness insights	1
Stochastic block projection algorithms with extrapolation for convex feasibility problems	1
Signed ring families and signed posets	1
AB/Push-Pull method for distributed optimization in time-varying directed networks	1
The rate of convergence of proximal method of multipliers for nonlinear programming	1
Projection onto the exponential cone: a univariate root-finding problem	1
General framework for binary classification on top samples	1
Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding	1
Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space	1
On the implementation of a quasi-Newton interior-point method for PDE-constrained optimization using finite element discretizations	1
Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming	1
Optimal algorithms for some inverse uncapacitated facility location problems on networks	1
On a multilevel Levenberg–Marquardt method for the training of artificial neural networks and its application to the solution of partial differential equations	1
A finite convergence algorithm for solving linear-quadratic network games with strategic complements and bounded strategies	1
Full-low evaluation methods for derivative-free optimization	1
Direct search nonsmooth constrained optimization via rounded ℓ₁ penalty functions	1
A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions	1
PathWyse: a flexible, open-source library for the resource constrained shortest path problem	1
Operator splitting for adaptive radiation therapy with nonlinear health dynamics	1
A globally convergent regularized interior point method for constrained optimization	1
Feasible Newton methods for symmetric tensor Z-eigenvalue problems	1
Interior point methods for solving Pareto eigenvalue complementarity problems	1
A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation	1
Loraine – an interior-point solver for low-rank semidefinite programming	1
Exact gradient methods with memory	1
Efficient numerical methods to solve sparse linear equations with application to PageRank	1
Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems	1
Using first-order information in direct multisearch for multiobjective optimization	1
A Newton-bracketing method for a simple conic optimization problem	1
The role of local steps in local SGD	1