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 2020-11-01 to 2024-11-01.)
ArticleCitations
Data-driven distributionally robust chance-constrained optimization with Wasserstein metric50
Production and transport scheduling in flexible job shop manufacturing systems50
An optimization approach to solving the split feasibility problem in Hilbert spaces27
Optimal decision trees for categorical data via integer programming26
MVMOO: Mixed variable multi-objective optimisation23
General splitting methods with linearization for the split feasibility problem20
Characterization results of solutions in interval-valued optimization problems with mixed constraints19
Strong convergence of inertial projection and contraction methods for pseudomonotone variational inequalities with applications to optimal control problems17
Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks15
Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities14
A general branch-and-bound framework for continuous global multiobjective optimization14
Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization14
Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint13
Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization12
New inertial forward-backward type for variational inequalities with Quasi-monotonicity11
An extension of the proximal point algorithm beyond convexity11
Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system11
Review and comparison of algorithms and software for mixed-integer derivative-free optimization11
An empirical study of various candidate selection and partitioning techniques in the DIRECT framework11
A fixed point iterative method for tensor complementarity problems with the implicit Z-tensors10
Accelerated Dai-Liao projection method for solving systems of monotone nonlinear equations with application to image deblurring10
Global dynamic optimization with Hammerstein–Wiener models embedded10
Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations10
Integrating $$\varepsilon $$-dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems10
Detecting and solving aircraft conflicts using bilevel programming10
Global optimization of mixed-integer nonlinear programs with SCIP 89
The supporting hyperplane optimization toolkit for convex MINLP9
A three-stage stochastic optimization model integrating 5G technology and UAVs for disaster management9
TREGO: a trust-region framework for efficient global optimization9
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation9
Necessary conditions for weak minima and for strict minima of order two in nonsmooth constrained multiobjective optimization9
On $$\Delta $$-modular integer linear problems in the canonical form and equivalent problems9
Simultaneous distributed-boundary optimal control problems driven by nonlinear complementarity systems8
Augmented Lagrangian method for second-order cone programs under second-order sufficiency8
Global optimization for the multilevel European gas market system with nonlinear flow models on trees8
Conical averagedness and convergence analysis of fixed point algorithms8
Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization8
Solution sets of three sparse optimization problems for multivariate regression8
On stationarity for nonsmooth multiobjective problems with vanishing constraints8
One-exact approximate Pareto sets8
Inverse multiobjective optimization: Inferring decision criteria from data8
Lipschitz-inspired HALRECT algorithm for derivative-free global optimization7
The EMS vehicle patient transportation problem during a demand surge7
An approximation algorithm for multi-objective optimization problems using a box-coverage7
Error bound analysis for vector equilibrium problems with partial order provided by a polyhedral cone7
Linearization of McCormick relaxations and hybridization with the auxiliary variable method7
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower’s objective7
A power penalty approach to a mixed quasilinear elliptic complementarity problem7
Convex hull representations for bounded products of variables7
On strong duality in linear copositive programming7
Gaining or losing perspective6
Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections6
Partial gradient optimal thresholding algorithms for a class of sparse optimization problems6
Copula theory approach to stochastic geometric programming6
Improved interval methods for solving circle packing problems in the unit square6
Integer programming formulations and efficient local search for relaxed correlation clustering6
Packing convex polygons in minimum-perimeter convex hulls6
Proximity measures based on KKT points for constrained multi-objective optimization6
Linear convergence of a nonmonotone projected gradient method for multiobjective optimization6
Exact SDP relaxations of quadratically constrained quadratic programs with forest structures6
Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials6
Primal-dual splittings as fixed point iterations in the range of linear operators6
A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems6
Supply chain networks, wages, and labor productivity: insights from Lagrange. analysis and computations6
Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints6
Maximization problems of balancing submodular relevance and supermodular diversity6
Scenario-based cuts for structured two-stage stochastic and distributionally robust p-order conic mixed integer programs6
Open issues and recent advances in DC programming and DCA5
Alternating DC algorithm for partial DC programming problems5
Multiobjective optimization with least constraint violation: optimality conditions and exact penalization5
On maximum-sum matchings of points5
Scalar and vector equilibrium problems with pairs of bifunctions5
Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems5
Nonconvex and Nonsmooth Sparse Optimization via Adaptively Iterative Reweighted Methods5
Convex projection and convex multi-objective optimization5
A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice5
Branch-and-price for a class of nonconvex mixed-integer nonlinear programs5
On global subdifferentials with applications in nonsmooth optimization5
Vertex quickest 1-center location problem on trees and its inverse problem under weighted $$l_\infty $$ norm5
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT5
Hospital service levels during drug shortages: Stocking and transshipment policies for pharmaceutical inventory5
Adaptive seeding for profit maximization in social networks5
Painlevé-Kuratowski convergence of minimal solutions for set-valued optimization problems via improvement sets5
On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic5
Numerical methods using two different approximations of space-filling curves for black-box global optimization5
Exchange rates and multicommodity international trade: insights from spatial price equilibrium modeling with policy instruments via variational inequalities5
DC auxiliary principle methods for solving lexicographic equilibrium problems5
Multi-objective convex polynomial optimization and semidefinite programming relaxations5
Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression4
A robust multi-objective Bayesian optimization framework considering input uncertainty4
Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials4
Tight bounds on the maximal perimeter and the maximal width of convex small polygons4
Efficient approximation of the metric CVRP in spaces of fixed doubling dimension4
Near optimal minimal convex hulls of disks4
Dynamical system for solving bilevel variational inequalities4
Zeroth-order single-loop algorithms for nonconvex-linear minimax problems4
Multi-objective dynamic programming with limited precision4
Distributionally robust mean-absolute deviation portfolio optimization using wasserstein metric4
A variable neighborhood search algorithm for the $$ (r{\mid }p) $$ hub–centroid problem under the price war4
Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound4
Multidimensional Assignment Problem for Multipartite Entity Resolution4
An inertial proximal point method for difference of maximal monotone vector fields in Hadamard manifolds4
Optimality conditions based on the Fréchet second-order subdifferential4
Directional derivatives and subdifferentials for set-valued maps applied to set optimization4
An efficient alternating minimization method for fourth degree polynomial optimization4
An extragradient algorithm for quasiconvex equilibrium problems without monotonicity4
A generalized block-iterative projection method for the common fixed point problem induced by cutters4
Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems4
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements4
Convergence rates for the heavy-ball continuous dynamics for non-convex optimization, under Polyak–Łojasiewicz condition4
Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes4
Compact mixed-integer programming formulations in quadratic optimization3
Improving exploration strategies in large dimensions and rate of convergence of global random search algorithms3
Finding groups with maximum betweenness centrality via integer programming with random path sampling3
Alternative regularizations for Outer-Approximation algorithms for convex MINLP3
On nondegenerate M-stationary points for sparsity constrained nonlinear optimization3
Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems3
An Entropy-Regularized ADMM For Binary Quadratic Programming3
Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks3
Structured tensor tuples to polynomial complementarity problems3
Global linear convergence of evolution strategies with recombination on scaling-invariant functions3
Mixed polynomial variational inequalities3
Approximation algorithms for the individually fair k-center with outliers3
Hopping between distant basins3
Smoothing Newton method for nonsmooth second-order cone complementarity problems with application to electric power markets3
Variational rationality, variational principles and the existence of traps in a changing environment3
On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints3
Kernel density estimation based distributionally robust mean-CVaR portfolio optimization3
Maximizing a non-decreasing non-submodular function subject to various types of constraints3
Strong subdifferentials: theory and applications in nonconvex optimization3
Which graphs are rigid in $$\ell _p^d$$?3
A dual approach to multi-dimensional assignment problems3
Parallel algorithm portfolios with adaptive resource allocation strategy3
Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach3
Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity3
Relaxed-inertial proximal point type algorithms for quasiconvex minimization3
Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization3
Existence results for solutions of mixed tensor variational inequalities3
A binary search algorithm for univariate data approximation and estimation of extrema by piecewise monotonic constraints3
One-Step iterative method for bilevel equilibrium problem in Hilbert space3
Efficient smooth minorants for global optimization of univariate functions with the first derivative satisfying the interval Lipschitz condition3
An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs3
Consistency of statistical estimators of solutions to stochastic optimization problems3
Global convergence of model function based Bregman proximal minimization algorithms3
Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems3
A unified Douglas–Rachford algorithm for generalized DC programming3
A method for convex black-box integer global optimization3
Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors3
Finding non dominated points for multiobjective integer convex programs with linear constraints3
A Newton Frank–Wolfe method for constrained self-concordant minimization3
Multi-stage portfolio selection problem with dynamic stochastic dominance constraints3
Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension3
Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in $$\mathbb {R}^d$$3
An optimization approach for winner determination problem considering transportation cost discounts3
Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds3
On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization3
Unique solvability of weakly homogeneous generalized variational inequalities2
The projected-type method for the extended vertical linear complementarity problem revisited2
Multiple instance classification via quadratic programming2
Improved variance reduction extragradient method with line search for stochastic variational inequalities2
Characterizations of set order relations and nonlinear scalarizations via generalized oriented distance function in set optimization2
Quaternion matrix decomposition and its theoretical implications2
Distributed primal outer approximation algorithm for sparse convex programming with separable structures2
Scalable Bayesian optimization with generalized product of experts2
Global exact optimization for covering a rectangle with 6 circles2
A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems2
LR-NIMBUS: an interactive algorithm for uncertain multiobjective optimization with lightly robust efficient solutions2
Low-rank matrix recovery with Ky Fan 2-k-norm2
Graph, clique and facet of boolean logical polytope2
A non-convex piecewise quadratic approximation of $$\ell _{0}$$ regularization: theory and accelerated algorithm2
A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill’s global convergence2
A branch-and-bound algorithm for solving max-k-cut problem2
Convexification techniques for linear complementarity constraints2
On canonical duality theory and constrained optimization problems2
Consensus-based optimization for multi-objective problems: a multi-swarm approach2
KKT-based primal-dual exactness conditions for the Shor relaxation2
Sparse signal recovery via generalized gaussian function2
Fitting feature-dependent Markov chains2
An objective penalty function method for biconvex programming2
NMR assignment through linear programming2
A variational approach to the alternating projections method2
Subdifferentials of optimal value functions under metric qualification conditions2
Optimistic NAUTILUS navigator for multiobjective optimization with costly function evaluations2
Discretization and global optimization for mixed integer bilinear programming2
Data-driven stochastic optimization for distributional ambiguity with integrated confidence region2
Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization2
Optimising portfolio diversification and dimensionality2
A Bregman inertial forward-reflected-backward method for nonconvex minimization2
Exact SDP relaxations for quadratic programs with bipartite graph structures2
Variable sample-size optimistic mirror descent algorithm for stochastic mixed variational inequalities2
Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization2
Asynchronous optimization of part logistics routing problem2
Separating bichromatic point sets in the plane by restricted orientation convex hulls2
Time-dependent elliptic quasi-variational-hemivariational inequalities: well-posedness and application2
A mini-batch stochastic conjugate gradient algorithm with variance reduction2
On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations2
Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion2
On the branch and bound algorithm for the extended trust-region subproblem2
New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming2
New semidefinite relaxations for a class of complex quadratic programming problems2
A smoothing quasi-Newton method for solving general second-order cone complementarity problems2
Generalized $${\varepsilon }$$-quasi solutions of set optimization problems2
A derivative-free scaling memoryless DFP method for solving large scale nonlinear monotone equations2
An interval branch and bound method for global Robust optimization2
Inverse max+sum spanning tree problem under weighted $$l_{\infty }$$ norm by modifying max-weight vector2
Extended McCormick relaxation rules for handling empty arguments representing infeasibility2
IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming2
Global sensing search for nonlinear global optimization2
A note on completely positive relaxations of quadratic problems in a multiobjective framework2
Brezis pseudomonotone bifunctions and quasi equilibrium problems via penalization2
Weak and strong convergence of generalized proximal point algorithms with relaxed parameters2
Randomized algorithms for the computation of multilinear rank-$$(\mu _1,\mu _2,\mu _3)$$ approximations2
On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems2
Decision bounding problems for two-stage distributionally robust stochastic bilevel optimization2
A golden ratio proximal alternating direction method of multipliers for separable convex optimization2
On the second-order optimality conditions for multi-objective optimal control problems with mixed pointwise constraints2
Critical sets, crowns and local maximum independent sets2
Computational advances in polynomial optimization: RAPOSa, a freely available global solver2
EFIX: Exact fixed point methods for distributed optimization2
Duality in nonconvex vector optimization2
Extension of forward-reflected-backward method to non-convex mixed variational inequalities2
Fractional 0–1 programming and submodularity2
Gaining or losing perspective for convex multivariate functions on a simplex1
Exclusion regions for parameter-dependent systems of equations1
Second order analysis for robust inclusion systems and applications1
Unassigned distance geometry and molecular conformation problems1
Noncoercive and noncontinuous equilibrium problems: existence theorem in infinite-dimensional spaces1
An outer–inner linearization method for non-convex and nondifferentiable composite regularization problems1
Learning chordal extensions1
Nonconvex sensitivity-based generalized Benders decomposition1
Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies1
The conditional p-dispersion problem1
Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs1
Optimality and error bound for set optimization with application to uncertain multi-objective programming1
Zeroth-order algorithms for nonconvex–strongly-concave minimax problems with improved complexities1
A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations1
Global well-posedness of set-valued optimization with application to uncertain problems1
Faster distance-based representative skyline and k-center along pareto front in the plane1
Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations1
Model risk in mean-variance portfolio selection: an analytic solution to the worst-case approach1
Local search versus linear programming to detect monotonicity in simplicial branch and bound1
Calabi-Polyak convexity theorem, Yuan’s lemma and S-lemma: extensions and applications1
Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization1
Optimal correction of the absolute value equations1
Some saddle-point theorems for vector-valued functions1
A new greedy strategy for maximizing monotone submodular function under a cardinality constraint1
Conditions for the stability of ideal efficient solutions in parametric vector optimization via set-valued inclusions1
ORCA: Outlier detection and Robust Clustering for Attributed graphs1
Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space1
Approximate Douglas–Rachford algorithm for two-sets convex feasibility problems1
0.060760974884033