OOIR: Observatory of International Research

Papers

(The TQCC of Journal of Global Optimization is 4. 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-05-01 to 2024-05-01.)

Article	Citations
Expected improvement for expensive optimization: a review	90
The DIRECT algorithm: 25 years Later	70
Data-driven distributionally robust chance-constrained optimization with Wasserstein metric	46
Surrogate optimization of deep neural networks for groundwater predictions	40
Production and transport scheduling in flexible job shop manufacturing systems	38
An optimization approach to solving the split feasibility problem in Hilbert spaces	20
Gaussian process optimization with failures: classification and convergence proof	19
Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems	18
Optimal decision trees for categorical data via integer programming	18
The exact solution of multiparametric quadratically constrained quadratic programming problems	16
MVMOO: Mixed variable multi-objective optimisation	16
General splitting methods with linearization for the split feasibility problem	16
Characterization results of solutions in interval-valued optimization problems with mixed constraints	16
Strong convergence of inertial projection and contraction methods for pseudomonotone variational inequalities with applications to optimal control problems	15
A regularized point cloud registration approach for orthogonal transformations	14
Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint	13
Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks	13
Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization	13
Outer space branch and bound algorithm for solving linear multiplicative programming problems	12
Stochastic optimization with adaptive restart: a framework for integrated local and global learning	12
An extension of the proximal point algorithm beyond convexity	11
Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system	11
Advances in verification of ReLU neural networks	11
Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities	11
Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization	11

A filter proximal bundle method for nonsmooth nonconvex constrained optimization	10
GRASP with Variable Neighborhood Descent for the online order batching problem	10
Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs	10
Refugee migration networks and regulations: a multiclass, multipath variational inequality framework	10
An empirical study of various candidate selection and partitioning techniques in the DIRECT framework	10
Dynamic multicriteria games with asymmetric players	10
A general branch-and-bound framework for continuous global multiobjective optimization	10
Generalized risk parity portfolio optimization: an ADMM approach	9
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation	9
A combination of RANSAC and DBSCAN methods for solving the multiple geometrical object detection problem	8
Augmented Lagrangian method for second-order cone programs under second-order sufficiency	8
Inverse multiobjective optimization: Inferring decision criteria from data	8
The finite intersection property for equilibrium problems	8
Maximum shortest path interdiction problem by upgrading edges on trees under weighted $$l_1$$ norm	8
One-exact approximate Pareto sets	8
Weak convergence of an extended splitting method for monotone inclusions	8
Conical averagedness and convergence analysis of fixed point algorithms	8
Finding optimal points for expensive functions using adaptive RBF-based surrogate model via uncertainty quantification	8
Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization	8
Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations	8
A fixed point iterative method for tensor complementarity problems with the implicit Z-tensors	7
Accelerated Dai-Liao projection method for solving systems of monotone nonlinear equations with application to image deblurring	7
Global optimization for the multilevel European gas market system with nonlinear flow models on trees	7
A power penalty approach to a mixed quasilinear elliptic complementarity problem	7
The EMS vehicle patient transportation problem during a demand surge	7
Convex hull representations for bounded products of variables	7
Detecting and solving aircraft conflicts using bilevel programming	7
Fast algorithms for sparse portfolio selection considering industries and investment styles	7
On the Extension of the DIRECT Algorithm to Multiple Objectives	7
Error bound analysis for vector equilibrium problems with partial order provided by a polyhedral cone	7
The extreme rays of the $$6\times 6$$ copositive cone	7
On $$\Delta $$-modular integer linear problems in the canonical form and equivalent problems	7
The supporting hyperplane optimization toolkit for convex MINLP	7
A heuristic and metaheuristic approach to the static weapon target assignment problem	7
Review and comparison of algorithms and software for mixed-integer derivative-free optimization	7
Integrating $$\varepsilon $$-dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems	7
TREGO: a trust-region framework for efficient global optimization	7
On robustness for set-valued optimization problems	6
On stationarity for nonsmooth multiobjective problems with vanishing constraints	6
Stability of efficient solutions to set optimization problems	6
Global dynamic optimization with Hammerstein–Wiener models embedded	6
Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems	6
Maximization problems of balancing submodular relevance and supermodular diversity	6
Lipschitz-inspired HALRECT algorithm for derivative-free global optimization	6
New inertial forward-backward type for variational inequalities with Quasi-monotonicity	6
Second-order KKT optimality conditions for multiobjective discrete optimal control problems	6
Copula theory approach to stochastic geometric programming	6
Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials	6
Open issues and recent advances in DC programming and DCA	6
Integer programming formulations and efficient local search for relaxed correlation clustering	6

