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

Volume 88, issue 4, 2024

Separating disconnected quadratic level sets by other quadratic level sets pp. 803-829

Huu-Quang Nguyen, Ya-Chi Chu and Ruey-Lin Sheu

Approximation hierarchies for copositive cone over symmetric cone and their comparison pp. 831-870

Mitsuhiro Nishijima and Kazuhide Nakata

Globalized distributionally robust optimization based on samples pp. 871-900

Yueyao Li and Wenxun Xing

Robust second order cone conditions and duality for multiobjective problems under uncertainty data pp. 901-926

Cao Thanh Tinh and Thai Doan Chuong

Reference-point-based branch and bound algorithm for multiobjective optimization pp. 927-945

Wei-tian Wu and Xin-min Yang

Constrained multiobjective optimization of expensive black-box functions using a heuristic branch-and-bound approach pp. 947-978

Donald R. Jones and Alberto Lovison

Optimality and error bound for set optimization with application to uncertain multi-objective programming pp. 979-998

Wenyan Han and Guolin Yu

Multistage robust optimization for the day-ahead scheduling of hybrid thermal-hydro-wind-solar systems pp. 999-1034

Zhiming Zhong, Neng Fan and Lei Wu

Small polygons with large area pp. 1035-1050

Christian Bingane and Michael J. Mossinghoff

Proximal gradient algorithm with trust region scheme on Riemannian manifold pp. 1051-1076

Shimin Zhao, Tao Yan and Yuanguo Zhu

Volume 88, issue 3, 2024

Preface pp. 531-532

Ilias Kotsireas, Panos Pardalos and Julius Žilinskas

Open issues and recent advances in DC programming and DCA pp. 533-590

Hoai An Le Thi and Tao Pham Dinh

On $$\Delta $$ Δ -modular integer linear problems in the canonical form and equivalent problems pp. 591-651

Dmitry Gribanov, Ivan Shumilov, Dmitry Malyshev and Panos Pardalos

Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem pp. 653-683

Alla Kammerdiner, Alexander Semenov and Eduardo L. Pasiliao

Parallel algorithm portfolios with adaptive resource allocation strategy pp. 685-705

Konstantinos E. Parsopoulos, Vasileios A. Tatsis, Ilias S. Kotsireas and Panos M. Pardalos

Numerical methods using two different approximations of space-filling curves for black-box global optimization pp. 707-722

Yaroslav D. Sergeyev, Maria Chiara Nasso and Daniela Lera

An empirical study of various candidate selection and partitioning techniques in the DIRECT framework pp. 723-753

Linas Stripinis and Remigijus Paulavičius

On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems pp. 755-776

Xiangkai Sun, Jiayi Huang and Kok Lay Teo

Scalable Bayesian optimization with generalized product of experts pp. 777-802

Saulius Tautvaišas and Julius Žilinskas

Volume 88, issue 2, 2024

A bundle-type method for nonsmooth DC programs pp. 285-326

Christian Kanzow and Tanja Neder

A cooperative approach to efficient global optimization pp. 327-357

Dawei Zhan, Jintao Wu, Huanlai Xing and Tianrui Li

Relaxed method for optimization problems with cardinality constraints pp. 359-375

Yan-Chao Liang and Gui-Hua Lin

Constraint generation approaches for submodular function maximization leveraging graph properties pp. 377-394

Eszter Csókás and Tamás Vinkó

Intersecting ellipses induced by a max-sum matching pp. 395-407

Polina Barabanshchikova and Alexandr Polyanskii

Hausdorff distance between convex semialgebraic sets pp. 409-429

Wenjie Zhao and Guangming Zhou

Directional shadow price in linearly constrained nonconvex optimization models pp. 431-460

Tao Jie and Gao Yan

A utopia point method-based robust vector polynomial optimization scheme pp. 461-483

Tianyi Han, Liguo Jiao, Jae Hyoung Lee and Junping Yin

A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems pp. 485-508

Xian Zhang, Dingtao Peng and Yanyan Su

Time-dependent elliptic quasi-variational-hemivariational inequalities: well-posedness and application pp. 509-530

Tie-jun Jiang, Dong-ling Cai, Yi-bin Xiao and Stanisław Migórski

Volume 88, issue 1, 2024

Improving exploration strategies in large dimensions and rate of convergence of global random search algorithms pp. 1-26

Jack Noonan and Anatoly Zhigljavsky

An oracle-based framework for robust combinatorial optimization pp. 27-51

Enrico Bettiol, Christoph Buchheim, Marianna De Santis and Francesco Rinaldi

Geometric multidimensional scaling: efficient approach for data dimensionality reduction pp. 53-77

Gintautas Dzemyda and Martynas Sabaliauskas

Low-rank matrix estimation via nonconvex optimization methods in multi-response errors-in-variables regression pp. 79-114

Xin Li and Dongya Wu

A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem pp. 115-137

Cheng Lu, Jitao Ma, Zhibin Deng and Wenxun Xing

Lipschitz-inspired HALRECT algorithm for derivative-free global optimization pp. 139-169

Linas Stripinis and Remigijus Paulavičius

A new partition method for DIRECT-type algorithm based on minimax design pp. 171-197

Kai Jia, Xiaojun Duan, Zhengming Wang, Taihe Yi, Liang Yan and Xuan Chen

Finding groups with maximum betweenness centrality via integer programming with random path sampling pp. 199-232

Tomás Lagos, Oleg A. Prokopyev and Alexander Veremyev

Dispersing facilities on planar segment and circle amidst repulsion pp. 233-252

Vishwanath R. Singireddy and Manjanna Basappa

Subdifferentials of optimal value functions under metric qualification conditions pp. 253-283

Vu Thi Huong, Duong Thi Viet An and Hong-Kun Xu