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 85, issue 4, 2023

On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations pp. 789-819

Andreas Bärmann, Robert Burlacu, Lukas Hager and Thomas Kleinert

Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes pp. 821-846

Fan Jiang, Zhiyuan Zhang and Hongjin He

Primal-dual splittings as fixed point iterations in the range of linear operators pp. 847-866

Luis Briceño-Arias and Fernando Roldán

Calmness of partial perturbation to composite rank constraint systems and its applications pp. 867-889

Yitian Qian, Shaohua Pan and Yulan Liu

A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems pp. 891-915

Li-Ping Pang, Fan-Yun Meng and Jian-Song Yang

Conditions for the stability of ideal efficient solutions in parametric vector optimization via set-valued inclusions pp. 917-940

Amos Uderzo

An inertial proximal point method for difference of maximal monotone vector fields in Hadamard manifolds pp. 941-968

João S. Andrade, Jurandir de O. Lopes and João Carlos de O. Souza

Weak and strong convergence of generalized proximal point algorithms with relaxed parameters pp. 969-1002

Hui Ouyang

Separating bichromatic point sets in the plane by restricted orientation convex hulls pp. 1003-1036

Carlos Alegría, David Orden, Carlos Seara and Jorge Urrutia

Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves pp. 1037-1063

Phan Thanh An and Hoang Xuan Phu

Volume 85, issue 3, 2023

Computational advances in polynomial optimization: RAPOSa, a freely available global solver pp. 541-568

Brais González-Rodríguez, Joaquín Ossorio-Castillo, Julio González-Díaz, Ángel M. González-Rueda, David R. Penas and Diego Rodríguez-Martínez

Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization pp. 569-594

Matthew E. Wilhelm, Chenyu Wang and Matthew D. Stuber

New bounds for nonconvex quadratically constrained quadratic programming pp. 595-613

Moslem Zamani

Relaxed-inertial proximal point type algorithms for quasiconvex minimization pp. 615-635

S.-M. Grad, F. Lara and R. T. Marcavillaca

EFIX: Exact fixed point methods for distributed optimization pp. 637-661

Dušan Jakovetić, Nataša Krejić and Nataša Krklec Jerinkić

Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints pp. 663-685

Tran Van Su

Directional derivatives and subdifferentials for set-valued maps applied to set optimization pp. 687-707

Marius Durea and Radu Strugariu

On the structure of regularization paths for piecewise differentiable regularization terms pp. 709-741

Bennet Gebken, Katharina Bieker and Sebastian Peitz

Calabi-Polyak convexity theorem, Yuan’s lemma and S-lemma: extensions and applications pp. 743-756

Mengmeng Song and Yong Xia

Comparing reference point based interactive multiobjective optimization methods without a human decision maker pp. 757-788

Lu Chen, Kaisa Miettinen, Bin Xin and Vesa Ojalehto

Volume 85, issue 2, 2023

Regularized sample average approximation for high-dimensional stochastic optimization under low-rankness pp. 257-282

Hung Yi Lee, Charles Hernandez and Hongcheng Liu

A novel approach for solving multi-parametric problems with nonlinear constraints pp. 283-313

Addis Belete Zewde and Semu Mitiku Kassa

Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression pp. 315-349

Xin Li, Yaohua Hu, Chong Li, Xiaoqi Yang and Tianzi Jiang

Multi-instance learning by maximizing the area under receiver operating characteristic curve pp. 351-375

I. Edhem Sakarya and O. Erhun Kundakcioglu

Accelerated Dai-Liao projection method for solving systems of monotone nonlinear equations with application to image deblurring pp. 377-420

Branislav Ivanov, Gradimir V. Milovanović and Predrag S. Stanimirović

An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems pp. 421-439

Zhengyong Zhou and Xiaoyang Dai

Aubin property for solution set in multi-objective programming pp. 441-460

Morteza Rahimi and Majid Soleimani-damaneh

Vertex quickest 1-center location problem on trees and its inverse problem under weighted $$l_\infty $$ l ∞ norm pp. 461-485

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