Supply chain networks, wages, and labor productivity: insights from Lagrange. analysis and computations	6
Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations	6
Simultaneous distributed-boundary optimal control problems driven by nonlinear complementarity systems	6
Using symbolic calculations to determine largest small polygons	6
Improved interval methods for solving circle packing problems in the unit square	5
Exact SDP relaxations of quadratically constrained quadratic programs with forest structures	5
Packing convex polygons in minimum-perimeter convex hulls	5
On maximum-sum matchings of points	5
Global optimization of mixed-integer nonlinear programs with SCIP 8	5
Geoffrion’s proper efficiency in linear fractional vector optimization with unbounded constraint sets	5
Proximity measures based on KKT points for constrained multi-objective optimization	5
Karush–Kuhn–Tucker type optimality condition for quasiconvex programming in terms of Greenberg–Pierskalla subdifferential	5
Hospital service levels during drug shortages: Stocking and transshipment policies for pharmaceutical inventory	5
On strong duality in linear copositive programming	5
Painlevé-Kuratowski convergence of minimal solutions for set-valued optimization problems via improvement sets	5
Primal-dual splittings as fixed point iterations in the range of linear operators	5
Vertex quickest 1-center location problem on trees and its inverse problem under weighted $$l_\infty $$ norm	5
Linear convergence of a nonmonotone projected gradient method for multiobjective optimization	5
Partial gradient optimal thresholding algorithms for a class of sparse optimization problems	5
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT	5
Solution sets of three sparse optimization problems for multivariate regression	5
Multi-objective convex polynomial optimization and semidefinite programming relaxations	5
Scenario-based cuts for structured two-stage stochastic and distributionally robust p-order conic mixed integer programs	5
A three-stage stochastic optimization model integrating 5G technology and UAVs for disaster management	5
Linearization of McCormick relaxations and hybridization with the auxiliary variable method	5
Numerical methods using two different approximations of space-filling curves for black-box global optimization	5
A scalarization scheme for binary relations with applications to set-valued and robust optimization	5
Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections	5
An approximation algorithm for multi-objective optimization problems using a box-coverage	5
Resolving learning rates adaptively by locating stochastic non-negative associated gradient projection points using line searches	5
Necessary conditions for weak minima and for strict minima of order two in nonsmooth constrained multiobjective optimization	4
Tight bounds on the maximal perimeter and the maximal width of convex small polygons	4
Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems	4
Adaptive seeding for profit maximization in social networks	4
Alternating DC algorithm for partial DC programming problems	4
Branch-and-price for a class of nonconvex mixed-integer nonlinear programs	4
On global subdifferentials with applications in nonsmooth optimization	4
Cooperative multiobjective optimization with bounds on objective functions	4
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower’s objective	4
Dynamical system for solving bilevel variational inequalities	4
A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice	4
Gaining or losing perspective	4
An efficient alternating minimization method for fourth degree polynomial optimization	4
A generalized block-iterative projection method for the common fixed point problem induced by cutters	4
A variable neighborhood search algorithm for the $$ (r{\mid }p) $$ hub–centroid problem under the price war	4
Efficient approximation of the metric CVRP in spaces of fixed doubling dimension	4
Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes	4
Multi-objective dynamic programming with limited precision	4