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 2022-05-01 to 2026-05-01.)

Article	Citations
Book review on “Convex Analysis and Beyond. Volume I: Basic Theory”, a monograph by Boris S. Mordukhovich and Nguyen Mau Nam	32
A method based on parametric convex programming for solving convex multiplicative programming problem	28
A consensus-based optimization method for nonsmooth nonconvex programs with approximated gradient descent scheme	27
Nonconvex sensitivity-based generalized Benders decomposition	23
A survey of exact and approximation algorithms for linear-parametric optimization problems	22
Stochastic optimization problems with nonlinear dependence on a probability measure via the Wasserstein metric	22
A two-phase sequential algorithm for global optimization of the standard quadratic programming problem	19
A bi-level programming problem of medicine procurement and production optimization	18
Combining gradient information and primitive directions for high-performance Bound-Constrained mixed-integer optimization	18
Alternative regularizations for Outer-Approximation algorithms for convex MINLP	17
A performance analysis of Basin hopping compared to established metaheuristics for global optimization	16
Characterizations of Strongly Quasiconvex Functions	14
Open issues and recent advances in DC programming and DCA	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
Semistrictly and neatly quasiconvex programming using lower global subdifferentials	13
Constrained optimization in simulation: efficient global optimization and Karush-Kuhn-Tucker conditions	13
Relaxed-inertial proximal point type algorithms for quasiconvex minimization	13
On the global convergence of the proximal gradient method for Tikhonov regularized correction of absolute value equations	13
EFIX: Exact fixed point methods for distributed optimization	13
Data-driven Lipschitz-informed convex underestimators for branch-and-bound optimization of black-box functions	13
Sparse polynomial optimization with matrix constraints	12
Characterization of set order relations and set optimization problems via conic scalarization	11
Stochastic DC algorithms for general stochastic DC programs with machine learning applications	11
Nested benders decomposition for a deterministic biomass feedstock logistics problem	11

An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems	11
Noncoercive and noncontinuous equilibrium problems: existence theorem in infinite-dimensional spaces	11
Using quadratic cuts to iteratively strengthen convexifications of box quadratic programs	11
Characterizations of set order relations and nonlinear scalarizations via generalized oriented distance function in set optimization	11
Subdomain separability in global optimization	10
Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem	10
Hausdorff distance between convex semialgebraic sets	10
A new Riemannian Multiplicative Updates for Chordal Nonnegative Matrix Factorization	10
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints	9
On the maxima of motzkin-straus programs and cliques of graphs	9
A generalized block-iterative projection method for the common fixed point problem induced by cutters	9
Stability analysis of split equality and split feasibility problems	9
Data-trading coordination with government subsidy	9
A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions	9
New bounds and formulations for the deterministic global optimization of Lennard–Jones clusters	9
Support vector machines with the hard-margin loss: optimal training via combinatorial Benders’ cuts	9
Optimality conditions for zero-one composite optimization problems	8
Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials	8
Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems	8
An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant	8
Compact mixed-integer programming formulations in quadratic optimization	8
Quasi-Newton method with subspace gradients	8
Non-convex optimization problems with linear KKT subsystem	8
A refined proximal algorithm for nonconvex multiobjective optimization in Hilbert spaces	8
A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines	8
A surrogate-assisted a priori multiobjective evolutionary algorithm for constrained multiobjective optimization problems	8
Globalized distributionally robust optimization based on samples	8
The exact projective penalty method for constrained optimization	7
Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges	7
Optimality conditions and solution analysis at infinity for nonsmooth optimization problems	7
A new global algorithm for factor-risk-constrained mean-variance portfolio selection	7
A Relax-Fix-and-Exclude algorithm for an MINLP problem with multilinear interpolations	7
Mixed polynomial variational inequalities	7
Discretization and global optimization for mixed integer bilinear programming	7
Weak and strong convergence theorems for the mixed split feasibility problem in Hilbert spaces	7
Regret analysis of an online majorized semi-proximal ADMM for online composite optimization	7
Hybridizing two linear relaxation techniques in interval-based solvers	7
On asymptotic convergence rate of random search	6
On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations	6
Distributionally robust fractional optimization of probability of exceedance	6
A strategy to tighten the relaxation of bilinear terms towards petrochemical scheduling problem	6
Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs	6
Unboundedness of the images of set-valued mappings having closed graphs: application to vector optimization	6
Computing the recession cone of a convex upper image via convex projection	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
One-Step iterative method for bilevel equilibrium problem in Hilbert space	6
Quaternion matrix decomposition and its theoretical implications	6
Finding global solutions of some inverse optimal control problems using penalization and semismooth Newton methods	6
Second order analysis for robust inclusion systems and applications	6
Addressing mixed constraints: an improved framework for black-box optimization	6