One-Step iterative method for bilevel equilibrium problem in Hilbert space pp. 487-510

Dang Hieu and Pham Kim Quy

Global well-posedness of set-valued optimization with application to uncertain problems pp. 511-539

Kuntal Som and V. Vetrivel

Volume 85, issue 1, 2023

Finding the set of global minimizers of a piecewise affine function pp. 1-13

Majid E. Abbasov

A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice pp. 15-38

Suning Gong, Qingqin Nong, Shuyu Bao, Qizhi Fang and Ding-Zhu Du

Packing convex polygons in minimum-perimeter convex hulls pp. 39-59

Josef Kallrath, Tatiana Romanova, Alexander Pankratov, Igor Litvinchev and Luis Infante

Regrets of proximal method of multipliers for online non-convex optimization with long term constraints pp. 61-80

Liwei Zhang, Haoyang Liu and Xiantao Xiao

Second order analysis for robust inclusion systems and applications pp. 81-110

V. D. Thinh, T. D. Chuong and N. L. H. Anh

On maximum-sum matchings of points pp. 111-128

Sergey Bereg, Oscar P. Chacón-Rivera, David Flores-Peñaloza, Clemens Huemer, Pablo Pérez-Lantero and Carlos Seara

DC auxiliary principle methods for solving lexicographic equilibrium problems pp. 129-153

Pham Ngoc Anh, Qamrul Hasan Ansari and Ho Phi Tu

On the second-order optimality conditions for multi-objective optimal control problems with mixed pointwise constraints pp. 155-183

Bui Trong Kien and Trinh Duy Binh

Optimising portfolio diversification and dimensionality pp. 185-234

M. Barkhagen, S. García, J. Gondzio, J. Kalcsics, J. Kroeske, S. Sabanis and A. Staal

Characterizations of set order relations and nonlinear scalarizations via generalized oriented distance function in set optimization pp. 235-249

Khushboo and C. S. Lalitha

Book review on “Convex Analysis and Beyond. Volume I: Basic Theory”, a monograph by Boris S. Mordukhovich and Nguyen Mau Nam pp. 251-255

Nguyen Dong Yen

Volume 84, issue 4, 2022

Alternative regularizations for Outer-Approximation algorithms for convex MINLP pp. 807-842

David E. Bernal, Zedong Peng, Jan Kronqvist and Ignacio E. Grossmann

Discretization and global optimization for mixed integer bilinear programming pp. 843-867

Xin Cheng and Xiang Li

Compact mixed-integer programming formulations in quadratic optimization pp. 869-912

Benjamin Beach, Robert Hildebrand and Joey Huchette

Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization pp. 913-939

Maryam Yashtini

Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems pp. 941-966

Jing Zhao, Qiao-Li Dong, Michael Th. Rassias and Fenghui Wang

A generalized block-iterative projection method for the common fixed point problem induced by cutters pp. 967-987

Yair Censor, Daniel Reem and Maroun Zaknoon

On the maxima of motzkin-straus programs and cliques of graphs pp. 989-1003

Qingsong Tang, Xiangde Zhang, Cheng Zhao and Peng Zhao

A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations pp. 1005-1032

William La Cruz

Tight bounds on the maximal perimeter and the maximal width of convex small polygons pp. 1033-1051

Christian Bingane

Kernel density estimation based distributionally robust mean-CVaR portfolio optimization pp. 1053-1077

Wei Liu, Li Yang and Bo Yu

Volume 84, issue 3, 2022

On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization pp. 527-561

V. S. Amaral, R. Andreani, E. G. Birgin, D. S. Marcondes and J. M. Martínez

Convergence rates for the heavy-ball continuous dynamics for non-convex optimization, under Polyak–Łojasiewicz condition pp. 563-589

Vassilis Apidopoulos, Nicolò Ginatta and Silvia Villa

Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints pp. 591-606

Sven de Vries and Bernd Perscheid

An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities pp. 607-650

Maximilian Merkert, Galina Orlinskaya and Dieter Weninger

