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 90, issue 4, 2024

Robust bilevel optimization for near-optimal lower-level solutions pp. 813-842

Mathieu Besançon, Miguel F. Anjos and Luce Brotcorne

On convergence of a q-random coordinate constrained algorithm for non-convex problems pp. 843-868

A. Ghaffari-Hadigheh, L. Sinjorgo and R. Sotirov

Novel algorithms based on forward-backward splitting technique: effective methods for regression and classification pp. 869-890

Yunus Atalan, Emirhan Hacıoğlu, Müzeyyen Ertürk, Faik Gürsoy and Gradimir V. Milovanović

Strong convergence of the composition of firmly nonexpansive mappings pp. 891-907

José Márcio Machado Brito, João Xavier Cruz Neto and Ítalo Dowell Lira Melo

Relaxed projection methods for solving variational inequality problems pp. 909-930

Pham Ngoc Anh

A reformulation-enumeration MINLP algorithm for gas network design pp. 931-963

Yijiang Li, Santanu S. Dey and Nikolaos V. Sahinidis

Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem pp. 965-982

Pengxiang Pan, Junran Lichen and Jianping Li

Improved approximation algorithms for the k-path partition problem pp. 983-1006

Shiming Li, Wei Yu and Zhaohui Liu

Budget-constrained profit maximization without non-negative objective assumption in social networks pp. 1007-1030

Suning Gong, Qingqin Nong, Yue Wang and Dingzhu Du

Aircraft conflict resolution with trajectory recovery using mixed-integer programming pp. 1031-1067

Fernando Dias and David Rey

Volume 90, issue 3, 2024

A method based on parametric convex programming for solving convex multiplicative programming problem pp. 573-592

Yunchol Jong, Yongjin Kim and Hyonchol Kim

Stochastic optimization problems with nonlinear dependence on a probability measure via the Wasserstein metric pp. 593-617

Vlasta Kaňková

Online non-monotone diminishing return submodular maximization in the bandit setting pp. 619-649

Jiachen Ju, Xiao Wang and Dachuan Xu

Optimality analysis for $$\epsilon $$ ϵ -quasi solutions of optimization problems via $$\epsilon $$ ϵ -upper convexificators: a dual approach pp. 651-669

Tran Su

Packing spheres with quasi-containment conditions pp. 671-689

Andreas Fischer, Igor Litvinchev, Tetyana Romanova, Petro Stetsyuk and Georgiy Yaskov

Curvature-constrained Steiner networks with three terminals pp. 691-710

Peter A. Grossman, David Kirszenblat, Marcus Brazil, J. Hyam Rubinstein and Doreen A. Thomas

Modified general splitting method for the split feasibility problem pp. 711-726

Seakweng Vong and Zhongsheng Yao

A generalized alternating direction implicit method for consensus optimization: application to distributed sparse logistic regression pp. 727-753

Weiyang Ding, Michael K. Ng and Wenxing Zhang

A Two-Step Proximal Point Algorithm for Nonconvex Equilibrium Problems with Applications to Fractional Programming pp. 755-779

Alfredo Iusem, Felipe Lara, Raúl T. Marcavillaca and Le Hai Yen

Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling pp. 781-811

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

Volume 90, issue 2, 2024

On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints pp. 293-322

Yuzhou Qiu and E. Alper Yıldırım

Tighter bound estimation for efficient biquadratic optimization over unit spheres pp. 323-353

Shigui Li, Linzhang Lu, Xing Qiu, Zhen Chen and Delu Zeng

Dual optimality conditions for the difference of extended real valued increasing co-radiant functions pp. 355-371

Mohammad Hossein Daryaei and Hossein Mohebi

Optimization in complex spaces with the mixed Newton method pp. 373-399

Sergei Bakhurin, Roland Hildebrand, Mohammad Alkousa, Alexander Titov and Nikita Yudin

A Bayesian approach to data-driven multi-stage stochastic optimization pp. 401-428

Zhiping Chen and Wentao Ma

