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 95, issue 2, 2026

Computing two-stage robust optimization with mixed integer structures pp. 261-302

Wei Wang and Bo Zeng

Robust chance-constrained optimization with discrete distributions pp. 303-330

Daniela Bernhard, Frauke Liers and Michael Stingl

Smoothing methods for mathematical programs with second-order cone complementarity constraints pp. 331-358

Yan-Chao Liang, En-Hui Xia, Gui-Hua Lin and Xide Zhu

Exactness conditions for the dual Lagrangian bound of separable quadratically constrained quadratic programming problems pp. 359-381

S. Ardizzoni, L. Consolini and M. Locatelli

NAUTILI: A trade-off-free interactive multiobjective optimization method for group decision making pp. 383-404

Juuso Pajasmaa, Bhupinder Singh Saini, Babooshka Shavazipour, Francisco Ruiz, Dmitry Podkopaev and Kaisa Miettinen

Accelerated primal-dual methods for linearly constrained convex optimization problems pp. 405-437

Hao Luo

Accelerated gradient methods with strong convergence to the minimum norm minimizer: a dynamic approach combining time scaling, averaging, and Tikhonov regularization pp. 439-463

Hedy Attouch, Zaki Chbani and Hassan Riahi

Inexact subgradient algorithm with a non-asymptotic convergence guarantee for copositive programming problems pp. 465-494

Mitsuhiro Nishijima, Pierre-Louis Poirion and Akiko Takeda

Constrained consensus-based optimization and numerical heuristics for the few particle regime pp. 495-548

Jonas Beddrich, Enis Chenchene, Massimo Fornasier, Hui Huang and Barbara Wohlmuth

Volume 95, issue 1, 2026

Preface: the special issue dedicated to the 100th anniversary of professor Hoàng Tuy pp. 1-3

Hoai An Le Thi and Tao Pham Dinh

DC-programming for neural network optimizations pp. 5-21

Pranjal Awasthi, Anqi Mao, Mehryar Mohri and Yutao Zhong

Global optimization via optimal decision trees pp. 23-63

Dimitris Bertsimas and Berk Öztürk

Continuous formulations for combinatorial optimization problems based on the probabilistic method pp. 65-109

Sergiy Butenko, Miltiades Pardalos and Ashwini Ravindran

A two-phase sequential algorithm for global optimization of the standard quadratic programming problem pp. 111-161

Joaquim Júdice, Valentina Sessa and Masao Fukushima

Stochastic DC algorithms for general stochastic DC programs with machine learning applications pp. 163-192

Hoai An Le Thi, Thì My Le, Huynh Van Ngai and Tao Pham Dinh

DC algorithms in Hilbert spaces and the solution of indefinite infinite-dimensional quadratic programs pp. 193-209

Yongdo Lim, Hoang Ngoc Tuan and Nguyen Dong Yen

An extragradient algorithm for quasiconvex equilibrium problems without monotonicity pp. 211-230

Le Dung Muu and Le Hai Yen

Efficient smooth minorants for global optimization of univariate functions with the first derivative satisfying the interval Lipschitz condition pp. 231-259

Mikhail A. Posypkin and Yaroslav D. Sergeyev

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