Journal of Global Optimization

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-02-01 to 2024-02-01.)
ArticleCitations
Expected improvement for expensive optimization: a review76
The DIRECT algorithm: 25 years Later61
Data-driven distributionally robust chance-constrained optimization with Wasserstein metric43
Surrogate optimization of deep neural networks for groundwater predictions38
Production and transport scheduling in flexible job shop manufacturing systems33
DOMINO: Data-driven Optimization of bi-level Mixed-Integer NOnlinear Problems23
An optimization approach to solving the split feasibility problem in Hilbert spaces18
Gaussian process optimization with failures: classification and convergence proof17
MVMOO: Mixed variable multi-objective optimisation16
Modelling and solving the multi-quays berth allocation and crane assignment problem with availability constraints16
Optimal decision trees for categorical data via integer programming16
The exact solution of multiparametric quadratically constrained quadratic programming problems15
Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems15
General splitting methods with linearization for the split feasibility problem15
Characterization results of solutions in interval-valued optimization problems with mixed constraints15
A regularized point cloud registration approach for orthogonal transformations14
Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks13
Strong convergence of inertial projection and contraction methods for pseudomonotone variational inequalities with applications to optimal control problems12
Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint12
Advances in verification of ReLU neural networks11
Outer space branch and bound algorithm for solving linear multiplicative programming problems11
Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system11
Stochastic optimization with adaptive restart: a framework for integrated local and global learning11
Damped Newton’s method on Riemannian manifolds10
Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization10
Refugee migration networks and regulations: a multiclass, multipath variational inequality framework10
A general branch-and-bound framework for continuous global multiobjective optimization10
A filter proximal bundle method for nonsmooth nonconvex constrained optimization10
GRASP with Variable Neighborhood Descent for the online order batching problem10
Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs10
Dynamic multicriteria games with asymmetric players9
Development of an adaptive infill criterion for constrained multi-objective asynchronous surrogate-based optimization9
A sparse chance constrained portfolio selection model with multiple constraints9
Generalized risk parity portfolio optimization: an ADMM approach9
One-exact approximate Pareto sets8
An empirical study of various candidate selection and partitioning techniques in the DIRECT framework8
The finite intersection property for equilibrium problems8
Finding optimal points for expensive functions using adaptive RBF-based surrogate model via uncertainty quantification8
Augmented Lagrangian method for second-order cone programs under second-order sufficiency8
Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization8
Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations8
Maximum shortest path interdiction problem by upgrading edges on trees under weighted $$l_1$$ norm8
The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming8
Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization8
An extension of the proximal point algorithm beyond convexity8
Review and comparison of algorithms and software for mixed-integer derivative-free optimization7
The extreme rays of the $$6\times 6$$ copositive cone7
Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization7
Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities7
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation7
On the Extension of the DIRECT Algorithm to Multiple Objectives7
The EMS vehicle patient transportation problem during a demand surge7
A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model7
Detecting and solving aircraft conflicts using bilevel programming7
Fast algorithms for sparse portfolio selection considering industries and investment styles7
Weak convergence of an extended splitting method for monotone inclusions7
Error bound analysis for vector equilibrium problems with partial order provided by a polyhedral cone7
Integrating $$\varepsilon $$-dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems7
Limiting Subdifferential Calculus and Perturbed Distance Function in Riemannian Manifolds7
A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection7
A heuristic and metaheuristic approach to the static weapon target assignment problem7
Global optimization for the multilevel European gas market system with nonlinear flow models on trees7
A combination of RANSAC and DBSCAN methods for solving the multiple geometrical object detection problem6
Convex hull representations for bounded products of variables6
Supply chain networks, wages, and labor productivity: insights from Lagrange. analysis and computations6
Copula theory approach to stochastic geometric programming6
Capacitated assortment and price optimization under the nested logit model6
Inverse multiobjective optimization: Inferring decision criteria from data6
On stationarity for nonsmooth multiobjective problems with vanishing constraints6
Second-order KKT optimality conditions for multiobjective discrete optimal control problems6
Stability of efficient solutions to set optimization problems6
Global dynamic optimization with Hammerstein–Wiener models embedded6
Using symbolic calculations to determine largest small polygons6
A power penalty approach to a mixed quasilinear elliptic complementarity problem6
Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization6
TREGO: a trust-region framework for efficient global optimization6
The supporting hyperplane optimization toolkit for convex MINLP6
A fixed point iterative method for tensor complementarity problems with the implicit Z-tensors6
Global minimum variance portfolios under uncertainty: a robust optimization approach6
Integer programming formulations and efficient local search for relaxed correlation clustering5
Simultaneous distributed-boundary optimal control problems driven by nonlinear complementarity systems5
On maximum-sum matchings of points5
Exact SDP relaxations of quadratically constrained quadratic programs with forest structures5
Geoffrion’s proper efficiency in linear fractional vector optimization with unbounded constraint sets5
Proximity measures based on KKT points for constrained multi-objective optimization5
Maximization problems of balancing submodular relevance and supermodular diversity5
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT5
On robustness for set-valued optimization problems5
On strong duality in linear copositive programming5
Linear convergence of a nonmonotone projected gradient method for multiobjective optimization5
Solution maps of polynomial variational inequalities5
Multi-objective convex polynomial optimization and semidefinite programming relaxations5
Karush–Kuhn–Tucker type optimality condition for quasiconvex programming in terms of Greenberg–Pierskalla subdifferential5
Scenario-based cuts for structured two-stage stochastic and distributionally robust p-order conic mixed integer programs5
An approximation algorithm for multi-objective optimization problems using a box-coverage5
Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations5
Conical averagedness and convergence analysis of fixed point algorithms5
Accelerated Dai-Liao projection method for solving systems of monotone nonlinear equations with application to image deblurring5
Partial gradient optimal thresholding algorithms for a class of sparse optimization problems5
Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections5
Improved interval methods for solving circle packing problems in the unit square5
Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems5
Alternating DC algorithm for partial DC programming problems4
Primal-dual splittings as fixed point iterations in the range of linear operators4
A scalarization scheme for binary relations with applications to set-valued and robust optimization4
Numerical methods using two different approximations of space-filling curves for black-box global optimization4
Efficient approximation of the metric CVRP in spaces of fixed doubling dimension4
Solution sets of three sparse optimization problems for multivariate regression4
Dynamical system for solving bilevel variational inequalities4
Revenue maximization of Internet of things provider using variable neighbourhood search4
Packing convex polygons in minimum-perimeter convex hulls4
Multi-objective dynamic programming with limited precision4
A variable neighborhood search algorithm for the $$ (r{\mid }p) $$ hub–centroid problem under the price war4
Tight bounds on the maximal perimeter and the maximal width of convex small polygons4
Adaptive seeding for profit maximization in social networks4
Hospital service levels during drug shortages: Stocking and transshipment policies for pharmaceutical inventory4
Painlevé-Kuratowski convergence of minimal solutions for set-valued optimization problems via improvement sets4
Open issues and recent advances in DC programming and DCA4
Lipschitz-inspired HALRECT algorithm for derivative-free global optimization4
Linearization of McCormick relaxations and hybridization with the auxiliary variable method4
New inertial forward-backward type for variational inequalities with Quasi-monotonicity4
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower’s objective4
Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials4
Resolving learning rates adaptively by locating stochastic non-negative associated gradient projection points using line searches4
0.0170578956604