Deep learning the efficient frontier of convex vector optimization problems pp. 429-458

Zachary Feinstein and Birgit Rudloff

A surrogate-assisted a priori multiobjective evolutionary algorithm for constrained multiobjective optimization problems pp. 459-485

Pouya Aghaei Pour, Jussi Hakanen and Kaisa Miettinen

A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines pp. 487-514

Yuping Cui and Guolei Zheng

The edge labeling of higher order Voronoi diagrams pp. 515-549

Mercè Claverol, Andrea de las Heras Parrilla, Clemens Huemer and Alejandra Martínez-Moraian

Rectilinear convex hull of points in 3D and applications pp. 551-571

Pablo Pérez-Lantero, Carlos Seara and Jorge Urrutia

Volume 90, issue 1, 2024

Gradient projection method on the sphere, complementarity problems and copositivity pp. 1-25

Orizon Pereira Ferreira, Yingchao Gao, Sándor Zoltán Németh and Petra Renáta Rigó

Relaxations and cutting planes for linear programs with complementarity constraints pp. 27-51

Alberto Pia, Jeff Linderoth and Haoran Zhu

Optimality conditions and sensitivity analysis in parametric nonconvex minimax programming pp. 53-72

D. T. V. An, N. H. Hung, D. T. Ngoan and N. V. Tuyen

An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms pp. 73-92

Jiefei He, Huiling Zhang and Zi Xu

Subspace Newton method for sparse group $$\ell _0$$ ℓ 0 optimization problem pp. 93-125

Shichen Liao, Congying Han, Tiande Guo and Bonan Li

A new optimization approach to solving split equality problems in Hilbert spaces pp. 127-151

Simeon Reich, Truong Minh Tuyen and Nguyen Song Ha

Distributed accelerated gradient methods with restart under quadratic growth condition pp. 153-215

Chhavi Sharma, Vishnu Narayanan and P. Balamurugan

Characteristic sets and characteristic numbers of matrix two-person games pp. 217-241

D. T. K. Huyen, J.-C. Yao and N. D. Yen

Almost optimal manipulation of pairwise comparisons of alternatives pp. 243-259

Jacek Szybowski, Konrad Kułakowski and Sebastian Ernst

Social equity in international environmental agreements pp. 261-291

Chiara Donnini and Armando Sacco

Volume 89, issue 4, 2024

Modification and improved implementation of the RPD method for computing state relaxations for global dynamic optimization pp. 833-861

Jason Ye and Joseph K. Scott

A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problems pp. 863-897

Hongwei Liu, Ting Wang and Zexian Liu

A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization pp. 899-926

Jianghua Yin, Chunming Tang, Jinbao Jian and Qiongxuan Huang

An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints pp. 927-948

Le Thi Khanh Hien and Dimitri Papadimitriou

Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds pp. 949-974

Zhou Sheng and Gonglin Yuan

Computing the recession cone of a convex upper image via convex projection pp. 975-994

Gabriela Kováčová and Firdevs Ulus

Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering pp. 995-1032

Maolin Che, Yimin Wei and Hong Yan

Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems pp. 1033-1067

Dmitry Gribanov, Ivan Shumilov, Dmitry Malyshev and Nikolai Zolotykh

Simple proximal-type algorithms for equilibrium problems pp. 1069-1098

Yonghong Yao, Abubakar Adamu, Yekini Shehu and Jen-Chih Yao

Nonlinear scalarization in set optimization based on the concept of null set pp. 1099-1119

Anveksha Moar, Pradeep Kumar Sharma and C. S. Lalitha

Volume 89, issue 3, 2024

The appeals of quadratic majorization–minimization pp. 509-558

Marc C. Robini, Lihui Wang and Yuemin Zhu

A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization pp. 559-595

Abbas Khademi, Ahmadreza Marandi and Majid Soleimani-damaneh

A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems pp. 597-632

Hongwei Jiao, Binbin Li and Wenqiang Yang

A method for searching for a globally optimal k-partition of higher-dimensional datasets pp. 633-653

