Journal of Global Optimization

2004 - 2025

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 92, issue 2, 2025

Gaussian Process regression over discrete probability measures: on the non-stationarity relation between Euclidean and Wasserstein Squared Exponential Kernels pp. 253-278

Antonio Candelieri, Andrea Ponti and Francesco Archetti

Quasiconjugate duality and optimality conditions for quasiconvex optimization pp. 279-293

Satoshi Suzuki

Extending interval branch-and-bound from two to few objectives in nonlinear multiobjective optimization pp. 295-320

Ignacio Araya, Victor Reyes and Javier Montero

Rank-one matrix completion via high-rank matrices in sum-of-squares relaxations pp. 321-343

Godai Azuma, Sunyoung Kim and Makoto Yamashita

Partial augmented Lagrangian method for non-Lipschitz mathematical programs with complementarity constraints pp. 345-379

Gao-Xi Li, Xin-Min Yang and Xian-Jun Long

Global convergence of block Bregman proximal iteratively reweighted algorithm with extrapolation pp. 381-410

Jie Zhang and Xinmin Yang

Stability analysis of split equality and split feasibility problems pp. 411-429

Vu Thi Huong, Hong-Kun Xu and Nguyen Dong Yen

Extended vertical tensor complementarity problems with finite solution sets pp. 431-452

Xue-liu Li, Yi-rong Jiang, Yuning Yang and Guo-ji Tang

Revisiting non-monotone regularized submodular maximization: bi-criteria and PASS approximations pp. 453-481

Cheng Lu

An exact algorithm for disaster-resilience augmentation of planar straight-line graphs pp. 483-508

Alexander Westcott and Charl Ras

Volume 92, issue 1, 2025

Simultaneous convexification for the planar obnoxious facility location problem pp. 1-20

Anatoliy Kuznetsov and Nikolaos V. Sahinidis

Tightening state relaxations for global dynamic optimization using dynamic cuts pp. 21-54

Jason Ye and Joseph K. Scott

Limited memory bundle DC algorithm for sparse pairwise kernel learning pp. 55-85

Napsu Karmitsa, Kaisa Joki, Antti Airola and Tapio Pahikkala

Bundle trust region algorithm based on linear subproblem pp. 87-109

Najmeh Hoseini Monjezi

Solution existence for a class of nonsmooth robust optimization problems pp. 111-133

Nguyen Canh Hung, Thai Doan Chuong and Nguyen Hoang Anh

Characterisation of zero duality gap for optimization problems in spaces without linear structure pp. 135-158

Ewa Bednarczuk and Monika Syga

Using dual relaxations in multiobjective mixed-integer convex quadratic programming pp. 159-186

Marianna Santis, Gabriele Eichfelder, Daniele Patria and Leo Warnow

A refined proximal algorithm for nonconvex multiobjective optimization in Hilbert spaces pp. 187-203

G. C. Bento, J. X. Cruz Neto, J. O. Lopes, B. S. Mordukhovich and P. R. Silva Filho

Support vector machines with the hard-margin loss: optimal training via combinatorial Benders’ cuts pp. 205-225

Ítalo Santana, Breno Serrano, Maximilian Schiffer and Thibaut Vidal

Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles pp. 227-251

Carlos Alegría, Justin Dallant, Pablo Pérez-Lantero and Carlos Seara

Volume 91, issue 4, 2025

On the convergence order of value function relaxations used in decomposition-based global optimization of nonconvex stochastic programs pp. 701-742

Dillard Robertson, Pengfei Cheng and Joseph K. Scott

Conic relaxations for conic minimax convex polynomial programs with extensions and applications pp. 743-763

Thai Doan Chuong and José Vicente-Pérez

Applying augmented weak subdifferentials and normal cones for nonconvex mathematical programming problems pp. 765-786

Tran Van Su and Chu Van Tiep

Approximations of unbounded convex projections and unbounded convex sets pp. 787-805

Gabriela Kováčová and Birgit Rudloff

Maximizing the smallest eigenvalue of grounded Laplacian matrix pp. 807-828

Xiaotian Zhou, Run Wang, Wei Li and Zhongzhi Zhang

Stochastic golden ratio algorithm to non-convex stochastic mixed variational inequality problem pp. 829-850

Shenghua Wang, Ziqi Zhu and Lanxiang Yu

System architecture optimization strategies: dealing with expensive hierarchical problems pp. 851-895

Jasper H. Bussemaker, Paul Saves, Nathalie Bartoli, Thierry Lefebvre and Rémi Lafage

Constrained optimization in simulation: efficient global optimization and Karush-Kuhn-Tucker conditions pp. 897-922

Jack P. C. Kleijnen, Ebru Angün, Inneke Nieuwenhuyse and Wim C. M. Beers

Stochastic red-blue set covering: a decomposition approach pp. 923-951

David Islip and Roy H. Kwon

On a tractable single-level reformulation of a multilevel model of the European entry-exit gas market with market power pp. 953-985

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

