Journal of Global Optimization

Article	Citations
Book review on “Convex Analysis and Beyond. Volume I: Basic Theory”, a monograph by Boris S. Mordukhovich and Nguyen Mau Nam	28
A method based on parametric convex programming for solving convex multiplicative programming problem	27
A consensus-based optimization method for nonsmooth nonconvex programs with approximated gradient descent scheme	25
Nonconvex sensitivity-based generalized Benders decomposition	24
A survey of exact and approximation algorithms for linear-parametric optimization problems	24
A two-phase sequential algorithm for global optimization of the standard quadratic programming problem	19
Stochastic optimization problems with nonlinear dependence on a probability measure via the Wasserstein metric	19
A bi-level programming problem of medicine procurement and production optimization	19
Combining gradient information and primitive directions for high-performance Bound-Constrained mixed-integer optimization	17
Alternative regularizations for Outer-Approximation algorithms for convex MINLP	15
Characterizations of Strongly Quasiconvex Functions	15
A performance analysis of Basin hopping compared to established metaheuristics for global optimization	14
Constrained optimization in simulation: efficient global optimization and Karush-Kuhn-Tucker conditions	14
Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies	14
Risk-averse two-stage distributionally robust mixed-integer optimization with decision-dependent ambiguity sets	13
Open issues and recent advances in DC programming and DCA	13
Data-driven Lipschitz-informed convex underestimators for branch-and-bound optimization of black-box functions	13
EFIX: Exact fixed point methods for distributed optimization	13
On the global convergence of the proximal gradient method for Tikhonov regularized correction of absolute value equations	12
Noncoercive and noncontinuous equilibrium problems: existence theorem in infinite-dimensional spaces	11
Characterizations of set order relations and nonlinear scalarizations via generalized oriented distance function in set optimization	11
Sparse polynomial optimization with matrix constraints	11
Stochastic DC algorithms for general stochastic DC programs with machine learning applications	11
Semistrictly and neatly quasiconvex programming using lower global subdifferentials	11
Characterization of set order relations and set optimization problems via conic scalarization	10

Using quadratic cuts to iteratively strengthen convexifications of box quadratic programs	10
An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems	10
Relaxed-inertial proximal point type algorithms for quasiconvex minimization	10
Nested benders decomposition for a deterministic biomass feedstock logistics problem	10
Hausdorff distance between convex semialgebraic sets	9
Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem	9
Optimality conditions for zero-one composite optimization problems	9
Compact mixed-integer programming formulations in quadratic optimization	9
Subdomain separability in global optimization	9
A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions	9
A refined proximal algorithm for nonconvex multiobjective optimization in Hilbert spaces	9
A new Riemannian Multiplicative Updates for Chordal Nonnegative Matrix Factorization	9
New bounds and formulations for the deterministic global optimization of Lennard–Jones clusters	9
Stability analysis of split equality and split feasibility problems	9
Data-trading coordination with government subsidy	8
Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials	8
Non-convex optimization problems with linear KKT subsystem	8
Support vector machines with the hard-margin loss: optimal training via combinatorial Benders’ cuts	8
An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant	8
Quasi-Newton method with subspace gradients	8
Benefits of the iopis paradigm on the landscapes of multiobjective optimization problems	8
A new global algorithm for factor-risk-constrained mean-variance portfolio selection	7
Optimality conditions and solution analysis at infinity for nonsmooth optimization problems	7
Discretization and global optimization for mixed integer bilinear programming	7
Simple proximal-type algorithms for equilibrium problems	7
A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines	7
Weak and strong convergence theorems for the mixed split feasibility problem in Hilbert spaces	7
Mixed polynomial variational inequalities	7
Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges	7
The exact projective penalty method for constrained optimization	7
A surrogate-assisted a priori multiobjective evolutionary algorithm for constrained multiobjective optimization problems	7
Regret analysis of an online majorized semi-proximal ADMM for online composite optimization	7
A Relax-Fix-and-Exclude algorithm for an MINLP problem with multilinear interpolations	7
Hybridizing two linear relaxation techniques in interval-based solvers	7
Error bounds, PL condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods	7
Globalized distributionally robust optimization based on samples	7
Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes	6
Modified general splitting method for the split feasibility problem	6
A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems	6
Computing the recession cone of a convex upper image via convex projection	6
Decision bounding problems for two-stage distributionally robust stochastic bilevel optimization	6
Some saddle-point theorems for vector-valued functions	6
Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs	6
A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization	6
Optimality analysis for $$\epsilon $$-quasi solutions of optimization problems via $$\epsilon $$-upper convexificators: a dual approach	6
A revised monotonicity-based method for computing tight image enclosures of functions	6
Strict feasibility for the polynomial complementarity problem	6
Second order analysis for robust inclusion systems and applications	6
Quaternion matrix decomposition and its theoretical implications	6
A strategy to tighten the relaxation of bilinear terms towards petrochemical scheduling problem	6