Strict feasibility for the polynomial complementarity problem	6
Simple proximal-type algorithms for equilibrium problems	6
Error bounds, PL condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods	6
Global solution algorithms for DC programming via polyhedral approximations of convex functions	6
Approximation algorithms for the individually fair k-center with outliers	6
Some saddle-point theorems for vector-valued functions	6
A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization	6
Decision bounding problems for two-stage distributionally robust stochastic bilevel 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
Modified general splitting method for the split feasibility problem	6
Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes	6
SPLD polynomial optimization and bounded degree SOS hierarchies	5
Separating bichromatic point sets in the plane by restricted orientation convex hulls	5
A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations	5
A note on the SDP relaxation of the minimum cut problem	5
Monotone submodular maximization under the pairwise capacity constraint	5
A Bregman ADMM for Robust Fused Lasso Estimation with Doubly Nonconvex Regularizers	5
Conditions for the stability of ideal efficient solutions in parametric vector optimization via set-valued inclusions	5
Structured tensor tuples to polynomial complementarity problems	5
Special Issue: 18th International conference on mathematical optimization theory and operations research (MOTOR 2019)	5
Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems	5
Constrained consensus-based optimization and numerical heuristics for the few particle regime	5
Strong convergence of the composition of firmly nonexpansive mappings	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
Optimization in complex spaces with the mixed Newton method	5
On the convergence result of the gradient-push algorithm on directed graphs with constant stepsize	5
An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities	4
Correction to: Brezis pseudomonotone bifunctions and quasi equilibrium problems via penalization	4
Subdifferentials of optimal value functions under metric qualification conditions	4
The projected-type method for the extended vertical linear complementarity problem revisited	4
Approximating biobjective minimization problems using general ordering cones	4
Preface to the special issue on the $$8^\textrm{th}$$ world congress on global optimization	4
A new relaxed projection method for solving the split feasibility problem with multiple output sets	4
On a tractable single-level reformulation of a multilevel model of the European entry-exit gas market with market power	4
On e-monotonicity and maximality of operators in Banach spaces	4
Extragradient-type methods with $$\mathcal {O}\left( 1/k\right) $$ last-iterate convergence rates for co-hypomonotone inclusions	4
Tropical gradient descent	4
Optimal Piecewise Linear Approximations for Sigmoid, Tanh, Probability Density and Cumulative Distribution Functions: Tabular Form and R Package pwlapprox2d	4
Gaussian Process regression over discrete probability measures: on the non-stationarity relation between Euclidean and Wasserstein Squared Exponential Kernels	4
Exchange rates and multicommodity international trade: insights from spatial price equilibrium modeling with policy instruments via variational inequalities	4
Relaxed method for optimization problems with cardinality constraints	4
A facial reduction approach for the single source localization problem	4
Aubin property for solution set in multi-objective programming	4
Quasi-Newton type proximal gradient method for nonconvex nonsmooth composite optimization problems	4
Stochastic ADMM with variance-reduced recursive momentum and its accelerated variant for nonconvex nonsmooth optimization	4