Volume 91, issue 3, 2025

Hybridizing two linear relaxation techniques in interval-based solvers pp. 437-456

Ignacio Araya, Frédéric Messine, Jordan Ninin and Gilles Trombettoni

A branch-and-bound algorithm for parametric mixed-binary nonlinear programs pp. 457-481

Andrew C. Pangia and Margaret M. Wiecek

Complexity of linearized quadratic penalty for optimization with nonlinear equality constraints pp. 483-510

Lahcen El Bourkhissi and Ion Necoara

Iterative mix thresholding algorithm with continuation technique for mix sparse optimization and application pp. 511-534

Yaohua Hu, Jian Lu, Xiaoqi Yang and Kai Zhang

On generalized KKT points for the Motzkin–Straus program pp. 535-557

Guglielmo Beretta, Alessandro Torcinovich and Marcello Pelillo

A new modified Halpern-type splitting algorithm for solving monotone inclusion problems in reflexive Banach spaces pp. 559-585

Lulu Chen, Gang Cai, Prasit Cholamjiak and Papatsara Inkrong

New iterative algorithms for solving split variational inclusions pp. 587-609

Soumitra Dey, Chinedu Izuchukwu, Adeolu Taiwo and Simeon Reich

Inexact proximal methods for weakly convex functions pp. 611-646

Pham Duy Khanh, Boris S. Mordukhovich, Vo Thanh Phat and Dat Ba Tran

Adaptive nested Monte Carlo approach for multi-objective efficient global optimization pp. 647-676

Shengguan Xu, Jianfeng Tan, Jiale Zhang, Hongquan Chen and Yisheng Gao

Convergence of solutions to set optimization problems with variable ordering structures pp. 677-699

L. Q. Anh and D. V. Hien

Volume 91, issue 2, 2025

Preface pp. 255-256

Tibor Csendes, Boglárka G.-Tóth and Tamás Vinkó

A revised monotonicity-based method for computing tight image enclosures of functions pp. 257-286

Ignacio Araya and Victor Reyes

Global optimization of mixed-integer nonlinear programs with SCIP 8 pp. 287-310

Ksenia Bestuzheva, Antonia Chmiela, Benjamin Müller, Felipe Serrano, Stefan Vigerske and Fabian Wegscheider

Local search versus linear programming to detect monotonicity in simplicial branch and bound pp. 311-330

L. G. Casado, B. G.-Tóth, E. M. T. Hendrix and F. Messine

Global solution of quadratic problems using interval methods and convex relaxations pp. 331-353

Sourour Elloumi, Amélie Lambert, Bertrand Neveu and Gilles Trombettoni

Node selection through upper bounding local search methods in branch & bound solvers for NCOPs pp. 355-369

Victor Reyes and Ignacio Araya

On polling directions for randomized direct-search approaches: application to beam angle optimization in intensity-modulated proton therapy pp. 371-392

H. Rocha and J. Dias

Heteroscedastic Bayesian optimization using generalized product of experts pp. 393-413

Saulius Tautvaišas and Julius Žilinskas

On the use of overlapping convex hull relaxations to solve nonconvex MINLPs pp. 415-436

Ouyang Wu, Pavlo Muts, Ivo Nowak and Eligius M. T. Hendrix

Volume 91, issue 1, 2025

Global optimization: a machine learning approach pp. 1-37

Dimitris Bertsimas and Georgios Margaritis

Smoothing penalty approach for solving second-order cone complementarity problems pp. 39-58

Chieu Thanh Nguyen, Jan Harold Alcantara, Zijun Hao and Jein-Shan Chen

Stochastic decomposition for risk-averse two-stage stochastic linear programs pp. 59-93

Prasad Parab, Lewis Ntaimo and Bernardo Pagnoncelli

Nested benders decomposition for a deterministic biomass feedstock logistics problem pp. 95-127

Sanchit Singh, Subhash C. Sarin and Sandeep Singh Sangha

Solving a class of two-stage stochastic nonlinear integer programs using value functions pp. 129-153

Junlong Zhang, Osman Y. Özaltın and Andrew C. Trapp

On e-monotonicity and maximality of operators in Banach spaces pp. 155-170

M. H. Alizadeh, M. Bianchi and R. Pini

Pointwise expected hypervolume improvement for expensive multi-objective optimization pp. 171-197

Li Mei and Zhan Dawei

Existence of weak efficient solutions of set-valued optimization problems pp. 199-215

Fatemeh Fakhar, Hamid Reza Hajisharifi and Zeinab Soltani

Unboundedness of the images of set-valued mappings having closed graphs: application to vector optimization pp. 217-234

V. T. Hieu, E. A. S. Köbis, M. A. Köbis and P. H. Schmölling

Inexact primal-dual active set iteration for optimal distribution control of stationary heat or cold source pp. 235-253

Mengdi Hu, Haiming Song, Jiageng Wu and Jinda Yang