Journal of Global Optimization

Papers
(The median citation count of Journal of Global Optimization 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 2021-06-01 to 2025-06-01.)
ArticleCitations
Book review on “Convex Analysis and Beyond. Volume I: Basic Theory”, a monograph by Boris S. Mordukhovich and Nguyen Mau Nam30
Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion22
Exclusion regions for parameter-dependent systems of equations22
A method based on parametric convex programming for solving convex multiplicative programming problem22
Low-rank matrix recovery with Ky Fan 2-k-norm20
Global convergence of model function based Bregman proximal minimization algorithms20
A two-phase sequential algorithm for global optimization of the standard quadratic programming problem17
Stochastic optimization problems with nonlinear dependence on a probability measure via the Wasserstein metric17
A performance analysis of Basin hopping compared to established metaheuristics for global optimization14
Nonconvex sensitivity-based generalized Benders decomposition14
Constrained optimization in simulation: efficient global optimization and Karush-Kuhn-Tucker conditions14
Alternative regularizations for Outer-Approximation algorithms for convex MINLP14
An extension of the proximal point algorithm beyond convexity13
A bi-level programming problem of medicine procurement and production optimization13
Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies13
Open issues and recent advances in DC programming and DCA12
Noncoercive and noncontinuous equilibrium problems: existence theorem in infinite-dimensional spaces12
Improved interval methods for solving circle packing problems in the unit square12
Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity12
Semistrictly and neatly quasiconvex programming using lower global subdifferentials11
Nested benders decomposition for a deterministic biomass feedstock logistics problem11
A new greedy strategy for maximizing monotone submodular function under a cardinality constraint11
EFIX: Exact fixed point methods for distributed optimization11
Characterizations of set order relations and nonlinear scalarizations via generalized oriented distance function in set optimization11
Subdomain separability in global optimization10
Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities10
Optimal deterministic and robust selection of electricity contracts10
Relaxed-inertial proximal point type algorithms for quasiconvex minimization10
Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem10
An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems9
MVMOO: Mixed variable multi-objective optimisation9
Hausdorff distance between convex semialgebraic sets9
A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions9
Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization9
Improved variance reduction extragradient method with line search for stochastic variational inequalities9
Stability analysis of split equality and split feasibility problems9
A surrogate-assisted a priori multiobjective evolutionary algorithm for constrained multiobjective optimization problems8
Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem8
Data-trading coordination with government subsidy8
A refined proximal algorithm for nonconvex multiobjective optimization in Hilbert spaces8
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints8
A generalized block-iterative projection method for the common fixed point problem induced by cutters8
An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant8
An objective penalty function method for biconvex programming8
Sparse regularization via bidualization8
On the maxima of motzkin-straus programs and cliques of graphs8
Compact mixed-integer programming formulations in quadratic optimization8
Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials8
Support vector machines with the hard-margin loss: optimal training via combinatorial Benders’ cuts8
New bounds and formulations for the deterministic global optimization of Lennard–Jones clusters8
On the branch and bound algorithm for the extended trust-region subproblem7
The exact projective penalty method for constrained optimization7
Hybridizing two linear relaxation techniques in interval-based solvers7
Discretization and global optimization for mixed integer bilinear programming7
Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems7
Regret analysis of an online majorized semi-proximal ADMM for online composite optimization7
Globalized distributionally robust optimization based on samples7
The projected polar proximal point algorithm converges globally7
A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines7
A new global algorithm for factor-risk-constrained mean-variance portfolio selection7
Correction to: Numerical certification of Pareto optimality for biobjective nonlinear problems7
Hopping between distant basins7
Modified general splitting method for the split feasibility problem7
Gaining or losing perspective6
Simple proximal-type algorithms for equilibrium problems6
Computing the recession cone of a convex upper image via convex projection6
A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill’s global convergence6
On asymptotic convergence rate of random search6
Optimality analysis for $$\epsilon $$-quasi solutions of optimization problems via $$\epsilon $$-upper convexificators: a dual approach6
One-Step iterative method for bilevel equilibrium problem in Hilbert space6
Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges6
A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems6
A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization6
Decision bounding problems for two-stage distributionally robust stochastic bilevel optimization6
Unboundedness of the images of set-valued mappings having closed graphs: application to vector optimization6
Mixed polynomial variational inequalities6
Strict feasibility for the polynomial complementarity problem6
Solving non-monotone equilibrium problems via a DIRECT-type approach6
A revised monotonicity-based method for computing tight image enclosures of functions6
Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs6
Addressing mixed constraints: an improved framework for black-box optimization6
Finding global solutions of some inverse optimal control problems using penalization and semismooth Newton methods5
Second order analysis for robust inclusion systems and applications5
A modified simplex partition algorithm to test copositivity5
An adaptive high order method for finding third-order critical points of nonconvex optimization5
Approximation algorithms for the individually fair k-center with outliers5
A strategy to tighten the relaxation of bilinear terms towards petrochemical scheduling problem5
Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes5
Strong convergence of the composition of firmly nonexpansive mappings5
Conditions for the stability of ideal efficient solutions in parametric vector optimization via set-valued inclusions5
Hospital service levels during drug shortages: Stocking and transshipment policies for pharmaceutical inventory5
Quaternion matrix decomposition and its theoretical implications5
Some saddle-point theorems for vector-valued functions5
A Newton Frank–Wolfe method for constrained self-concordant minimization5
An approximate lower order penalty approach for solving second-order cone linear complementarity problems5
A QoS and sustainability-driven two-stage service composition method in cloud manufacturing: combining clustering and bi-objective optimization5
Global convergence of block Bregman proximal iteratively reweighted algorithm with extrapolation4
Optimization in complex spaces with the mixed Newton method4
On the convergence result of the gradient-push algorithm on directed graphs with constant stepsize4
On a tractable single-level reformulation of a multilevel model of the European entry-exit gas market with market power4
A geometric branch and bound method for robust maximization of convex functions4
Nonconvex and Nonsmooth Sparse Optimization via Adaptively Iterative Reweighted Methods4
Characterization results of solutions in interval-valued optimization problems with mixed constraints4
Sufficient conditions for existence of global minimizers of functions on Hilbert spaces4
On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations4
Special Issue: 18th International conference on mathematical optimization theory and operations research (MOTOR 2019)4
Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems4
Subdifferentials of optimal value functions under metric qualification conditions4
The supporting hyperplane optimization toolkit for convex MINLP4
A note on the SDP relaxation of the minimum cut problem4
Separating bichromatic point sets in the plane by restricted orientation convex hulls4
Exact SDP relaxations of quadratically constrained quadratic programs with forest structures4
Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors4
Correction to: Brezis pseudomonotone bifunctions and quasi equilibrium problems via penalization4
Structured tensor tuples to polynomial complementarity problems4
Simultaneous distributed-boundary optimal control problems driven by nonlinear complementarity systems4
Exchange rates and multicommodity international trade: insights from spatial price equilibrium modeling with policy instruments via variational inequalities4
On nondegenerate M-stationary points for sparsity constrained nonlinear optimization4
Preface to the special issue dedicated to the 6th World Congress on Global Optimization held in Metz, France, July 8–10, 20194
Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials4
Convex projection and convex multi-objective optimization4
A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations4
A facial reduction approach for the single source localization problem3
Constraint generation approaches for submodular function maximization leveraging graph properties3
Graph, clique and facet of boolean logical polytope3
Revisiting non-monotone regularized submodular maximization: bi-criteria and PASS approximations3
Multi-stage portfolio selection problem with dynamic stochastic dominance constraints3
A robust multi-objective Bayesian optimization framework considering input uncertainty3
Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds3
Numerical certification of Pareto optimality for biobjective nonlinear problems3
Supply chain networks, wages, and labor productivity: insights from Lagrange. analysis and computations3
Relaxed method for optimization problems with cardinality constraints3
On e-monotonicity and maximality of operators in Banach spaces3
Partial gradient optimal thresholding algorithms for a class of sparse optimization problems3
Approximating biobjective minimization problems using general ordering cones3
On reduction of exhausters via a support function representation3
A K-means Supported Reinforcement Learning Framework to Multi-dimensional Knapsack3
On polling directions for randomized direct-search approaches: application to beam angle optimization in intensity-modulated proton therapy3
A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems3
Extension of forward-reflected-backward method to non-convex mixed variational inequalities3
The projected-type method for the extended vertical linear complementarity problem revisited3
Aubin property for solution set in multi-objective programming3
Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in hilbert spaces3
Fractional 0–1 programming and submodularity3
Extragradient-type methods with $$\mathcal {O}\left( 1/k\right) $$ last-iterate convergence rates for co-hypomonotone inclusions3
Sparse signal recovery via generalized gaussian function3
On maximum-sum matchings of points3
An exact algorithm for constructing minimum Euclidean skeletons of polygons3
Extended McCormick relaxation rules for handling empty arguments representing infeasibility3
Online non-monotone diminishing return submodular maximization in the bandit setting3
A strong P-formulation for global optimization of industrial water-using and treatment networks3
Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots3
Distributionally robust mean-absolute deviation portfolio optimization using wasserstein metric3
Pointwise expected hypervolume improvement for expensive multi-objective optimization3
Approximations of unbounded convex projections and unbounded convex sets3
New inertial forward-backward type for variational inequalities with Quasi-monotonicity3
An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities3
Hidden invariant convexity for global and conic-intersection optimality guarantees in discrete-time optimal control3
Gaussian Process regression over discrete probability measures: on the non-stationarity relation between Euclidean and Wasserstein Squared Exponential Kernels3
TREGO: a trust-region framework for efficient global optimization2
An extragradient algorithm for quasiconvex equilibrium problems without monotonicity2
Inexact bilevel stochastic gradient methods for constrained and unconstrained lower-level problems2
Strong subdifferentials: theory and applications in nonconvex optimization2
Strict directional solutions in vectorial problems: necessary optimality conditions2
Copula theory approach to stochastic geometric programming2
A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems2
A utopia point method-based robust vector polynomial optimization scheme2
Efficient smooth minorants for global optimization of univariate functions with the first derivative satisfying the interval Lipschitz condition2
On the second-order optimality conditions for multi-objective optimal control problems with mixed pointwise constraints2
A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors2
An outer–inner linearization method for non-convex and nondifferentiable composite regularization problems2
New semidefinite relaxations for a class of complex quadratic programming problems2
A Two-Step Proximal Point Algorithm for Nonconvex Equilibrium Problems with Applications to Fractional Programming2
Comparing reference point based interactive multiobjective optimization methods without a human decision maker2
Directional derivatives and subdifferentials for set-valued maps applied to set optimization2
A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization2
An inexact primal–dual method with correction step for a saddle point problem in image debluring2
Calmness of partial perturbation to composite rank constraint systems and its applications2
An average-compress algorithm for the sample mean problem under dynamic time warping2
A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis2
Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization2
Consensus-based optimization for multi-objective problems: a multi-swarm approach2
Early years of biased random-key genetic algorithms: a systematic review2
Partial augmented Lagrangian method for non-Lipschitz mathematical programs with complementarity constraints2
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements2
Convex hull representations for bounded products of variables2
Applying augmented weak subdifferentials and normal cones for nonconvex mathematical programming problems2
Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem2
The p-Lagrangian relaxation for separable nonconvex MIQCQP problems2
A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice2
Quasiconjugate duality and optimality conditions for quasiconvex optimization2
Using dual relaxations in multiobjective mixed-integer convex quadratic programming2
An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints2
Computational advances in polynomial optimization: RAPOSa, a freely available global solver2
Bundle trust region algorithm based on linear subproblem2
Tightening state relaxations for global dynamic optimization using dynamic cuts2
Asynchronous optimization of part logistics routing problem2
A branch-cut-and-price algorithm for optimal decoding in digital communication systems2
An efficient branch-and-cut algorithm for the minimum covering location problem with distance constraints2
A bundle-type method for nonsmooth DC programs2
Parallel inexact Levenberg–Marquardt method for nearly-separable nonlinear least squares2
An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems2
Intersecting ellipses induced by a max-sum matching2
Preface: special issue on optimization in distance geometry2
Optimising portfolio diversification and dimensionality2
A robust investment-consumption optimization problem in a switching regime interest rate setting2
Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization2
Finding the set of global minimizers of a piecewise affine function2
On generalized KKT points for the Motzkin–Straus program2
Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles2
Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints2
The restricted inverse optimal value problem on shortest path under $$l_1$$ norm on trees1
Fitting feature-dependent Markov chains1
Gradient projection method on the sphere, complementarity problems and copositivity1
An efficient alternating minimization method for fourth degree polynomial optimization1
On the convergence order of value function relaxations used in decomposition-based global optimization of nonconvex stochastic programs1
A new partition method for DIRECT-type algorithm based on minimax design1
Preface1
A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems1
General convex relaxations of implicit functions and inverse functions1
Brezis pseudomonotone bifunctions and quasi equilibrium problems via penalization1
Preface1
An approximation algorithm for multi-objective optimization problems using a box-coverage1
Relaxed projection methods for solving variational inequality problems1
On the study of multistage stochastic vector quasi-variational problems1
Efficient enumeration of the optimal solutions to the correlation clustering problem1
A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis1
On the use of overlapping convex hull relaxations to solve nonconvex MINLPs1
Dual optimality conditions for the difference of extended real valued increasing co-radiant functions1
Hybrid decomposition and deep learning approach for data-driven FOREX forecasting optimization1
A branch-and-bound algorithm for parametric mixed-binary nonlinear programs1
A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems1
Regrets of proximal method of multipliers for online non-convex optimization with long term constraints1
Global dynamic optimization with Hammerstein–Wiener models embedded1
Tight bounds on the maximal perimeter and the maximal width of convex small polygons1
Extended vertical tensor complementarity problems with finite solution sets1
Numerical methods using two different approximations of space-filling curves for black-box global optimization1
A surrogate-assisted evolutionary algorithm with clustering-based sampling for high-dimensional expensive blackbox optimization1
A method for searching for a globally optimal k-partition of higher-dimensional datasets1
Regularized sample average approximation for high-dimensional stochastic optimization under low-rankness1
New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming1
Covering a simplex by spheres: complexity and algorithms1
A golden ratio proximal alternating direction method of multipliers for separable convex optimization1
Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem1
Packing spheres with quasi-containment conditions1
An empirical study of various candidate selection and partitioning techniques in the DIRECT framework1
Consistency of statistical estimators of solutions to stochastic optimization problems1
Linear convergence of a nonmonotone projected gradient method for multiobjective optimization1
Rectilinear convex hull of points in 3D and applications1
Almost optimal manipulation of pairwise comparisons of alternatives1
0.07440710067749