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-08-01 to 2026-08-01.)
ArticleCitations
Book review on “Convex Analysis and Beyond. Volume I: Basic Theory”, a monograph by Boris S. Mordukhovich and Nguyen Mau Nam32
A consensus-based optimization method for nonsmooth nonconvex programs with approximated gradient descent scheme30
A method based on parametric convex programming for solving convex multiplicative programming problem30
A bi-level programming problem of medicine procurement and production optimization28
Nonconvex sensitivity-based generalized Benders decomposition28
Combining gradient information and primitive directions for high-performance Bound-Constrained mixed-integer optimization25
Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies21
Stochastic optimization problems with nonlinear dependence on a probability measure via the Wasserstein metric19
Characterizations of Strongly Quasiconvex Functions19
A two-phase sequential algorithm for global optimization of the standard quadratic programming problem16
Constrained optimization in simulation: efficient global optimization and Karush-Kuhn-Tucker conditions16
A performance analysis of Basin hopping compared to established metaheuristics for global optimization15
Open issues and recent advances in DC programming and DCA15
EFIX: Exact fixed point methods for distributed optimization14
A survey of exact and approximation algorithms for linear-parametric optimization problems14
Risk-averse two-stage distributionally robust mixed-integer optimization with decision-dependent ambiguity sets13
On the global convergence of the proximal gradient method for Tikhonov regularized correction of absolute value equations12
Data-driven Lipschitz-informed convex underestimators for branch-and-bound optimization of black-box functions12
Semistrictly and neatly quasiconvex programming using lower global subdifferentials12
Noncoercive and noncontinuous equilibrium problems: existence theorem in infinite-dimensional spaces11
Using quadratic cuts to iteratively strengthen convexifications of box quadratic programs11
Sparse polynomial optimization with matrix constraints11
Characterization of set order relations and set optimization problems via conic scalarization11
An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems10
Nested benders decomposition for a deterministic biomass feedstock logistics problem10
Relaxed-inertial proximal point type algorithms for quasiconvex minimization10
Hausdorff distance between convex semialgebraic sets10
Stochastic DC algorithms for general stochastic DC programs with machine learning applications10
Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem9
Optimality conditions for zero-one composite optimization problems9
An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant9
Subdomain separability in global optimization9
A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions9
Data-trading coordination with government subsidy9
A new Riemannian Multiplicative Updates for Chordal Nonnegative Matrix Factorization9
Stability analysis of split equality and split feasibility problems9
Globalized distributionally robust optimization based on samples9
Quasi-Newton method with subspace gradients8
Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials8
A surrogate-assisted a priori multiobjective evolutionary algorithm for constrained multiobjective optimization problems8
Support vector machines with the hard-margin loss: optimal training via combinatorial Benders’ cuts8
Non-convex optimization problems with linear KKT subsystem8
A refined proximal algorithm for nonconvex multiobjective optimization in Hilbert spaces8
New bounds and formulations for the deterministic global optimization of Lennard–Jones clusters7
A new global algorithm for factor-risk-constrained mean-variance portfolio selection7
Weak and strong convergence theorems for the mixed split feasibility problem in Hilbert spaces7
Modified general splitting method for the split feasibility problem7
Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges7
Mixed polynomial variational inequalities7
Benefits of the IOPIS paradigm on the landscapes of multiobjective optimization problems7
A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines7
The exact projective penalty method for constrained optimization7
A Relax-Fix-and-Exclude algorithm for an MINLP problem with multilinear interpolations7
Error bounds, PL condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods7
Simple proximal-type algorithms for equilibrium problems7
From individual welfare to global equity: reforming International Environmental Agreements7
Regret analysis of an online majorized semi-proximal ADMM for online composite optimization7
Optimality conditions and solution analysis at infinity for nonsmooth optimization problems7
Hybridizing two linear relaxation techniques in interval-based solvers7
Strict feasibility for the polynomial complementarity problem7
A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems7
Global solution algorithms for DC programming via polyhedral approximations of convex functions6
Unboundedness of the images of set-valued mappings having closed graphs: application to vector optimization6
On asymptotic convergence rate of random search6
A strategy to tighten the relaxation of bilinear terms towards petrochemical scheduling problem6
A revised monotonicity-based method for computing tight image enclosures of functions6
Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes6
Distributionally robust fractional optimization of probability of exceedance6
A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization6
Computing the recession cone of a convex upper image via convex projection6
Decision bounding problems for two-stage distributionally robust stochastic bilevel optimization6
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
Optimality analysis for $$\epsilon $$-quasi solutions of optimization problems via $$\epsilon $$-upper convexificators: a dual approach5
Conditions for the stability of ideal efficient solutions in parametric vector optimization via set-valued inclusions5
A QoS and sustainability-driven two-stage service composition method in cloud manufacturing: combining clustering and bi-objective optimization5
SPLD polynomial optimization and bounded degree SOS hierarchies5
Some saddle-point theorems for vector-valued functions5
Structured tensor tuples to polynomial complementarity problems5
Strong convergence of the composition of firmly nonexpansive mappings5
Constrained consensus-based optimization and numerical heuristics for the few particle regime5
On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations5
Finding global solutions of some inverse optimal control problems using penalization and semismooth Newton methods5
Separating bichromatic point sets in the plane by restricted orientation convex hulls5
A Bregman ADMM for Robust Fused Lasso Estimation with Doubly Nonconvex Regularizers5
Global convergence of block Bregman proximal iteratively reweighted algorithm with extrapolation5
A new relaxed projection method for solving the split feasibility problem with multiple output sets4
Extragradient-type methods with $$\mathcal {O}\left( 1/k\right) $$ last-iterate convergence rates for co-hypomonotone inclusions4
Subdifferentials of optimal value functions under metric qualification conditions4
Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems4
On the convergence result of the gradient-push algorithm on directed graphs with constant stepsize4
Gaussian Process regression over discrete probability measures: on the non-stationarity relation between Euclidean and Wasserstein Squared Exponential Kernels4
Aubin property for solution set in multi-objective programming4
Quasi-Newton type proximal gradient method for nonconvex nonsmooth composite optimization problems4
Exchange rates and multicommodity international trade: insights from spatial price equilibrium modeling with policy instruments via variational inequalities4
Stochastic ADMM with variance-reduced recursive momentum and its accelerated variant for nonconvex nonsmooth optimization4
Monotone submodular maximization under the pairwise capacity constraint4
Optimization in complex spaces with the mixed Newton method4
Relaxed method for optimization problems with cardinality constraints4
Pointwise expected hypervolume improvement for expensive multi-objective optimization4
Approximating biobjective minimization problems using general ordering cones4
Preface to the special issue on the $$8^\textrm{th}$$ world congress on global optimization4
On a tractable single-level reformulation of a multilevel model of the European entry-exit gas market with market power4
A note on the SDP relaxation of the minimum cut problem4
The projected-type method for the extended vertical linear complementarity problem revisited4
On e-monotonicity and maximality of operators in Banach spaces4
A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems4
Tropical gradient descent4
Optimal Piecewise Linear Approximations for Sigmoid, Tanh, Probability Density and Cumulative Distribution Functions: Tabular Form and R Package pwlapprox2d4
Kurdyka-Łojasiewicz inequality and error bounds of D-Gap functions for nonsmooth and nonmonotone variational inequality problems3
A robust multi-objective Bayesian optimization framework considering input uncertainty3
Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds3
Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots3
On generalized KKT points for the Motzkin–Straus program3
Quasiconjugate duality and optimality conditions for quasiconvex optimization3
Optimality and solutions for conic robust multiobjective programs3
Bundle trust region algorithm based on linear subproblem3
An efficient branch-and-cut algorithm for the minimum covering location problem with distance constraints3
On polling directions for randomized direct-search approaches: application to beam angle optimization in intensity-modulated proton therapy3
A Two-Step Proximal Point Algorithm for Nonconvex Equilibrium Problems with Applications to Fractional Programming3
A K-means Supported Reinforcement Learning Framework to Multi-dimensional Knapsack3
Comparing reference point based interactive multiobjective optimization methods without a human decision maker3
Covering a rectangle with 6 circles: a reliable mathematical programming approach3
Online non-monotone diminishing return submodular maximization in the bandit setting3
Quadratic convex reformulations for multiObjective binary quadratic programming3
Robust chance-constrained optimization with discrete distributions3
Revisiting non-monotone regularized submodular maximization: bi-criteria and PASS approximations3
Preface3
Separable Edge-Concave Underestimator for High-Dimensional Signomials in Nonnegative Orthant3
Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints3
POINT-BASED SUFFICIENT CONDITIONS FOR SHARP SOLUTIONS IN NONSMOOTH OPTIMIZATION3
Directional derivatives and subdifferentials for set-valued maps applied to set optimization3
Parabolic approximation & relaxation for MINLP3
Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles3
Partial augmented Lagrangian method for non-Lipschitz mathematical programs with complementarity constraints3
A strong P-formulation for global optimization of industrial water-using and treatment networks3
Extension of forward-reflected-backward method to non-convex mixed variational inequalities3
Constraint generation approaches for submodular function maximization leveraging graph properties3
Approximations of unbounded convex projections and unbounded convex sets3
An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints3
Constructing Tight Quadratic Relaxations for Global Optimization: I. Outer-Approximating Twice-Differentiable Convex Functions3
An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems3
Sparse sub-gaussian random projections for semidefinite programming relaxations3
Using dual relaxations in multiobjective mixed-integer convex quadratic programming3
An improved inertial stochastic proximal alternating linearized minimization for nonconvex optimization in machine learning3
Extended McCormick relaxation rules for handling empty arguments representing infeasibility3
Multi-step Inertial Accelerated Doubly Stochastic Gradient Methods for Block Term Tensor Decomposition3
Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem2
Stochastic red-blue set covering: a decomposition approach2
Computational advances in polynomial optimization: RAPOSa, a freely available global solver2
Computing two-stage robust optimization with mixed integer structures2
Consensus-based optimization for multi-objective problems: a multi-swarm approach2
Mean-risk stochastic integer programming approach for integrated fuel treatment and wildfire response planning with endogenous uncertainty2
TREGO: a trust-region framework for efficient global optimization2
Conic relaxations for conic minimax convex polynomial programs with extensions and applications2
A robust investment-consumption optimization problem in a switching regime interest rate setting2
Accelerated primal-dual methods for linearly constrained convex optimization problems2
New semidefinite relaxations for a class of complex quadratic programming problems2
The interpolating element-free Galerkin method for the p-Laplace double obstacle mixed complementarity problem2
A utopia point method-based robust vector polynomial optimization scheme2
An extragradient algorithm for quasiconvex equilibrium problems without monotonicity2
Relaxations of KKT conditions do not strengthen finite RLT and SDP-RLT bounds for nonconvex quadratic programs2
Characterisation of zero duality gap for optimization problems in spaces without linear structure2
Early years of biased random-key genetic algorithms: a systematic review2
A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis2
Parallel inexact Levenberg–Marquardt method for nearly-separable nonlinear least squares2
Interval constraint programming for globally solving catalog-based categorical optimization2
Inexact bilevel stochastic gradient methods for constrained and unconstrained lower-level problems2
A bundle-type method for nonsmooth DC programs2
Outer approximation scheme for weakly convex constrained optimization problems2
Tightening state relaxations for global dynamic optimization using dynamic cuts2
AI-based predictive analytics for enhancing data-driven supply chain optimization2
An optimization approach for transformed low tubal rank of third-order tensors2
Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization2
A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization2
Computing one-bit compressive sensing via zero-norm regularized DC loss model and its surrogate2
Reference-point-based branch and bound algorithm for multiobjective optimization2
An average-compress algorithm for the sample mean problem under dynamic time warping2
Minimizers of sparsity regularized least absolute deviations2
An efficient global optimization algorithm with adaptive estimates of the local Lipschitz constants2
An oracle-based framework for robust combinatorial optimization2
Efficient smooth minorants for global optimization of univariate functions with the first derivative satisfying the interval Lipschitz condition2
Rectilinear convex hull of points in 3D and applications2
A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems2
Revisiting Nesterov’s acceleration via high-resolution differential equations2
Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds2
Intersecting ellipses induced by a max-sum matching2
Inexact primal-dual active set iteration for optimal distribution control of stationary heat or cold source2
Calmness of partial perturbation to composite rank constraint systems and its applications2
Exact SDP relaxations for quadratic programs with bipartite graph structures2
An extragradient algorithm for a lifted reformulation of projected solutions for quasiequilibria2
Distributed primal outer approximation algorithm for sparse convex programming with separable structures2
Inexact subgradient algorithm with a non-asymptotic convergence guarantee for copositive programming problems2
Solution methods for partial inverse combinatorial optimization problems in which weights can only be increased2
Applying augmented weak subdifferentials and normal cones for nonconvex mathematical programming problems2
A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem1
On relation between bilevel programming problems and variational inequalities on hadamard manifolds with application to toll optimization problem1
A Bregman inertial forward-reflected-backward method for nonconvex minimization1
Global linear convergence of evolution strategies with recombination on scaling-invariant functions1
A generalized alternating direction implicit method for consensus optimization: application to distributed sparse logistic regression1
A new optimization approach to solving split equality problems in Hilbert spaces1
Local search versus linear programming to detect monotonicity in simplicial branch and bound1
A kinematic smoothing method for tightening convex relaxations of ordinary differential equations1
NAUTILI: A trade-off-free interactive multiobjective optimization method for group decision making1
The restricted inverse optimal value problem on shortest path under $$l_1$$ norm on trees1
System architecture optimization strategies: dealing with expensive hierarchical problems1
Packing spheres with quasi-containment conditions1
A distributed proximal splitting method with linesearch for locally Lipschitz gradients1
Hybrid decomposition and deep learning approach for data-driven FOREX forecasting optimization1
Quadratic optimization problems with non-crossover and non-separable constraint boundaries1
Deep learning the efficient frontier of convex vector optimization problems1
Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise1
A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery1
Scenario consensus algorithms for solving stochastic and dynamic problems1
On the use of overlapping convex hull relaxations to solve nonconvex MINLPs1
An effective branch and bound algorithm for generalized risk parity portfolio optimization1
Nonlinear separation theorems for co-radiant sets and optimality conditions for approximate and proper approximate solutions in vector optimization1
Efficient enumeration of the optimal solutions to the correlation clustering problem1
On the Minimization of the Sum of Nonconvex Functions with Applications to Mathematical Programming1
Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem1
An efficient stochastic subgradient method for the global placement problem in very large-scale integration circuits1
A branch-and-bound algorithm for parametric mixed-binary nonlinear programs1
Global Optimization of Gas Transportation and Storage: Convex Hull Characterizations and Relaxations1
A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems1
The appeals of quadratic majorization–minimization1
Preface1
Norm-induced cuts: outer approximation for Lipschitzian constraint functions1
Stochastic decomposition for risk-averse two-stage stochastic linear programs1
On convergence of a q-random coordinate constrained algorithm for non-convex problems1
On existence of solutions to nonconvex minimization problems1
Minimum flow decomposition in graphs with cycles using integer linear programming1
Limited memory bundle DC algorithm for sparse pairwise kernel learning1
Existence of weak efficient solutions of set-valued optimization problems1
Time-dependent elliptic quasi-variational-hemivariational inequalities: well-posedness and application1
Weak and strong convergence of generalized proximal point algorithms with relaxed parameters1
Optimality and error bound for set optimization with application to uncertain multi-objective programming1
Publisher Correction: On a tractable single-level reformulation of a multilevel model of the European entry-exit gas market with market power1
Multi-instance learning by maximizing the area under receiver operating characteristic curve1
Calabi-Polyak convexity theorem, Yuan’s lemma and S-lemma: extensions and applications1
Accelerated gradient methods with strong convergence to the minimum norm minimizer: a dynamic approach combining time scaling, averaging, and Tikhonov regularization1
A new partition method for DIRECT-type algorithm based on minimax design1
Global optimization: a machine learning approach1
A method for searching for a globally optimal k-partition of higher-dimensional datasets1
Rank-sparsity decomposition for planted quasi clique recovery1
An exact algorithm for disaster-resilience augmentation of planar straight-line graphs1
The rate of convergence of augmented Lagrangian method for bilevel optimization problems with equality constraints1
Dual optimality conditions for the difference of extended real valued increasing co-radiant functions1
Stochastic golden ratio algorithm to non-convex stochastic mixed variational inequality problem1
A new scheme for approximating the weakly efficient solution set of vector rational optimization problems1
Preface: the special issue dedicated to the 100th anniversary of professor Hoàng Tuy1
0.21633505821228