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

Article	Citations
COCO: a platform for comparing continuous optimizers in a black-box setting	167
Inexact model: a framework for optimization and variational inequalities	28
Weakly-convex–concave min–max optimization: provable algorithms and applications in machine learning	25
Quasi-Newton methods for machine learning: forget the past, just sample	14
An ADMM-based interior-point method for large-scale linear programming	13
Inexact SARAH algorithm for stochastic optimization	13
An efficient hybrid conjugate gradient method for unconstrained optimization	12
EAGO.jl: easy advanced global optimization in Julia	12
A Benson-type algorithm for bounded convex vector optimization problems with vertex selection	12
Stochastic distributed learning with gradient quantization and double-variance reduction	11
A class of smooth exact penalty function methods for optimization problems with orthogonality constraints	9
Tensor methods for finding approximate stationary points of convex functions	9
Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments	8
Inexact basic tensor methods for some classes of convex optimization problems	8
An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality problems	8
Reflected three-operator splitting method for monotone inclusion problem	7
Γ-robust linear complementarity problems	7
Two families of hybrid conjugate gradient methods with restart procedures and their applications	6
On basic operations related to network induction of discrete convex functions	6
A primal-dual interior point trust-region method for nonlinear semidefinite programming	6
A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems	6
Quadratic rates of asymptotic regularity for the Tikhonov–Mann iteration	6
Newton projection method as applied to assembly simulation	6
On the numerical performance of finite-difference-based methods for derivative-free optimization	5
A DC approach for minimax fractional optimization programs with ratios of convex functions	5

Global optimization for sparse solution of least squares problems	5
Improved high-dimensional regression models with matrix approximations applied to the comparative case studies with support vector machines	5
A Newton-type proximal gradient method for nonlinear multi-objective optimization problems	4
Solving SDP completely with an interior point oracle	4
An algorithm for nonsymmetric conic optimization inspired by MOSEK	4
Accelerated gradient methods with absolute and relative noise in the gradient	4
On well-structured convex–concave saddle point problems and variational inequalities with monotone operators	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 C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation	4
Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization	4
A fully stochastic second-order trust region method	4
On the Barzilai–Borwein gradient methods with structured secant equation for nonlinear least squares problems	4
Preference robust models in multivariate utility-based shortfall risk minimization	3
Solution approaches for the vehicle routing problem with occasional drivers and time windows	3
Cooperative differential games with continuous updating using Hamilton–Jacobi–Bellman equation	3
Urban air mobility: from complex tactical conflict resolution to network design and fairness insights	3
Solving quadratic multi-leader-follower games by smoothing the follower's best response	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
Multistage stochastic programs with a random number of stages: dynamic programming equations, solution methods, and application to portfolio selection	3
Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number	3
An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization	3
Tensorial total variation-based image and video restoration with optimized projection methods	2
A penalty decomposition approach for multi-objective cardinality-constrained optimization problems	2
Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space	2
Study on precoding optimization algorithms in massive MIMO system with multi-antenna users	2
A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions	2
Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding	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
Outer approximation algorithms for convex vector optimization problems	2
Efficient numerical methods to solve sparse linear equations with application to PageRank	2
A new multipoint symmetric secant method with a dense initial matrix	2
Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming	2
AB/Push-Pull method for distributed optimization in time-varying directed networks	2
Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays	2
A two-step new modulus-based matrix splitting method for vertical linear complementarity problem	2
Gravity-magnetic cross-gradient joint inversion by the cyclic gradient method	2
On the abs-polynomial expansion of piecewise smooth functions	2
On minty variational principle for quasidifferentiable vector optimization problems	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
Off-line exploration of rectangular cellular environments with a rectangular obstacle	2
Data-driven distributionally robust risk parity portfolio optimization	2
A class of projected-search methods for bound-constrained optimization	2
An active set method for bound-constrained optimization	2
A study of one-parameter regularization methods for mathematical programs with vanishing constraints	2
Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization	1
Nonconvex equilibrium models for energy markets: exploiting price information to determine the existence of an equilibrium	1

Using first-order information in direct multisearch for multiobjective optimization	1
A Newton-bracketing method for a simple conic optimization problem	1
Full-low evaluation methods for derivative-free optimization	1
A descent family of the spectral Hestenes–Stiefel method by considering the quasi-Newton method	1
Projection onto the exponential cone: a univariate root-finding problem	1
An optimal interpolation set for model-based derivative-free optimization methods	1
Operator splitting for adaptive radiation therapy with nonlinear health dynamics	1
Feasible Newton methods for symmetric tensor Z-eigenvalue problems	1
On the implementation of a quasi-Newton interior-point method for PDE-constrained optimization using finite element discretizations	1
Decentralized gradient tracking with local steps	1
Optimal algorithms for some inverse uncapacitated facility location problems on networks	1
An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions	1
Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection	1
A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates	1
The role of local steps in local SGD	1
On a Frank-Wolfe approach for abs-smooth functions	1
A globally convergent regularized interior point method for constrained optimization	1
PathWyse: a flexible, open-source library for the resource constrained shortest path problem	1
A modified direction approach for proper efficiency of multiobjective optimization	1
General framework for binary classification on top samples	1
Exact gradient methods with memory	1
Loraine – an interior-point solver for low-rank semidefinite programming	1
Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems	1
Length-constrained cycle partition with an application to UAV routing*	1
A branch and bound method solving the max–min linear discriminant analysis problem	1
A finite convergence algorithm for solving linear-quadratic network games with strategic complements and bounded strategies	1
Interior point methods for solving Pareto eigenvalue complementarity problems	1
Convergence analysis of stochastic higher-order majorization–minimization algorithms	1
Stochastic block projection algorithms with extrapolation for convex feasibility problems	1
Exact penalties for decomposable convex optimization problems	1
Barzilai–Borwein-like rules in proximal gradient schemes for ℓ ₁ -regularized problems	1
Inexact tensor methods and their application to stochastic convex optimization	1
A gradient descent akin method for constrained optimization: algorithms and applications	1