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 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
Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies17
A bi-level programming problem of medicine procurement and production optimization17
Constrained optimization in simulation: efficient global optimization and Karush-Kuhn-Tucker conditions16
Alternative regularizations for Outer-Approximation algorithms for convex MINLP15
EFIX: Exact fixed point methods for distributed optimization14
Open issues and recent advances in DC programming and DCA14
A performance analysis of Basin hopping compared to established metaheuristics for global optimization14
Relaxed-inertial proximal point type algorithms for quasiconvex minimization13
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
Characterization of set order relations and set optimization problems via conic scalarization12
Noncoercive and noncontinuous equilibrium problems: existence theorem in infinite-dimensional spaces12
Hausdorff distance between convex semialgebraic sets11
Stability analysis of split equality and split feasibility problems11
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
Improved variance reduction extragradient method with line search for stochastic variational inequalities10
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints10
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
A generalized block-iterative projection method for the common fixed point problem induced by cutters9
Data-trading coordination with government subsidy9
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
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
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
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
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
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
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
Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials5
Separating bichromatic point sets in the plane by restricted orientation convex hulls5
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
On a tractable single-level reformulation of a multilevel model of the European entry-exit gas market with market power5
Optimization in complex spaces with the mixed Newton method5
Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems5
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 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
Correction to: Brezis pseudomonotone bifunctions and quasi equilibrium problems via penalization5
The supporting hyperplane optimization toolkit for convex MINLP5
Structured tensor tuples to polynomial complementarity problems5
Subdifferentials of optimal value functions under metric qualification conditions5
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
A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations5
Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors5
Approximation algorithms for the individually fair k-center with outliers5
An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities5
Conditions for the stability of ideal efficient solutions in parametric vector optimization via set-valued inclusions5
Exchange rates and multicommodity international trade: insights from spatial price equilibrium modeling with policy instruments via variational inequalities5
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
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
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
0.095043897628784