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	25
A method based on parametric convex programming for solving convex multiplicative programming problem	24
Exclusion regions for parameter-dependent systems of equations	24
Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion	23
Global convergence of model function based Bregman proximal minimization algorithms	18
A two-phase sequential algorithm for global optimization of the standard quadratic programming problem	17
Stochastic optimization problems with nonlinear dependence on a probability measure via the Wasserstein metric	17
A performance analysis of Basin hopping compared to established metaheuristics for global optimization	16
Constrained optimization in simulation: efficient global optimization and Karush-Kuhn-Tucker conditions	16
A bi-level programming problem of medicine procurement and production optimization	15
Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies	15
A survey of exact and approximation algorithms for linear-parametric optimization problems	14
Alternative regularizations for Outer-Approximation algorithms for convex MINLP	13
Noncoercive and noncontinuous equilibrium problems: existence theorem in infinite-dimensional spaces	13
An extension of the proximal point algorithm beyond convexity	13
Nonconvex sensitivity-based generalized Benders decomposition	13
Open issues and recent advances in DC programming and DCA	13
Improved interval methods for solving circle packing problems in the unit square	13
Nested benders decomposition for a deterministic biomass feedstock logistics problem	12
EFIX: Exact fixed point methods for distributed optimization	11
Using quadratic cuts to iteratively strengthen convexifications of box quadratic programs	11
Semistrictly and neatly quasiconvex programming using lower global subdifferentials	11
Characterizations of set order relations and nonlinear scalarizations via generalized oriented distance function in set optimization	11
A new greedy strategy for maximizing monotone submodular function under a cardinality constraint	11
Relaxed-inertial proximal point type algorithms for quasiconvex minimization	10

Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem	10
Stability analysis of split equality and split feasibility problems	10
Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities	10
An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems	10
Improved variance reduction extragradient method with line search for stochastic variational inequalities	9
New bounds and formulations for the deterministic global optimization of Lennard–Jones clusters	9
A generalized block-iterative projection method for the common fixed point problem induced by cutters	9
Compact mixed-integer programming formulations in quadratic optimization	9
A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions	9
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints	9
Sparse regularization via bidualization	9
A surrogate-assisted a priori multiobjective evolutionary algorithm for constrained multiobjective optimization problems	9
Hausdorff distance between convex semialgebraic sets	9
Subdomain separability in global optimization	9
On the maxima of motzkin-straus programs and cliques of graphs	9
A refined proximal algorithm for nonconvex multiobjective optimization in Hilbert spaces	9
Regret analysis of an online majorized semi-proximal ADMM for online composite optimization	8
Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem	8
Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials	8
Support vector machines with the hard-margin loss: optimal training via combinatorial Benders’ cuts	8
Data-trading coordination with government subsidy	8
Globalized distributionally robust optimization based on samples	8
Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems	8
On the branch and bound algorithm for the extended trust-region subproblem	8
An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant	8
An objective penalty function method for biconvex programming	8
A new global algorithm for factor-risk-constrained mean-variance portfolio selection	7
A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines	7
Solving non-monotone equilibrium problems via a DIRECT-type approach	7
A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems	7
Correction to: Numerical certification of Pareto optimality for biobjective nonlinear problems	7
The projected polar proximal point algorithm converges globally	7
Modified general splitting method for the split feasibility problem	7
Mixed polynomial variational inequalities	7
Simple proximal-type algorithms for equilibrium problems	7
Hybridizing two linear relaxation techniques in interval-based solvers	7
The exact projective penalty method for constrained optimization	7
Hopping between distant basins	7
Gaining or losing perspective	7
Discretization and global optimization for mixed integer bilinear programming	7
A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill’s global convergence	6
A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization	6
Unboundedness of the images of set-valued mappings having closed graphs: application to vector optimization	6
A revised monotonicity-based method for computing tight image enclosures of functions	6
Strict feasibility for the polynomial complementarity problem	6
One-Step iterative method for bilevel equilibrium problem in Hilbert space	6
On asymptotic convergence rate of random search	6
Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges	6
Computing the recession cone of a convex upper image via convex projection	6
Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs	6

