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

Volume 87, issue 2, 2023

Preface: special issue of MOA 2020 pp. 325-327

Ya-Feng Liu, Zi Xu, Pavlo A. Krokhmal and Jiming Peng

Fitting feature-dependent Markov chains pp. 329-346

Shane Barratt and Stephen Boyd

Solution sets of three sparse optimization problems for multivariate regression pp. 347-371

Xiaojun Chen, Lili Pan and Naihua Xiu

Randomized algorithms for the computation of multilinear rank- $$(\mu _1,\mu _2,\mu _3)$$ ( μ 1, μ 2, μ 3 ) approximations pp. 373-403

Maolin Che, Yimin Wei and Yanwei Xu

A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors pp. 405-422

Wenjie Wang, Haibin Chen, Yiju Wang and Guanglu Zhou

Improved variance reduction extragradient method with line search for stochastic variational inequalities pp. 423-446

Ting Li, Xingju Cai, Yongzhong Song and Yumin Ma

An Entropy-Regularized ADMM For Binary Quadratic Programming pp. 447-479

Haoming Liu, Kangkang Deng, Haoyang Liu and Zaiwen Wen

Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials pp. 481-501

Juan Liu, Xian-Jun Long and Xiang-Kai Sun

A new global algorithm for factor-risk-constrained mean-variance portfolio selection pp. 503-532

Huixian Wu, Hezhi Luo, Xianye Zhang and Jianzhen Liu

An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization pp. 533-550

Rui Liu, Deren Han and Yong Xia

Zeroth-order single-loop algorithms for nonconvex-linear minimax problems pp. 551-580

Jingjing Shen, Ziqi Wang and Zi Xu

A golden ratio proximal alternating direction method of multipliers for separable convex optimization pp. 581-602

Hongmei Chen, Guoyong Gu and Junfeng Yang

Approximation algorithms for the individually fair k-center with outliers pp. 603-618

Lu Han, Dachuan Xu, Yicheng Xu and Ping Yang

A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery pp. 619-639

Haitao Che, Yaru Zhuang, Yiju Wang and Haibin Chen

A derivative-free scaling memoryless DFP method for solving large scale nonlinear monotone equations pp. 641-677

Jiayun Rao and Na Huang

Decision bounding problems for two-stage distributionally robust stochastic bilevel optimization pp. 679-707

Xiaojiao Tong, Manlan Li and Hailin Sun

Zeroth-order algorithms for nonconvex–strongly-concave minimax problems with improved complexities pp. 709-740

Zhongruo Wang, Krishnakumar Balasubramanian, Shiqian Ma and Meisam Razaviyayn

Quaternion matrix decomposition and its theoretical implications pp. 741-758

Chang He, Bo Jiang and Xihua Zhu

Painlevé-Kuratowski convergence of minimal solutions for set-valued optimization problems via improvement sets pp. 759-781

Zai-Yun Peng, Xue-Jing Chen, Yun-Bin Zhao and Xiao-Bing Li

Distributionally robust mean-absolute deviation portfolio optimization using wasserstein metric pp. 783-805

Dali Chen, Yuwei Wu, Jingquan Li, Xiaohui Ding and Caihua Chen

Multiobjective optimization with least constraint violation: optimality conditions and exact penalization pp. 807-830

Jiawei Chen and Yu-Hong Dai

A facial reduction approach for the single source localization problem pp. 831-855

He Shi and Qingna Li

A note on the SDP relaxation of the minimum cut problem pp. 857-876

Hao Hu, Xinxin Li and Jiageng Wu

Data-trading coordination with government subsidy pp. 877-915

Kui Jing, Xin Liu, Fengmin Xu and Donglei Du

A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis pp. 917-937

Jian Sun, Zan-Bo Zhang, Yannan Chen, Deren Han, Donglei Du and Xiaoyan Zhang

Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems pp. 939-964

Xin Yang and Lingling Xu

An inexact primal–dual method with correction step for a saddle point problem in image debluring pp. 965-988

Changjie Fang, Liliang Hu and Shenglan Chen

Learning-augmented algorithms for online subset sum pp. 989-1008

Chenyang Xu and Guochuan Zhang

A mini-batch stochastic conjugate gradient algorithm with variance reduction pp. 1009-1025

Caixia Kou and Han Yang

IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming pp. 1027-1053

Rui-Jin Zhang, Xin-Wei Liu and Yu-Hong Dai

Volume 87, issue 1, 2023

Exchange rates and multicommodity international trade: insights from spatial price equilibrium modeling with policy instruments via variational inequalities pp. 1-30

Anna Nagurney, Dana Hassani, Oleg Nivievskyi and Pavlo Martyshev

Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise pp. 31-55

Zelda B. Zabinsky and David D. Linz

Extended McCormick relaxation rules for handling empty arguments representing infeasibility pp. 57-95

Jason Ye and Joseph K. Scott

Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs pp. 97-132

Moritz Link and Stefan Volkwein

Mixed-integer programming techniques for the minimum sum-of-squares clustering problem pp. 133-189

Jan Pablo Burgard, Carina Moreira Costa, Christopher Hojny, Thomas Kleinert and Martin Schmidt

An effective global algorithm for worst-case linear optimization under polyhedral uncertainty pp. 191-219

Huixian Wu, Hezhi Luo, Xianye Zhang and Haiqiang Qi

Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization pp. 221-254

Markus Gabl

New semidefinite relaxations for a class of complex quadratic programming problems pp. 255-275

Yingzhe Xu, Cheng Lu, Zhibin Deng and Ya-Feng Liu

An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant pp. 277-300

Xue Gao, Xingju Cai, Xiangfeng Wang and Deren Han

On solving bi-objective constrained minimum spanning tree problems pp. 301-323

Iago A. Carvalho and Amadeu A. Coco