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 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

Volume 92, issue 4, 2025

MUSE-BB: a decomposition algorithm for nonconvex two-stage problems using strong multisection branching pp. 837-888

Marco Langiu, Manuel Dahmen, Dominik Bongartz and Alexander Mitsos

Addressing mixed constraints: an improved framework for black-box optimization pp. 889-908

Raju Chowdhury and Neelesh S. Upadhye

Computing local minimizers in polynomial optimization under genericity conditions pp. 909-932

Vu Trung Hieu and Akiko Takeda

Weak sharp minima at infinity and solution stability in mathematical programming via asymptotic analysis pp. 933-950

Felipe Lara, Nguyen Van Tuyen and Tran Van Nghi

Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges pp. 951-972

Xiao Li, Xiucui Guan, Junhua Jia and Panos M. Pardalos

An exact approach for the Stackelberg knapsack problem with weight selection pp. 973-991

Yeonghun Lee, Kiho Seo, Seulgi Joung and Sungsoo Park

Covering constants for metric projection operator with applications to stochastic fixed-point problems pp. 993-1020

Jinlu Li

Existence and stability for a class of variational–hemivariational inequalities involving multivalued Brezis pseudomonotone operators pp. 1021-1043

Shengda Zeng, Xi Chen, Jinxia Cen and Patrick Winkert

Properties of a generalized oriented distance function and applications to set optimization with a variable structure pp. 1045-1070

Wenqing Wang and Yihong Xu

An extragradient algorithm for a lifted reformulation of projected solutions for quasiequilibria pp. 1071-1090

Giancarlo Bigi, Marco Castellani and Sara Latini

Volume 92, issue 3, 2025

Distributionally Robust Optimization with Polynomial Robust Constraints pp. 509-534

Jiawang Nie and Suhan Zhong

Convexifiable quadratic inequality systems: new minimax S-lemma and exact SOCPs for classes of distributionally robust optimization problems pp. 535-568

Q. Y. Huang, V. Jeyakumar, G. Li and D. T. K. Huyen

Inexact bilevel stochastic gradient methods for constrained and unconstrained lower-level problems pp. 569-614

T. Giovannelli, G. D. Kent and L. N. Vicente

Out-of-sample estimation for a branch-and-bound algorithm with growing datasets pp. 615-642

Susanne Sass, Alexander Mitsos, Nikolay I. Nikolov and Angelos Tsoukalas

Infinite-dimensional convex cones: internal geometric structure and analytical representation pp. 643-662

Valentin V. Gorokhovik

Parallel inexact Levenberg–Marquardt method for nearly-separable nonlinear least squares pp. 663-691

Lidija Fodor, Dušan Jakovetić, Nataša Krejić and Greta Malaspina

Quasi-Newton type proximal gradient method for nonconvex nonsmooth composite optimization problems pp. 693-711

Tanxing Wang, Yaning Jiang and Xingju Cai

On the convergence result of the gradient-push algorithm on directed graphs with constant stepsize pp. 713-736

Woocheol Choi, Doheon Kim and Seok-Bae Yun

A dual adaptive algorithm for matrix optimization with sparse group lasso regularization pp. 737-774

Jinji Yang, Jiang Hu and Chungen Shen

Computing one-bit compressive sensing via zero-norm regularized DC loss model and its surrogate pp. 775-807

Kai Chen, Ling Liang and Shaohua Pan

A strategy to tighten the relaxation of bilinear terms towards petrochemical scheduling problem pp. 809-835

Lifeng Zhang, Congqin Ge, Yanfeng Zhang, Wenhui Yang, Bingzhen Chen and Zhihong Yuan

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