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

Volume 86, issue 4, 2023

An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems pp. 821-844

Zhili Ge, Zhongming Wu, Xin Zhang and Qin Ni

Semistrictly and neatly quasiconvex programming using lower global subdifferentials pp. 845-865

A. Kabgani and F. Lara

Structured tensor tuples to polynomial complementarity problems pp. 867-883

Tong-tong Shang and Guo-ji Tang

An average-compress algorithm for the sample mean problem under dynamic time warping pp. 885-903

Brijnesh Jain, Vincent Froese and David Schultz

A new scheme for approximating the weakly efficient solution set of vector rational optimization problems pp. 905-930

Feng Guo and Liguo Jiao

On the study of multistage stochastic vector quasi-variational problems pp. 931-952

Elena Molho and Domenico Scopelliti

Mixed polynomial variational inequalities pp. 953-988

Tong-tong Shang and Guo-ji Tang

Noncoercive and noncontinuous equilibrium problems: existence theorem in infinite-dimensional spaces pp. 989-1003

F. Fakhar, H. R. Hajisharifi and Z. Soltani

Second-order characterization of convex mappings in Banach spaces and its applications pp. 1005-1023

Mohammad Taghi Nadi and Jafar Zafarani

Finding global solutions of some inverse optimal control problems using penalization and semismooth Newton methods pp. 1025-1061

Markus Friedemann, Felix Harder and Gerd Wachsmuth

Volume 86, issue 3, 2023

General convex relaxations of implicit functions and inverse functions pp. 545-572

Huiyi Cao and Kamil A. Khan

Subdomain separability in global optimization pp. 573-588

Jens Deussen and Uwe Naumann

A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems pp. 589-620

Liping Pang, Xiaoliang Wang and Fanyun Meng

Approximate Douglas–Rachford algorithm for two-sets convex feasibility problems pp. 621-636

R. Díaz Millán, O. P. Ferreira and J. Ugon

Distributed primal outer approximation algorithm for sparse convex programming with separable structures pp. 637-670

Alireza Olama, Eduardo Camponogara and Paulo R. C. Mendes

Exact SDP relaxations for quadratic programs with bipartite graph structures pp. 671-691

Godai Azuma, Mituhiro Fukuda, Sunyoung Kim and Makoto Yamashita

A robust multi-objective Bayesian optimization framework considering input uncertainty pp. 693-711

Jixiang Qing, Ivo Couckuyt and Tom Dhaene

A robust investment-consumption optimization problem in a switching regime interest rate setting pp. 713-739

Bogdan Iftimie

A three-stage stochastic optimization model integrating 5G technology and UAVs for disaster management pp. 741-780

Gabriella Colajanni, Patrizia Daniele, Anna Nagurney, Ladimer S. Nagurney and Daniele Sciacca

The interpolating element-free Galerkin method for the p-Laplace double obstacle mixed complementarity problem pp. 781-820

Rui Ding, Chaoren Ding and Quan Shen

Volume 86, issue 2, 2023

KKT-based primal-dual exactness conditions for the Shor relaxation pp. 285-301

M. Locatelli

Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound pp. 303-321

Peiping Shen, Dianxiao Wu and Kaimin Wang

A non-convex piecewise quadratic approximation of $$\ell _{0}$$ ℓ 0 regularization: theory and accelerated algorithm pp. 323-353

Qian Li, Wei Zhang, Yanqin Bai and Guoqiang Wang

Efficient enumeration of the optimal solutions to the correlation clustering problem pp. 355-391

Nejat Arınık, Rosa Figueiredo and Vincent Labatut

Approximating biobjective minimization problems using general ordering cones pp. 393-415

Arne Herzel, Stephan Helfrich, Stefan Ruzika and Clemens Thielen

Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems pp. 417-440

Stephan Helfrich, Tyler Perini, Pascal Halffmann, Natashia Boland and Stefan Ruzika

Faster distance-based representative skyline and k-center along pareto front in the plane pp. 441-466

Sergio Cabello

A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems pp. 467-494

Sanath Kahagalage, Hasan Hüseyin Turan, Fatemeh Jalalvand and Sondoss El Sawah

A fixed point iterative method for tensor complementarity problems with the implicit Z-tensors pp. 495-520

Zheng-Hai Huang, Yu-Fan Li and Yong Wang

A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems pp. 521-543

Andreas Ernst, Lars Grüne and Janosch Rieger

Volume 86, issue 1, 2023

TREGO: a trust-region framework for efficient global optimization pp. 1-23

Youssef Diouane, Victor Picheny, Rodolophe Le Riche and Alexandre Scotto Di Perrotolo

Projections onto hyperbolas or bilinear constraint sets in Hilbert spaces pp. 25-36

Heinz H. Bauschke, Manish Krishan Lal and Xianfu Wang

Nonconvex sensitivity-based generalized Benders decomposition pp. 37-60

Jia-Jiang Lin, Feng Xu and Xiong-Lin Luo

Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems pp. 61-92

Bo Zhang, YueLin Gao, Xia Liu and XiaoLi Huang

Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials pp. 93-122

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

Extension of forward-reflected-backward method to non-convex mixed variational inequalities pp. 123-140

Chinedu Izuchukwu, Yekini Shehu and Chibueze C. Okeke

Some saddle-point theorems for vector-valued functions pp. 141-161

Nguyen Xuan Hai, Nguyen Hong Quan and Vo Viet Tri

Global linear convergence of evolution strategies with recombination on scaling-invariant functions pp. 163-203

Cheikh Toure, Anne Auger and Nikolaus Hansen

Lifting for the integer knapsack cover polyhedron pp. 205-249

Wei-Kun Chen, Liang Chen and Yu-Hong Dai

The restricted inverse optimal value problem on shortest path under $$l_1$$ l 1 norm on trees pp. 251-284

Qiao Zhang, Xiucui Guan, Junhua Jia, Xinqiang Qian and Panos M. Pardalos