Journal of Global Optimization

2004 - 2026

Current editor(s): Sergiy Butenko

From Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 94, issue 4, 2026

Relaxations of KKT conditions do not strengthen finite RLT and SDP-RLT bounds for nonconvex quadratic programs pp. 891-918

E. Alper Yıldırım

A Relax-Fix-and-Exclude algorithm for an MINLP problem with multilinear interpolations pp. 919-949

Bruno M. Pacheco, Pedro M. Antunes, Eduardo Camponogara, Laio O. Seman, Vinícius R. Rosa, Bruno F. Vieira and Cesar Longhi

Parabolic approximation & relaxation for MINLP pp. 951-996

Adrian Göss, Robert Burlacu and Alexander Martin

Characterizations of Strongly Quasiconvex Functions pp. 997-1003

Nicolas Hadjisavvas and Felipe Lara

Stochastic ADMM with variance-reduced recursive momentum and its accelerated variant for nonconvex nonsmooth optimization pp. 1005-1051

Feiyu Long, Congying Han, Tiande Guo and Shichen Liao

Quasi-Newton method with subspace gradients pp. 1053-1080

Taisei Miyaishi, Ryota Nozawa, Pierre-Louis Poirion and Akiko Takeda

A new relaxed projection method for solving the split feasibility problem with multiple output sets pp. 1081-1097

Wanrong Zhan, Hai Yu and Fenghui Wang

Aggregation of bilinear bipartite equality constraints and its application to structural model updating problem pp. 1099-1135

Santanu S. Dey, Dahye Han and Yang Wang

Outer approximation scheme for weakly convex constrained optimization problems pp. 1137-1166

Ewa M. Bednarczuk, Giovanni Bruccola, Jean-Christophe Pesquet and Krzysztof Rutkowski

Volume 94, issue 3, 2026

Data-driven Lipschitz-informed convex underestimators for branch-and-bound optimization of black-box functions pp. 593-634

Suryateja Ravutla and Fani Boukouvala

An efficient global optimization algorithm with adaptive estimates of the local Lipschitz constants pp. 635-666

Danny D’Agostino

Quadratic convex reformulations for multiObjective binary quadratic programming pp. 667-698

Marianna De Santis, Lucas Létocart and Yue Zhang

SPLD polynomial optimization and bounded degree SOS hierarchies pp. 699-728

Liguo Jiao, Jae Hyoung Lee and Nguyen Bui Nguyen Thao

An optimization approach for transformed low tubal rank of third-order tensors pp. 729-753

Jinjie Liu, Chen Ling, Erbo Zhao and Xinmin Yang

A Bregman ADMM for Robust Fused Lasso Estimation with Doubly Nonconvex Regularizers pp. 755-782

Yibao Fan, Zheng-Fen Jin, Youlin Shang and Deren Han

A randomized algorithm for model-based sparse signal recovery pp. 783-807

Huiyuan Yu, Maggie Cheng and Yingdong Lu

Sparse Projection onto Semi-Symmetric Sets with Applications to Sparse Optimization pp. 809-844

Jinglai Shen and Saeed Damadi

On relation between bilevel programming problems and variational inequalities on hadamard manifolds with application to toll optimization problem pp. 845-872

B. B. Upadhyay, I. M. Stancu-Minasian, Priyanka Mishra and Subham Poddar

An effective branch and bound algorithm for generalized risk parity portfolio optimization pp. 873-890

Jing Zhou, Lei Zhang and Wenxun Xing

Volume 94, issue 2, 2026

Preface to the special issue on the $$8^\textrm{th}$$ 8 th world congress on global optimization pp. 309-310

Panos M. Pardalos

A bi-level programming problem of medicine procurement and production optimization pp. 311-345

Wenjuan Fan, Jingwei Zhang, Kaining Shao, Shaowen Lan and Shuwan Zhu

The limitation of neural nets for approximation and optimization pp. 347-376

T. Giovannelli, O. Sohab and L. N. Vicente

Parallel machine scheduling with position-dependent processing times and deteriorating maintenance activities pp. 377-397

Chaoming Hu, Rui Zheng, Shaojun Lu and Xinbao Liu

Using quadratic cuts to iteratively strengthen convexifications of box quadratic programs pp. 399-425

Amélie Lambert and Daniel Porumbel

Hybrid decomposition and deep learning approach for data-driven FOREX forecasting optimization pp. 427-457

Michail G. Papatsimpas and Konstantinos E. Parsopoulos

Non-convex optimization problems with linear KKT subsystem pp. 459-480