On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints pp. 651-685

Holger Heitsch, René Henrion, Thomas Kleinert and Martin Schmidt

Approximation algorithms for solving the line-capacitated minimum Steiner tree problem pp. 687-714

Jianping Li, Wencheng Wang, Junran Lichen, Suding Liu and Pengxiang Pan

Inverse max+sum spanning tree problem under weighted $$l_{\infty }$$ l ∞ norm by modifying max-weight vector pp. 715-738

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

Scalar and vector equilibrium problems with pairs of bifunctions pp. 739-753

Mircea Balaj

A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill’s global convergence pp. 755-781

Takehiro Sano, Tsuyoshi Migita and Norikazu Takahashi

Simultaneous distributed-boundary optimal control problems driven by nonlinear complementarity systems pp. 783-805

Jinxia Cen, Tahar Haddad, Nguyen Van Thien and Shengda Zeng

Volume 84, issue 2, 2022

Data-driven stochastic optimization for distributional ambiguity with integrated confidence region pp. 255-293

Steffen Rebennack

Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach pp. 295-320

Elisa Caprari, Lorenzo Cerboni Baiardi and Elena Molho

Global dynamic optimization with Hammerstein–Wiener models embedded pp. 321-347

Chrysoula D. Kappatou, Dominik Bongartz, Jaromił Najman, Susanne Sass and Alexander Mitsos

Strong subdifferentials: theory and applications in nonconvex optimization pp. 349-368

A. Kabgani and F. Lara

An adaptive high order method for finding third-order critical points of nonconvex optimization pp. 369-392

Xihua Zhu, Jiangze Han and Bo Jiang

Partial gradient optimal thresholding algorithms for a class of sparse optimization problems pp. 393-413

Nan Meng, Yun-Bin Zhao, Michal Kočvara and Zhongfeng Sun

Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space pp. 415-440

Meng-Meng Zheng, Zheng-Hai Huang and Sheng-Long Hu

New inertial forward-backward type for variational inequalities with Quasi-monotonicity pp. 441-464

Chinedu Izuchukwu, Yekini Shehu and Jen-Chih Yao

Hopping between distant basins pp. 465-489

Maldon Goodridge, John Moriarty, Jure Vogrinc and Alessandro Zocca

Multidimensional Assignment Problem for Multipartite Entity Resolution pp. 491-523

Alla Kammerdiner, Alexander Semenov and Eduardo L. Pasiliao

Correction to: Brezis pseudomonotone bifunctions and quasi equilibrium problems via penalization pp. 525-526

M. Bianchi, G. Kassay and R. Pini

Volume 84, issue 1, 2022

The supporting hyperplane optimization toolkit for convex MINLP pp. 1-41

Andreas Lundell, Jan Kronqvist and Tapio Westerlund

The p-Lagrangian relaxation for separable nonconvex MIQCQP problems pp. 43-76

Tiago Andrade, Nikita Belyak, Andrew Eberhard, Silvio Hamacher and Fabricio Oliveira

Fractional 0–1 programming and submodularity pp. 77-93

Shaoning Han, Andrés Gómez and Oleg A. Prokopyev

Finding non dominated points for multiobjective integer convex programs with linear constraints pp. 95-117

Lamia Zerfa and Mohamed El-Amine Chergui

Covering a simplex by spheres: complexity and algorithms pp. 119-135

Tongli Zhang and Yong Xia

Sufficient conditions for existence of global minimizers of functions on Hilbert spaces pp. 137-147

Liang Chen, Yu-Hong Dai and Zhou Wei

On the global minimization of discretized residual functionals of conditionally well-posed inverse problems pp. 149-176

M. Yu. Kokurin

The projected polar proximal point algorithm converges globally pp. 177-203

Scott B. Lindstrom

Quasi-contingent derivatives and studies of higher-orders in nonsmooth optimization pp. 205-228

Nguyen Xuan Duy Bao, Phan Quoc Khanh and Nguyen Minh Tung

Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors pp. 229-253

Xianpeng Mao and Yuning Yang