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

Article	Citations
Expected improvement for expensive optimization: a review	81
The DIRECT algorithm: 25 years Later	65
Data-driven distributionally robust chance-constrained optimization with Wasserstein metric	44
Surrogate optimization of deep neural networks for groundwater predictions	38
Production and transport scheduling in flexible job shop manufacturing systems	34
An optimization approach to solving the split feasibility problem in Hilbert spaces	18
Gaussian process optimization with failures: classification and convergence proof	17
Optimal decision trees for categorical data via integer programming	17
MVMOO: Mixed variable multi-objective optimisation	16
Characterization results of solutions in interval-valued optimization problems with mixed constraints	15
General splitting methods with linearization for the split feasibility problem	15
Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems	15
The exact solution of multiparametric quadratically constrained quadratic programming problems	15
A regularized point cloud registration approach for orthogonal transformations	14
Strong convergence of inertial projection and contraction methods for pseudomonotone variational inequalities with applications to optimal control problems	14
Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks	13
Outer space branch and bound algorithm for solving linear multiplicative programming problems	12
Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint	12
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
Stochastic optimization with adaptive restart: a framework for integrated local and global learning	11
Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization	11
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
A filter proximal bundle method for nonsmooth nonconvex constrained optimization	10

Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization	10
Refugee migration networks and regulations: a multiclass, multipath variational inequality framework	10
A general branch-and-bound framework for continuous global multiobjective optimization	10
Dynamic multicriteria games with asymmetric players	9
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation	9
Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization	9
A sparse chance constrained portfolio selection model with multiple constraints	9
Development of an adaptive infill criterion for constrained multi-objective asynchronous surrogate-based optimization	9
Generalized risk parity portfolio optimization: an ADMM approach	9
An extension of the proximal point algorithm beyond convexity	9
One-exact approximate Pareto sets	8
Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities	8
Maximum shortest path interdiction problem by upgrading edges on trees under weighted $$l_1$$ norm	8
An empirical study of various candidate selection and partitioning techniques in the DIRECT framework	8
Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations	8
Finding optimal points for expensive functions using adaptive RBF-based surrogate model via uncertainty quantification	8
Augmented Lagrangian method for second-order cone programs under second-order sufficiency	8
The finite intersection property for equilibrium problems	8
A combination of RANSAC and DBSCAN methods for solving the multiple geometrical object detection problem	8
Conical averagedness and convergence analysis of fixed point algorithms	7
The EMS vehicle patient transportation problem during a demand surge	7
Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization	7
A heuristic and metaheuristic approach to the static weapon target assignment problem	7
Global optimization for the multilevel European gas market system with nonlinear flow models on trees	7
Review and comparison of algorithms and software for mixed-integer derivative-free optimization	7
Convex hull representations for bounded products of variables	7
Detecting and solving aircraft conflicts using bilevel programming	7
A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection	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
Integrating $$\varepsilon $$-dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems	7
The extreme rays of the $$6\times 6$$ copositive cone	7
Fast algorithms for sparse portfolio selection considering industries and investment styles	7
Weak convergence of an extended splitting method for monotone inclusions	7
TREGO: a trust-region framework for efficient global optimization	6
Stability of efficient solutions to set optimization problems	6
The supporting hyperplane optimization toolkit for convex MINLP	6
Maximization problems of balancing submodular relevance and supermodular diversity	6
Capacitated assortment and price optimization under the nested logit model	6
A power penalty approach to a mixed quasilinear elliptic complementarity problem	6
Supply chain networks, wages, and labor productivity: insights from Lagrange. analysis and computations	6
Copula theory approach to stochastic geometric programming	6
Global dynamic optimization with Hammerstein–Wiener models embedded	6
Accelerated Dai-Liao projection method for solving systems of monotone nonlinear equations with application to image deblurring	6
Using symbolic calculations to determine largest small polygons	6
On stationarity for nonsmooth multiobjective problems with vanishing constraints	6
Second-order KKT optimality conditions for multiobjective discrete optimal control problems	6
Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems	6
A fixed point iterative method for tensor complementarity problems with the implicit Z-tensors	6
Inverse multiobjective optimization: Inferring decision criteria from data	6

Linear convergence of a nonmonotone projected gradient method for multiobjective optimization	5
Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections	5
Simultaneous distributed-boundary optimal control problems driven by nonlinear complementarity systems	5
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT	5
Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials	5
On strong duality in linear copositive programming	5
Integer programming formulations and efficient local search for relaxed correlation clustering	5
Open issues and recent advances in DC programming and DCA	5
On maximum-sum matchings of points	5
Geoffrion’s proper efficiency in linear fractional vector optimization with unbounded constraint sets	5
Solution maps of polynomial variational inequalities	5
Karush–Kuhn–Tucker type optimality condition for quasiconvex programming in terms of Greenberg–Pierskalla subdifferential	5
Multi-objective convex polynomial optimization and semidefinite programming relaxations	5
Improved interval methods for solving circle packing problems in the unit square	5
On robustness for set-valued optimization problems	5
Painlevé-Kuratowski convergence of minimal solutions for set-valued optimization problems via improvement sets	5
Linearization of McCormick relaxations and hybridization with the auxiliary variable method	5
Partial gradient optimal thresholding algorithms for a class of sparse optimization problems	5
Proximity measures based on KKT points for constrained multi-objective optimization	5
Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations	5
An approximation algorithm for multi-objective optimization problems using a box-coverage	5
Solution sets of three sparse optimization problems for multivariate regression	5
Exact SDP relaxations of quadratically constrained quadratic programs with forest structures	5
Lipschitz-inspired HALRECT algorithm for derivative-free global optimization	5
Scenario-based cuts for structured two-stage stochastic and distributionally robust p-order conic mixed integer programs	5
Primal-dual splittings as fixed point iterations in the range of linear operators	4
A scalarization scheme for binary relations with applications to set-valued and robust optimization	4
Tight bounds on the maximal perimeter and the maximal width of convex small polygons	4
On $$\Delta $$-modular integer linear problems in the canonical form and equivalent problems	4
Hospital service levels during drug shortages: Stocking and transshipment policies for pharmaceutical inventory	4
Alternating DC algorithm for partial DC programming problems	4
Gaining or losing perspective	4
A variable neighborhood search algorithm for the $$ (r{\mid }p) $$ hub–centroid problem under the price war	4
Numerical methods using two different approximations of space-filling curves for black-box global optimization	4
Efficient approximation of the metric CVRP in spaces of fixed doubling dimension	4
Resolving learning rates adaptively by locating stochastic non-negative associated gradient projection points using line searches	4
Revenue maximization of Internet of things provider using variable neighbourhood search	4
Packing convex polygons in minimum-perimeter convex hulls	4
Multi-objective dynamic programming with limited precision	4
New inertial forward-backward type for variational inequalities with Quasi-monotonicity	4
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower’s objective	4
Adaptive seeding for profit maximization in social networks	4
A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice	4
Dynamical system for solving bilevel variational inequalities	4