Mujahid N. Syed

A QoS and sustainability-driven two-stage service composition method in cloud manufacturing: combining clustering and bi-objective optimization pp. 481-516

Chunhua Tang, Shuangyao Zhao, Han Su and Binbin Chen

Combining gradient information and primitive directions for high-performance Bound-Constrained mixed-integer optimization pp. 517-538

Matteo Lapucci, Giampaolo Liuzzi, Stefano Lucidi and Pierluigi Mansueto

Convergence rate of alternating projection method for the intersection of an affine subspace and the second-order cone pp. 539-567

Hiroyuki Ochiai, Yoshiyuki Sekiguchi and Hayato Waki

Optimality conditions and solution analysis at infinity for nonsmooth optimization problems pp. 569-591

Nguyen Canh Hung and Nguyen Le Hoang Anh

Volume 94, issue 1, 2026

Preface pp. 1-2

Eligius M. T. Hendrix

A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions pp. 3-34

Tanmaya Karmarkar and Yves Lucet

Norm-induced cuts: outer approximation for Lipschitzian constraint functions pp. 35-63

Adrian Göß, Alexander Martin, Sebastian Pokutta and Kartikey Sharma

A kinematic smoothing method for tightening convex relaxations of ordinary differential equations pp. 65-93

Huiyi Cao and Kamil A. Khan

Column generation for multistage stochastic mixed-integer nonlinear programs with discrete state variables pp. 95-126

Tushar Rathi, Benjamin P. Riley, Angela Flores-Quiroz and Qi Zhang

Distributionally robust fractional optimization of probability of exceedance pp. 127-174

M. A. Lejeune and H. N. Nguyen

Voronoi candidates for Bayesian optimization pp. 175-201

Nathan Wycoff, John W. Smith, Annie S. Booth and Robert B. Gramacy

A Diagonal Quasi-Newton Method with Modified BFGS Update for Nonconvex Multiobjective Optimization pp. 203-233

Qingjie Hu, Yanyan Zhang, Ruyun Li and Wanyou Cheng

Error bounds, PL condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods pp. 235-263

Feng-Yi Liao, Lijun Ding and Yang Zheng

Monotone submodular maximization under the pairwise capacity constraint pp. 265-289

Yuanyuan Qiang, Bin Liu and Weili Wu

Equilibrium problems: existence criteria and applications pp. 291-308

Mircea Balaj

Volume 93, issue 4, 2025

Constructing Tight Quadratic Relaxations for Global Optimization: I. Outer-Approximating Twice-Differentiable Convex Functions pp. 923-952

William R. Strahl, Arvind U. Raghunathan, Nikolaos V. Sahinidis and Chrysanthos E. Gounaris

Constructing tight quadratic relaxations for global optimization: II. underestimating difference-of-convex (D.C.) functions pp. 953-987

William R. Strahl, Arvind U. Raghunathan, Nikolaos V. Sahinidis and Chrysanthos E. Gounaris

A surrogate-based adaptive sampling approach for mixed-integer black-box optimization problems pp. 989-1026

Emmanouil Karantoumanis and Nikolaos Ploskas

On existence of solutions to nonconvex minimization problems pp. 1027-1051

Rohan Rele and Angelia Nedić

Weak and strong convergence theorems for the mixed split feasibility problem in Hilbert spaces pp. 1053-1077

Nguyen Song Ha

Nonlinear separation theorems for co-radiant sets and optimality conditions for approximate and proper approximate solutions in vector optimization pp. 1079-1095

Fernando García-Castaño and Miguel Ángel Melguizo-Padial

Absolute value linear programming pp. 1097-1120

Milan Hladík and David Hartman

Rank-sparsity decomposition for planted quasi clique recovery pp. 1121-1144

Sakirudeen A. Abdulsalaam and Montaz Ali

Minimum flow decomposition in graphs with cycles using integer linear programming pp. 1145-1176

Fernando H. C. Dias, Lucia Williams, Brendan Mumey and Alexandru I. Tomescu

Volume 93, issue 3, 2025

Global optimization algorithm for mixed-integer nonlinear programs with trigonometric functions pp. 605-650

Christopher Montez, Sujeevraja Sanjeevi and Kaarthik Sundar

Exact continuous relaxations of $$\ell _0$$ ℓ 0 -regularized criteria with non-quadratic data terms pp. 651-699

Mhamed Essafri, Luca Calatroni and Emmanuel Soubies

Sparse sub-gaussian random projections for semidefinite programming relaxations pp. 701-731