Kristian Sabo, Rudolf Scitovski, Šime Ungar and Zoran Tomljanović

A K-means Supported Reinforcement Learning Framework to Multi-dimensional Knapsack pp. 655-685

Sabah Bushaj and İ. Esra Büyüktahtakın

Regret analysis of an online majorized semi-proximal ADMM for online composite optimization pp. 687-722

Zehao Xiao and Liwei Zhang

Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds pp. 723-744

Balendu Bhooshan Upadhyay, Arnav Ghosh and Savin Treanţă

Consensus-based optimization for multi-objective problems: a multi-swarm approach pp. 745-776

Kathrin Klamroth, Michael Stiglmayr and Claudia Totzeck

Fast deterministic algorithms for non-submodular maximization with strong performance guarantees pp. 777-801

Cheng Lu and Wenguo Yang

A performance analysis of Basin hopping compared to established metaheuristics for global optimization pp. 803-832

Marco Baioletti, Valentino Santucci and Marco Tomassini

Volume 89, issue 2, 2024

The exact projective penalty method for constrained optimization pp. 259-276

Vladimir Norkin

Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem pp. 277-302

Jing-jing Wang, Li-ping Tang and Xin-min Yang

First- and second-order optimality conditions of nonsmooth sparsity multiobjective optimization via variational analysis pp. 303-325

Jiawei Chen, Huasheng Su, Xiaoqing Ou and Yibing Lv

A Bregman inertial forward-reflected-backward method for nonconvex minimization pp. 327-354

Xianfu Wang and Ziyuan Wang

Generalized derivatives of optimal-value functions with parameterized convex programs embedded pp. 355-378

Yingkai Song and Paul I. Barton

Gaining or losing perspective for convex multivariate functions on a simplex pp. 379-413

Luze Xu and Jon Lee

Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots pp. 415-434

Daniela Lera, Maria Chiara Nasso, Mikhail Posypkin and Yaroslav D. Sergeyev

Single-lot, lot-streaming problem for a 1 + m hybrid flow shop pp. 435-455

Sanchit Singh, Subhash C. Sarin and Ming Cheng

Interval constraint programming for globally solving catalog-based categorical optimization pp. 457-476

Charlie Vanaret

A strong P-formulation for global optimization of industrial water-using and treatment networks pp. 477-507

Xin Cheng and Xiang Li

Volume 89, issue 1, 2024

On asymptotic convergence rate of random search pp. 1-31

Dawid Tarłowski

A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis pp. 33-55

Eyal Cohen, D. Russell Luke, Titus Pinta, Shoham Sabach and Marc Teboulle

Strict feasibility for the polynomial complementarity problem pp. 57-71

Xue-liu Li and Guo-ji Tang

Existence of solutions to $$\Gamma $$ Γ -robust counterparts of gap function formulations of uncertain LCPs with ellipsoidal uncertainty sets pp. 73-92

Lulin Tan, Wei Hong Yang and Jinbiao Pan

A surrogate-assisted evolutionary algorithm with clustering-based sampling for high-dimensional expensive blackbox optimization pp. 93-115

Fusheng Bai, Dongchi Zou and Yutao Wei

Discrete approximation for two-stage stochastic variational inequalities pp. 117-142

Jie Jiang and Hailin Sun

Variable sample-size optimistic mirror descent algorithm for stochastic mixed variational inequalities pp. 143-170

Zhen-Ping Yang, Yong Zhao and Gui-Hua Lin

On inexact versions of a quasi-equilibrium problem: a Cournot duopoly perspective pp. 171-196

E. L. Dias Júnior, P. J. S. Santos, Antoine Soubeyran and J. C. O. Souza

Extragradient-type methods with $$\mathcal {O}\left( 1/k\right) $$ O 1 / k last-iterate convergence rates for co-hypomonotone inclusions pp. 197-221

Quoc Tran-Dinh

Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies pp. 223-257

Dominique Barth, Thierry Mautor, Dimitri Watel and Marc-Antoine Weisser