OOIR: Observatory of International Research

Papers

(The TQCC of Journal of Global Optimization is 4. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-08-01 to 2025-08-01.)

Article	Citations
Book review on “Convex Analysis and Beyond. Volume I: Basic Theory”, a monograph by Boris S. Mordukhovich and Nguyen Mau Nam	25
Exclusion regions for parameter-dependent systems of equations	24
A method based on parametric convex programming for solving convex multiplicative programming problem	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
Open issues and recent advances in DC programming and DCA	13
Improved interval methods for solving circle packing problems in the unit square	13
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
Nested benders decomposition for a deterministic biomass feedstock logistics problem	12
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
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
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
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
On the maxima of motzkin-straus programs and cliques of graphs	9
A refined proximal algorithm for nonconvex multiobjective optimization in Hilbert spaces	9
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
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
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
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 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
Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs	6
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

Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes	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
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
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
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
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
Addressing mixed constraints: an improved framework for black-box optimization	5
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
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