A modified simplex partition algorithm to test copositivity	5
Second order analysis for robust inclusion systems and applications	5
A strategy to tighten the relaxation of bilinear terms towards petrochemical scheduling problem	5
Finding global solutions of some inverse optimal control problems using penalization and semismooth Newton methods	5
Conditions for the stability of ideal efficient solutions in parametric vector optimization via set-valued inclusions	5
Sufficient conditions for existence of global minimizers of functions on Hilbert spaces	5
Nonconvex and Nonsmooth Sparse Optimization via Adaptively Iterative Reweighted Methods	5
Addressing mixed constraints: an improved framework for black-box optimization	5
Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes	5
Optimality analysis for $$\epsilon $$-quasi solutions of optimization problems via $$\epsilon $$-upper convexificators: a dual approach	5
A Newton Frank–Wolfe method for constrained self-concordant minimization	5
An approximate lower order penalty approach for solving second-order cone linear complementarity problems	5
Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors	5
A QoS and sustainability-driven two-stage service composition method in cloud manufacturing: combining clustering and bi-objective optimization	5
Some saddle-point theorems for vector-valued functions	5
Quaternion matrix decomposition and its theoretical implications	5
Decision bounding problems for two-stage distributionally robust stochastic bilevel optimization	5
Strong convergence of the composition of firmly nonexpansive mappings	5
An adaptive high order method for finding third-order critical points of nonconvex optimization	5
A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations	5
Convex projection and convex multi-objective optimization	5
An exact algorithm for constructing minimum Euclidean skeletons of polygons	4
Simultaneous distributed-boundary optimal control problems driven by nonlinear complementarity systems	4
On nondegenerate M-stationary points for sparsity constrained nonlinear optimization	4
Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems	4
On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations	4
Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials	4
Subdifferentials of optimal value functions under metric qualification conditions	4
A facial reduction approach for the single source localization problem	4
Gaussian Process regression over discrete probability measures: on the non-stationarity relation between Euclidean and Wasserstein Squared Exponential Kernels	4
Extragradient-type methods with $$\mathcal {O}\left( 1/k\right) $$ last-iterate convergence rates for co-hypomonotone inclusions	4
An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities	4
Partial gradient optimal thresholding algorithms for a class of sparse optimization problems	4
Relaxed method for optimization problems with cardinality constraints	4
A note on the SDP relaxation of the minimum cut problem	4
Special Issue: 18th International conference on mathematical optimization theory and operations research (MOTOR 2019)	4
Approximation algorithms for the individually fair k-center with outliers	4
Global convergence of block Bregman proximal iteratively reweighted algorithm with extrapolation	4
Separating bichromatic point sets in the plane by restricted orientation convex hulls	4
On the convergence result of the gradient-push algorithm on directed graphs with constant stepsize	4
The projected-type method for the extended vertical linear complementarity problem revisited	4
Hidden invariant convexity for global and conic-intersection optimality guarantees in discrete-time optimal control	4
Sparse signal recovery via generalized gaussian function	4
The supporting hyperplane optimization toolkit for convex MINLP	4
Preface to the special issue dedicated to the 6th World Congress on Global Optimization held in Metz, France, July 8–10, 2019	4
Optimization in complex spaces with the mixed Newton method	4
Correction to: Brezis pseudomonotone bifunctions and quasi equilibrium problems via penalization	4
Structured tensor tuples to polynomial complementarity problems	4
Exact SDP relaxations of quadratically constrained quadratic programs with forest structures	4
Exchange rates and multicommodity international trade: insights from spatial price equilibrium modeling with policy instruments via variational inequalities	4
On a tractable single-level reformulation of a multilevel model of the European entry-exit gas market with market power	4
Supply chain networks, wages, and labor productivity: insights from Lagrange. analysis and computations	4
On e-monotonicity and maximality of operators in Banach spaces	4
Quasi-Newton type proximal gradient method for nonconvex nonsmooth composite optimization problems	3
Using dual relaxations in multiobjective mixed-integer convex quadratic programming	3
Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds	3
A K-means Supported Reinforcement Learning Framework to Multi-dimensional Knapsack	3
A robust multi-objective Bayesian optimization framework considering input uncertainty	3
On reduction of exhausters via a support function representation	3
Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in hilbert spaces	3
Fractional 0–1 programming and submodularity	3
Graph, clique and facet of boolean logical polytope	3
A Two-Step Proximal Point Algorithm for Nonconvex Equilibrium Problems with Applications to Fractional Programming	3
Comparing reference point based interactive multiobjective optimization methods without a human decision maker	3
An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints	3
The p-Lagrangian relaxation for separable nonconvex MIQCQP problems	3
Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots	3
Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles	3
A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems	3
Multi-stage portfolio selection problem with dynamic stochastic dominance constraints	3
Approximating biobjective minimization problems using general ordering cones	3
On maximum-sum matchings of points	3
New inertial forward-backward type for variational inequalities with Quasi-monotonicity	3
Aubin property for solution set in multi-objective programming	3
Online non-monotone diminishing return submodular maximization in the bandit setting	3
A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice	3
On generalized KKT points for the Motzkin–Straus program	3
Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization	3
Distributionally robust mean-absolute deviation portfolio optimization using wasserstein metric	3
Revisiting non-monotone regularized submodular maximization: bi-criteria and PASS approximations	3