Distributionally robust fractional optimization of probability of exceedance	6
Unboundedness of the images of set-valued mappings having closed graphs: application to vector optimization	6
One-Step iterative method for bilevel equilibrium problem in Hilbert space	6
Global solution algorithms for DC programming via polyhedral approximations of convex functions	6
On asymptotic convergence rate of random search	6
Finding global solutions of some inverse optimal control problems using penalization and semismooth Newton methods	6
On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations	6
Addressing mixed constraints: an improved framework for black-box optimization	6
A note on the SDP relaxation of the minimum cut problem	5
A Bregman ADMM for Robust Fused Lasso Estimation with Doubly Nonconvex Regularizers	5
A QoS and sustainability-driven two-stage service composition method in cloud manufacturing: combining clustering and bi-objective optimization	5
Global convergence of block Bregman proximal iteratively reweighted algorithm with extrapolation	5
Structured tensor tuples to polynomial complementarity problems	5
Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems	5
SPLD polynomial optimization and bounded degree SOS hierarchies	5
Separating bichromatic point sets in the plane by restricted orientation convex hulls	5
Constrained consensus-based optimization and numerical heuristics for the few particle regime	5
Optimization in complex spaces with the mixed Newton method	5
Approximation algorithms for the individually fair k-center with outliers	5
Strong convergence of the composition of firmly nonexpansive mappings	5
Conditions for the stability of ideal efficient solutions in parametric vector optimization via set-valued inclusions	5
A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations	5
Approximating biobjective minimization problems using general ordering cones	4
A facial reduction approach for the single source localization problem	4
On a tractable single-level reformulation of a multilevel model of the European entry-exit gas market with market power	4
An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities	4
Subdifferentials of optimal value functions under metric qualification conditions	4
Tropical gradient descent	4
Preface to the special issue on the $$8^\textrm{th}$$ world congress on global optimization	4
The projected-type method for the extended vertical linear complementarity problem revisited	4
A new relaxed projection method for solving the split feasibility problem with multiple output sets	4
On the convergence result of the gradient-push algorithm on directed graphs with constant stepsize	4
Correction to: Brezis pseudomonotone bifunctions and quasi equilibrium problems via penalization	4
Relaxed method for optimization problems with cardinality constraints	4
Extragradient-type methods with $$\mathcal {O}\left( 1/k\right) $$ last-iterate convergence rates for co-hypomonotone inclusions	4
Stochastic ADMM with variance-reduced recursive momentum and its accelerated variant for nonconvex nonsmooth optimization	4
Exchange rates and multicommodity international trade: insights from spatial price equilibrium modeling with policy instruments via variational inequalities	4
Monotone submodular maximization under the pairwise capacity constraint	4
Gaussian Process regression over discrete probability measures: on the non-stationarity relation between Euclidean and Wasserstein Squared Exponential Kernels	4
On e-monotonicity and maximality of operators in Banach spaces	4
Optimal Piecewise Linear Approximations for Sigmoid, Tanh, Probability Density and Cumulative Distribution Functions: Tabular Form and R Package pwlapprox2d	4
An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems	3
A Two-Step Proximal Point Algorithm for Nonconvex Equilibrium Problems with Applications to Fractional Programming	3
On the second-order optimality conditions for multi-objective optimal control problems with mixed pointwise constraints	3
Quasiconjugate duality and optimality conditions for quasiconvex optimization	3
Quadratic convex reformulations for multiObjective binary quadratic programming	3
A K-means Supported Reinforcement Learning Framework to Multi-dimensional Knapsack	3
Directional derivatives and subdifferentials for set-valued maps applied to set optimization	3
Revisiting non-monotone regularized submodular maximization: bi-criteria and PASS approximations	3
Extension of forward-reflected-backward method to non-convex mixed variational inequalities	3
Aubin property for solution set in multi-objective programming	3
A strong P-formulation for global optimization of industrial water-using and treatment networks	3
Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots	3
Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints	3
An efficient branch-and-cut algorithm for the minimum covering location problem with distance constraints	3
Parabolic approximation & relaxation for MINLP	3
A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice	3
Finding the set of global minimizers of a piecewise affine function	3
Online non-monotone diminishing return submodular maximization in the bandit setting	3
Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles	3
Kurdyka-Łojasiewicz inequality and error bounds of D-Gap functions for nonsmooth and nonmonotone variational inequality problems	3
A robust multi-objective Bayesian optimization framework considering input uncertainty	3
Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds	3
A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems	3
On maximum-sum matchings of points	3
Covering a rectangle with 6 circles: a reliable mathematical programming approach	3
Partial augmented Lagrangian method for non-Lipschitz mathematical programs with complementarity constraints	3
POINT-BASED SUFFICIENT CONDITIONS FOR SHARP SOLUTIONS IN NONSMOOTH OPTIMIZATION	3
Multi-step Inertial Accelerated Doubly Stochastic Gradient Methods for Block Term Tensor Decomposition	3
An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints	3
Approximations of unbounded convex projections and unbounded convex sets	3
On generalized KKT points for the Motzkin–Straus program	3
Extended McCormick relaxation rules for handling empty arguments representing infeasibility	3
Using dual relaxations in multiobjective mixed-integer convex quadratic programming	3
Comparing reference point based interactive multiobjective optimization methods without a human decision maker	3
Constraint generation approaches for submodular function maximization leveraging graph properties	3
Pointwise expected hypervolume improvement for expensive multi-objective optimization	3
Quasi-Newton type proximal gradient method for nonconvex nonsmooth composite optimization problems	3
On polling directions for randomized direct-search approaches: application to beam angle optimization in intensity-modulated proton therapy	3
Robust chance-constrained optimization with discrete distributions	3