Monse Guedes-Ayala, Pierre-Louis Poirion, Lars Schewe and Akiko Takeda

Covering a rectangle with 6 circles: a reliable mathematical programming approach pp. 733-745

Sonia Cafieri and Frédéric Messine

Optimality and solutions for conic robust multiobjective programs pp. 747-776

Thai Doan Chuong, Xinghuo Yu, Andrew Eberhard, Chaojie Li and Chen Liu

Characterization of set order relations and set optimization problems via conic scalarization pp. 777-801

Madhusudan Das, Debdas Ghosh, Jen-Chih Yao and Xiaopeng Zhao

Practical proximal primal-dual algorithms for structured saddle point problems pp. 803-831

Yunfei Qu, Hongjin He, Tao Zhang and Deren Han

Kurdyka-Łojasiewicz inequality and error bounds of D-Gap functions for nonsmooth and nonmonotone variational inequality problems pp. 833-860

M. H. Li, K. W. Meng and X. Q. Yang

Globally optimal strategy against the Hedge algorithm in repeated games pp. 861-895

Xinxiang Guo and Yifen Mu

New calculus rules of relative subdifferentials and applications to constrained optimization problems pp. 897-922

Cao Thanh Tinh, Xiaolong Qin, Thai Doan Chuong and Vo Duc Thinh

Volume 93, issue 2, 2025

Global solution algorithms for DC programming via polyhedral approximations of convex functions pp. 335-357

Fahaar M. Pirani and Firdevs Ulus

Convergence analysis of primal-dual augmented Lagrangian methods and duality theory pp. 359-411

M.V. Dolgopolik

Tropical gradient descent pp. 413-449

Roan Talbut and Anthea Monod

POINT-BASED SUFFICIENT CONDITIONS FOR SHARP SOLUTIONS IN NONSMOOTH OPTIMIZATION pp. 451-470

Marius Durea, Elena-Andreea Florea and Radu Strugariu

Optimality conditions for zero-one composite optimization problems pp. 471-487

Guo-Ping Li, Jia-Li Feng, Chao Kan and Wen Song

A multi-step inertial extragradient algorithm for nonsmooth and nonconvex composite optimization problems pp. 489-521

Zhixue Wang and Hongjin He

Solving a generalization of the p-regularized subproblems by matrix simultaneous diagonalization via congruence pp. 523-534

Nguyen Van-Bong

The projected-type method for the extended vertical linear complementarity problem revisited pp. 535-550

Cui-Xia Li and Shi-Liang Wu

Revisiting Nesterov’s acceleration via high-resolution differential equations pp. 551-569

Shuo Chen, Bin Shi and Ya-xiang Yuan

Publisher Correction: On a tractable single-level reformulation of a multilevel model of the European entry-exit gas market with market power pp. 571-603

Veronika Grimm, Julia Grübel, Martin Schmidt, Alexandra Schwartz, Ann-Kathrin Wiertz and Gregor Zöttl

Volume 93, issue 1, 2025

Mixed-Integer Bilevel Optimization with Nonconvex Quadratic Lower-Level Problems: Complexity and a Solution Method pp. 1-25

Immanuel Bomze, Andreas Horländer and Martin Schmidt

Discretization algorithms for generalized semi-infinite programs with coupling equality constraints under local solution stability pp. 27-61

Aron Zingler, Adrian W. Lipow and Alexander Mitsos

On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem pp. 63-85

Soodeh Habibi, Michal Kočvara and Michael Stingl

A new branch-and-bound algorithm for generalized affine multiplicative programming pp. 87-112

Yaping Deng and Peiping Shen

A theoretical and empirical study of new adaptive algorithms with additional momentum steps and shifted updates for stochastic non-convex optimization pp. 113-173

Cristian Daniel Alecsa

Scenario consensus algorithms for solving stochastic and dynamic problems pp. 175-213

Felipe Lagos

Optimal transport-based distributionally robust optimization with polynomial uncertainty pp. 215-240

Bo Rao, Liu Yang and Jingmin Cai

A first-order regularized algorithm with complexity properties for the unconstrained and the convexly constrained low order-value optimization problem pp. 241-261

G. Q. Álvarez, E. G. Birgin and J. M. Martínez

Solution methods for partial inverse combinatorial optimization problems in which weights can only be increased pp. 263-298

Eva Ley and Maximilian Merkert

A survey of exact and approximation algorithms for linear-parametric optimization problems pp. 299-333

Levin Nemesch, Stefan Ruzika, Clemens Thielen and Alina Wittmann