Pointwise expected hypervolume improvement for expensive multi-objective optimization	3
Extended McCormick relaxation rules for handling empty arguments representing infeasibility	3
Extension of forward-reflected-backward method to non-convex mixed variational inequalities	3
Constraint generation approaches for submodular function maximization leveraging graph properties	3
Numerical certification of Pareto optimality for biobjective nonlinear problems	3
Approximations of unbounded convex projections and unbounded convex sets	3
A strong P-formulation for global optimization of industrial water-using and treatment networks	3
On polling directions for randomized direct-search approaches: application to beam angle optimization in intensity-modulated proton therapy	3
Finding the set of global minimizers of a piecewise affine function	3
Quasiconjugate duality and optimality conditions for quasiconvex optimization	3
Directional derivatives and subdifferentials for set-valued maps applied to set optimization	3
Early years of biased random-key genetic algorithms: a systematic review	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
Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem	2
Bundle trust region algorithm based on linear subproblem	2
Intersecting ellipses induced by a max-sum matching	2
Optimising portfolio diversification and dimensionality	2
On the second-order optimality conditions for multi-objective optimal control problems with mixed pointwise constraints	2
AI-based predictive analytics for enhancing data-driven supply chain optimization	2
A branch-cut-and-price algorithm for optimal decoding in digital communication systems	2
Inexact bilevel stochastic gradient methods for constrained and unconstrained lower-level problems	2
Tightening state relaxations for global dynamic optimization using dynamic cuts	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
A bundle-type method for nonsmooth DC programs	2
Distributed primal outer approximation algorithm for sparse convex programming with separable structures	2
Strong subdifferentials: theory and applications in nonconvex optimization	2
Stochastic red-blue set covering: a decomposition approach	2
A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors	2
Partial augmented Lagrangian method for non-Lipschitz mathematical programs with complementarity constraints	2
Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization	2
A utopia point method-based robust vector polynomial optimization scheme	2
An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems	2
A robust investment-consumption optimization problem in a switching regime interest rate setting	2
Asynchronous optimization of part logistics routing problem	2
A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization	2
TREGO: a trust-region framework for efficient global optimization	2
Computing one-bit compressive sensing via zero-norm regularized DC loss model and its surrogate	2
Consensus-based optimization for multi-objective problems: a multi-swarm approach	2
A note on completely positive relaxations of quadratic problems in a multiobjective framework	2
Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints	2
A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems	2
Preface: special issue on optimization in distance geometry	2
An extragradient algorithm for quasiconvex equilibrium problems without monotonicity	2
An inexact primal–dual method with correction step for a saddle point problem in image debluring	2
New semidefinite relaxations for a class of complex quadratic programming problems	2
Applying augmented weak subdifferentials and normal cones for nonconvex mathematical programming problems	2
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements	2
An efficient branch-and-cut algorithm for the minimum covering location problem with distance constraints	2
An extragradient algorithm for a lifted reformulation of projected solutions for quasiequilibria	2
An average-compress algorithm for the sample mean problem under dynamic time warping	2
Calmness of partial perturbation to composite rank constraint systems and its applications	2
Computational advances in polynomial optimization: RAPOSa, a freely available global solver	2
Exact SDP relaxations for quadratic programs with bipartite graph structures	2
A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis	2
An oracle-based framework for robust combinatorial optimization	2
A new scheme for approximating the weakly efficient solution set of vector rational optimization problems	1
An exact algorithm for disaster-resilience augmentation of planar straight-line graphs	1
A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery	1
A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem	1
Existence of weak efficient solutions of set-valued optimization problems	1
On the study of multistage stochastic vector quasi-variational problems	1
On the convergence order of value function relaxations used in decomposition-based global optimization of nonconvex stochastic programs	1
A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis	1
Numerical methods using two different approximations of space-filling curves for black-box global optimization	1
The restricted inverse optimal value problem on shortest path under $$l_1$$ norm on trees	1
Dual optimality conditions for the difference of extended real valued increasing co-radiant functions	1
On the global minimization of discretized residual functionals of conditionally well-posed inverse problems	1
Packing spheres with quasi-containment conditions	1
New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming	1
Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise	1
Strong convergence of inertial projection and contraction methods for pseudomonotone variational inequalities with applications to optimal control problems	1
Stochastic golden ratio algorithm to non-convex stochastic mixed variational inequality problem	1
A new partition method for DIRECT-type algorithm based on minimax design	1
A surrogate-assisted evolutionary algorithm with clustering-based sampling for high-dimensional expensive blackbox optimization	1
Extended vertical tensor complementarity problems with finite solution sets	1
Gradient projection method on the sphere, complementarity problems and copositivity	1
Regrets of proximal method of multipliers for online non-convex optimization with long term constraints	1
Efficient enumeration of the optimal solutions to the correlation clustering problem	1
Preface	1
A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems	1
Stochastic decomposition for risk-averse two-stage stochastic linear programs	1
A revision of the rectangular algorithm for a class of DC optimization problems	1
A branch-and-bound algorithm for parametric mixed-binary nonlinear programs	1
Improperly efficient solutions in a class of vector optimization problems	1
Hybrid decomposition and deep learning approach for data-driven FOREX forecasting optimization	1
A golden ratio proximal alternating direction method of multipliers for separable convex optimization	1
Fitting feature-dependent Markov chains	1
On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem	1
A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems	1
On the use of overlapping convex hull relaxations to solve nonconvex MINLPs	1
A method for searching for a globally optimal k-partition of higher-dimensional datasets	1
Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem	1
Covering a simplex by spheres: complexity and algorithms	1