Preface	2
A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis	2
Applying augmented weak subdifferentials and normal cones for nonconvex mathematical programming problems	2
Reference-point-based branch and bound algorithm for multiobjective optimization	2
Efficient smooth minorants for global optimization of univariate functions with the first derivative satisfying the interval Lipschitz condition	2
Computational advances in polynomial optimization: RAPOSa, a freely available global solver	2
An inexact primal–dual method with correction step for a saddle point problem in image debluring	2
A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors	2
Computing one-bit compressive sensing via zero-norm regularized DC loss model and its surrogate	2
Early years of biased random-key genetic algorithms: a systematic review	2
An oracle-based framework for robust combinatorial optimization	2
Sparse sub-gaussian random projections for semidefinite programming relaxations	2
Distributed primal outer approximation algorithm for sparse convex programming with separable structures	2
A utopia point method-based robust vector polynomial optimization scheme	2
Inexact primal-dual active set iteration for optimal distribution control of stationary heat or cold source	2
Separable Edge-Concave Underestimator for High-Dimensional Signomials in Nonnegative Orthant	2
Bundle trust region algorithm based on linear subproblem	2
Mean-risk stochastic integer programming approach for integrated fuel treatment and wildfire response planning with endogenous uncertainty	2
A robust investment-consumption optimization problem in a switching regime interest rate setting	2
Inexact bilevel stochastic gradient methods for constrained and unconstrained lower-level problems	2
An extragradient algorithm for quasiconvex equilibrium problems without monotonicity	2
Calmness of partial perturbation to composite rank constraint systems and its applications	2
Tightening state relaxations for global dynamic optimization using dynamic cuts	2
Relaxations of KKT conditions do not strengthen finite RLT and SDP-RLT bounds for nonconvex quadratic programs	2
Parallel inexact Levenberg–Marquardt method for nearly-separable nonlinear least squares	2
Characterisation of zero duality gap for optimization problems in spaces without linear structure	2
TREGO: a trust-region framework for efficient global optimization	2
Exact SDP relaxations for quadratic programs with bipartite graph structures	2
A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization	2
An average-compress algorithm for the sample mean problem under dynamic time warping	2
Optimising portfolio diversification and dimensionality	2
Optimality and solutions for conic robust multiobjective programs	2
An efficient global optimization algorithm with adaptive estimates of the local Lipschitz constants	2
An optimization approach for transformed low tubal rank of third-order tensors	2
A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems	2
Stochastic red-blue set covering: a decomposition approach	2
A bundle-type method for nonsmooth DC programs	2
Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem	2
Revisiting Nesterov’s acceleration via high-resolution differential equations	2
Computing two-stage robust optimization with mixed integer structures	2
New semidefinite relaxations for a class of complex quadratic programming problems	2
Solution methods for partial inverse combinatorial optimization problems in which weights can only be increased	2
An extragradient algorithm for a lifted reformulation of projected solutions for quasiequilibria	2
Minimizers of sparsity regularized least absolute deviations	2
Intersecting ellipses induced by a max-sum matching	2
Consensus-based optimization for multi-objective problems: a multi-swarm approach	2
Constructing Tight Quadratic Relaxations for Global Optimization: I. Outer-Approximating Twice-Differentiable Convex Functions	2
Publisher Correction: On a tractable single-level reformulation of a multilevel model of the European entry-exit gas market with market power	1
Gradient projection method on the sphere, complementarity problems and copositivity	1
NAUTILI: A trade-off-free interactive multiobjective optimization method for group decision making	1
A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems	1
Efficient enumeration of the optimal solutions to the correlation clustering problem	1
On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem	1
On the use of overlapping convex hull relaxations to solve nonconvex MINLPs	1
Hybrid decomposition and deep learning approach for data-driven FOREX forecasting optimization	1
Packing spheres with quasi-containment conditions	1
Scenario consensus algorithms for solving stochastic and dynamic problems	1
Minimum flow decomposition in graphs with cycles using integer linear programming	1
Existence of weak efficient solutions of set-valued optimization problems	1
A kinematic smoothing method for tightening convex relaxations of ordinary differential equations	1
A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem	1
An effective branch and bound algorithm for generalized risk parity portfolio optimization	1
Constrained multiobjective optimization of expensive black-box functions using a heuristic branch-and-bound approach	1
Fitting feature-dependent Markov chains	1
A new optimization approach to solving split equality problems in Hilbert spaces	1
On the study of multistage stochastic vector quasi-variational problems	1
Regularized sample average approximation for high-dimensional stochastic optimization under low-rankness	1
An efficient stochastic subgradient method for the global placement problem in very large-scale integration circuits	1
A method for searching for a globally optimal k-partition of higher-dimensional datasets	1
Rank-sparsity decomposition for planted quasi clique recovery	1
On existence of solutions to nonconvex minimization problems	1
Preface	1
Stochastic decomposition for risk-averse two-stage stochastic linear programs	1
The restricted inverse optimal value problem on shortest path under $$l_1$$ norm on trees	1
A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery	1
Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem	1
A branch-and-bound algorithm for parametric mixed-binary nonlinear programs	1
A new partition method for DIRECT-type algorithm based on minimax design	1
Rectilinear convex hull of points in 3D and applications	1
Regrets of proximal method of multipliers for online non-convex optimization with long term constraints	1
System architecture optimization strategies: dealing with expensive hierarchical problems	1
Extended vertical tensor complementarity problems with finite solution sets	1
Almost optimal manipulation of pairwise comparisons of alternatives	1
The interpolating element-free Galerkin method for the p-Laplace double obstacle mixed complementarity problem	1
Dual optimality conditions for the difference of extended real valued increasing co-radiant functions	1
A surrogate-assisted evolutionary algorithm with clustering-based sampling for high-dimensional expensive blackbox optimization	1
Convergence rate of alternating projection method for the intersection of an affine subspace and the second-order cone	1
An exact algorithm for disaster-resilience augmentation of planar straight-line graphs	1
Stochastic golden ratio algorithm to non-convex stochastic mixed variational inequality problem	1
Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise	1
A new scheme for approximating the weakly efficient solution set of vector rational optimization problems	1
Limited memory bundle DC algorithm for sparse pairwise kernel learning	1
Tight bounds on the maximal perimeter and the maximal width of convex small polygons	1
The appeals of quadratic majorization–minimization	1
A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems	1