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 2022-01-01 to 2026-01-01.)
ArticleCitations
Book review on “Convex Analysis and Beyond. Volume I: Basic Theory”, a monograph by Boris S. Mordukhovich and Nguyen Mau Nam30
A method based on parametric convex programming for solving convex multiplicative programming problem29
Stochastic optimization problems with nonlinear dependence on a probability measure via the Wasserstein metric24
A two-phase sequential algorithm for global optimization of the standard quadratic programming problem21
A consensus-based optimization method for nonsmooth nonconvex programs with approximated gradient descent scheme19
Nonconvex sensitivity-based generalized Benders decomposition19
A survey of exact and approximation algorithms for linear-parametric optimization problems18
A bi-level programming problem of medicine procurement and production optimization17
Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies17
Constrained optimization in simulation: efficient global optimization and Karush-Kuhn-Tucker conditions16
Alternative regularizations for Outer-Approximation algorithms for convex MINLP15
Open issues and recent advances in DC programming and DCA14
A performance analysis of Basin hopping compared to established metaheuristics for global optimization14
EFIX: Exact fixed point methods for distributed optimization14
Using quadratic cuts to iteratively strengthen convexifications of box quadratic programs13
On the global convergence of the proximal gradient method for Tikhonov regularized correction of absolute value equations13
Semistrictly and neatly quasiconvex programming using lower global subdifferentials13
Characterizations of set order relations and nonlinear scalarizations via generalized oriented distance function in set optimization13
Relaxed-inertial proximal point type algorithms for quasiconvex minimization13
Noncoercive and noncontinuous equilibrium problems: existence theorem in infinite-dimensional spaces12
Characterization of set order relations and set optimization problems via conic scalarization12
A new Riemannian Multiplicative Updates for Chordal Nonnegative Matrix Factorization11
An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems11
Nested benders decomposition for a deterministic biomass feedstock logistics problem11
Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem11
Subdomain separability in global optimization11
Hausdorff distance between convex semialgebraic sets11
Stability analysis of split equality and split feasibility problems11
New bounds and formulations for the deterministic global optimization of Lennard–Jones clusters10
A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions10
Improved variance reduction extragradient method with line search for stochastic variational inequalities10
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints10
Compact mixed-integer programming formulations in quadratic optimization9
A surrogate-assisted a priori multiobjective evolutionary algorithm for constrained multiobjective optimization problems9
Optimality conditions for zero-one composite optimization problems9
Non-convex optimization problems with linear KKT subsystem9
A refined proximal algorithm for nonconvex multiobjective optimization in Hilbert spaces9
On the maxima of motzkin-straus programs and cliques of graphs9
Globalized distributionally robust optimization based on samples9
Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials9
A generalized block-iterative projection method for the common fixed point problem induced by cutters9
Data-trading coordination with government subsidy9
Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems8
Correction to: Numerical certification of Pareto optimality for biobjective nonlinear problems8
Weak and strong convergence theorems for the mixed split feasibility problem in Hilbert spaces8
A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines8
An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant8
The exact projective penalty method for constrained optimization8
Support vector machines with the hard-margin loss: optimal training via combinatorial Benders’ cuts8
Regret analysis of an online majorized semi-proximal ADMM for online composite optimization8
Hopping between distant basins8
A new global algorithm for factor-risk-constrained mean-variance portfolio selection8
The projected polar proximal point algorithm converges globally7
Hybridizing two linear relaxation techniques in interval-based solvers7
Simple proximal-type algorithms for equilibrium problems7
Mixed polynomial variational inequalities7
Solving non-monotone equilibrium problems via a DIRECT-type approach7
A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems7
Discretization and global optimization for mixed integer bilinear programming7
Modified general splitting method for the split feasibility problem7
Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges7
Strict feasibility for the polynomial complementarity problem7
Quaternion matrix decomposition and its theoretical implications6
Finding global solutions of some inverse optimal control problems using penalization and semismooth Newton methods6
Global solution algorithms for DC programming via polyhedral approximations of convex functions6
Computing the recession cone of a convex upper image via convex projection6
On asymptotic convergence rate of random search6
Addressing mixed constraints: an improved framework for black-box optimization6
Second order analysis for robust inclusion systems and applications6
Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs6
Strong convergence of the composition of firmly nonexpansive mappings6
Optimality analysis for $$\epsilon $$-quasi solutions of optimization problems via $$\epsilon $$-upper convexificators: a dual approach6
A revised monotonicity-based method for computing tight image enclosures of functions6
Unboundedness of the images of set-valued mappings having closed graphs: application to vector optimization6
Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes6
Decision bounding problems for two-stage distributionally robust stochastic bilevel optimization6
Some saddle-point theorems for vector-valued functions6
A QoS and sustainability-driven two-stage service composition method in cloud manufacturing: combining clustering and bi-objective optimization6
One-Step iterative method for bilevel equilibrium problem in Hilbert space6
A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill’s global convergence6
A strategy to tighten the relaxation of bilinear terms towards petrochemical scheduling problem6
A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization6
A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations5
The supporting hyperplane optimization toolkit for convex MINLP5
Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors5
Approximation algorithms for the individually fair k-center with outliers5
Subdifferentials of optimal value functions under metric qualification conditions5
Conditions for the stability of ideal efficient solutions in parametric vector optimization via set-valued inclusions5
Preface to the special issue dedicated to the 6th World Congress on Global Optimization held in Metz, France, July 8–10, 20195
A facial reduction approach for the single source localization problem5
Monotone submodular maximization under the pairwise capacity constraint5
Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials5
An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities5
Separating bichromatic point sets in the plane by restricted orientation convex hulls5
Exchange rates and multicommodity international trade: insights from spatial price equilibrium modeling with policy instruments via variational inequalities5
Sufficient conditions for existence of global minimizers of functions on Hilbert spaces5
An adaptive high order method for finding third-order critical points of nonconvex optimization5
Optimization in complex spaces with the mixed Newton method5
A note on the SDP relaxation of the minimum cut problem5
Simultaneous distributed-boundary optimal control problems driven by nonlinear complementarity systems5
Special Issue: 18th International conference on mathematical optimization theory and operations research (MOTOR 2019)5
On a tractable single-level reformulation of a multilevel model of the European entry-exit gas market with market power5
On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations5
Global convergence of block Bregman proximal iteratively reweighted algorithm with extrapolation5
Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems5
Correction to: Brezis pseudomonotone bifunctions and quasi equilibrium problems via penalization5
Structured tensor tuples to polynomial complementarity problems5
Gaussian Process regression over discrete probability measures: on the non-stationarity relation between Euclidean and Wasserstein Squared Exponential Kernels5
On the convergence result of the gradient-push algorithm on directed graphs with constant stepsize5
Constraint generation approaches for submodular function maximization leveraging graph properties4
On maximum-sum matchings of points4
Extension of forward-reflected-backward method to non-convex mixed variational inequalities4
Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots4
Relaxed method for optimization problems with cardinality constraints4
Supply chain networks, wages, and labor productivity: insights from Lagrange. analysis and computations4
Tropical gradient descent4
Approximating biobjective minimization problems using general ordering cones4
Quasi-Newton type proximal gradient method for nonconvex nonsmooth composite optimization problems4
Revisiting non-monotone regularized submodular maximization: bi-criteria and PASS approximations4
Pointwise expected hypervolume improvement for expensive multi-objective optimization4
Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds4
New inertial forward-backward type for variational inequalities with Quasi-monotonicity4
Fractional 0–1 programming and submodularity4
Sparse signal recovery via generalized gaussian function4
Partial gradient optimal thresholding algorithms for a class of sparse optimization problems4
Numerical certification of Pareto optimality for biobjective nonlinear problems4
Distributionally robust mean-absolute deviation portfolio optimization using wasserstein metric4
A robust multi-objective Bayesian optimization framework considering input uncertainty4
A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems4
Extragradient-type methods with $$\mathcal {O}\left( 1/k\right) $$ last-iterate convergence rates for co-hypomonotone inclusions4
The projected-type method for the extended vertical linear complementarity problem revisited4
On e-monotonicity and maximality of operators in Banach spaces4
Aubin property for solution set in multi-objective programming4
Approximations of unbounded convex projections and unbounded convex sets3
Quasiconjugate duality and optimality conditions for quasiconvex optimization3
Bundle trust region algorithm based on linear subproblem3
Applying augmented weak subdifferentials and normal cones for nonconvex mathematical programming problems3
An efficient branch-and-cut algorithm for the minimum covering location problem with distance constraints3
An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints3
Extended McCormick relaxation rules for handling empty arguments representing infeasibility3
Kurdyka-Łojasiewicz inequality and error bounds of D-Gap functions for nonsmooth and nonmonotone variational inequality problems3
A strong P-formulation for global optimization of industrial water-using and treatment networks3
The p-Lagrangian relaxation for separable nonconvex MIQCQP problems3
Multi-stage portfolio selection problem with dynamic stochastic dominance constraints3
Finding the set of global minimizers of a piecewise affine function3
Comparing reference point based interactive multiobjective optimization methods without a human decision maker3
Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints3
A utopia point method-based robust vector polynomial optimization scheme3
Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization3
A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice3
A K-means Supported Reinforcement Learning Framework to Multi-dimensional Knapsack3
Covering a rectangle with 6 circles: a reliable mathematical programming approach3
Graph, clique and facet of boolean logical polytope3
Using dual relaxations in multiobjective mixed-integer convex quadratic programming3
On generalized KKT points for the Motzkin–Straus program3
On the second-order optimality conditions for multi-objective optimal control problems with mixed pointwise constraints3
An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems3
Partial augmented Lagrangian method for non-Lipschitz mathematical programs with complementarity constraints3
Early years of biased random-key genetic algorithms: a systematic review3
A Two-Step Proximal Point Algorithm for Nonconvex Equilibrium Problems with Applications to Fractional Programming3
POINT-BASED SUFFICIENT CONDITIONS FOR SHARP SOLUTIONS IN NONSMOOTH OPTIMIZATION3
On polling directions for randomized direct-search approaches: application to beam angle optimization in intensity-modulated proton therapy3
Directional derivatives and subdifferentials for set-valued maps applied to set optimization3
Online non-monotone diminishing return submodular maximization in the bandit setting3
Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles3
New semidefinite relaxations for a class of complex quadratic programming problems2
Rectilinear convex hull of points in 3D and applications2
Conic relaxations for conic minimax convex polynomial programs with extensions and applications2
Parallel inexact Levenberg–Marquardt method for nearly-separable nonlinear least squares2
Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization2
Minimizers of sparsity regularized least absolute deviations2
A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors2
AI-based predictive analytics for enhancing data-driven supply chain optimization2
A bundle-type method for nonsmooth DC programs2
Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem2
Solution methods for partial inverse combinatorial optimization problems in which weights can only be increased2
A robust investment-consumption optimization problem in a switching regime interest rate setting2
A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization2
Intersecting ellipses induced by a max-sum matching2
Strong subdifferentials: theory and applications in nonconvex optimization2
Efficient smooth minorants for global optimization of univariate functions with the first derivative satisfying the interval Lipschitz condition2
An extragradient algorithm for quasiconvex equilibrium problems without monotonicity2
Constrained multiobjective optimization of expensive black-box functions using a heuristic branch-and-bound approach2
Quasi-contingent derivatives and studies of higher-orders in nonsmooth optimization2
Interval constraint programming for globally solving catalog-based categorical optimization2
Tightening state relaxations for global dynamic optimization using dynamic cuts2
Distributed primal outer approximation algorithm for sparse convex programming with separable structures2
Reference-point-based branch and bound algorithm for multiobjective optimization2
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
Stochastic red-blue set covering: a decomposition approach2
Characterisation of zero duality gap for optimization problems in spaces without linear structure2
Sparse sub-gaussian random projections for semidefinite programming relaxations2
Constructing Tight Quadratic Relaxations for Global Optimization: I. Outer-Approximating Twice-Differentiable Convex Functions2
Optimality and solutions for conic robust multiobjective programs2
An extragradient algorithm for a lifted reformulation of projected solutions for quasiequilibria2
Consensus-based optimization for multi-objective problems: a multi-swarm approach2
A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems2
The interpolating element-free Galerkin method for the p-Laplace double obstacle mixed complementarity problem2
An inexact primal–dual method with correction step for a saddle point problem in image debluring2
A new optimization approach to solving split equality problems in Hilbert spaces2
Computing one-bit compressive sensing via zero-norm regularized DC loss model and its surrogate2
Inexact bilevel stochastic gradient methods for constrained and unconstrained lower-level problems2
Exact SDP relaxations for quadratic programs with bipartite graph structures2
A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis2
TREGO: a trust-region framework for efficient global optimization2
An oracle-based framework for robust combinatorial optimization2
Revisiting Nesterov’s acceleration via high-resolution differential equations2
Inexact primal-dual active set iteration for optimal distribution control of stationary heat or cold source2
Preface: special issue on optimization in distance geometry2
Optimising portfolio diversification and dimensionality2
Separable Edge-Concave Underestimator for High-Dimensional Signomials in Nonnegative Orthant2
Computational advances in polynomial optimization: RAPOSa, a freely available global solver2
A surrogate-assisted evolutionary algorithm with clustering-based sampling for high-dimensional expensive blackbox optimization1
Tight bounds on the maximal perimeter and the maximal width of convex small polygons1
Efficient enumeration of the optimal solutions to the correlation clustering problem1
The rate of convergence of augmented Lagrangian method for bilevel optimization problems with equality constraints1
Extended vertical tensor complementarity problems with finite solution sets1
On existence of solutions to nonconvex minimization problems1
A golden ratio proximal alternating direction method of multipliers for separable convex optimization1
An exact algorithm for disaster-resilience augmentation of planar straight-line graphs1
Existence of weak efficient solutions of set-valued optimization problems1
Stochastic golden ratio algorithm to non-convex stochastic mixed variational inequality problem1
A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery1
A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis1
Almost optimal manipulation of pairwise comparisons of alternatives1
Gradient projection method on the sphere, complementarity problems and copositivity1
An inertial proximal point method for difference of maximal monotone vector fields in Hadamard manifolds1
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
Packing spheres with quasi-containment conditions1
Hybrid decomposition and deep learning approach for data-driven FOREX forecasting optimization1
Preface1
Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem1
On the global minimization of discretized residual functionals of conditionally well-posed inverse problems1
A branch-and-bound algorithm for parametric mixed-binary nonlinear programs1
A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems1
Regrets of proximal method of multipliers for online non-convex optimization with long term constraints1
On the study of multistage stochastic vector quasi-variational problems1
A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems1
On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem1
Dual optimality conditions for the difference of extended real valued increasing co-radiant functions1
On the use of overlapping convex hull relaxations to solve nonconvex MINLPs1
A new partition method for DIRECT-type algorithm based on minimax design1
The restricted inverse optimal value problem on shortest path under $$l_1$$ norm on trees1
A new scheme for approximating the weakly efficient solution set of vector rational optimization problems1
Stochastic decomposition for risk-averse two-stage stochastic linear programs1
Covering a simplex by spheres: complexity and algorithms1
Numerical methods using two different approximations of space-filling curves for black-box global optimization1
Fitting feature-dependent Markov chains1
0.067377090454102