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

Volume 83, issue 4, 2022

Multiple instance classification via quadratic programming pp. 639-670

Emel Şeyma Küçükaşcı, Mustafa Gökçe Baydoğan and Z. Caner Taşkın

An approximate lower order penalty approach for solving second-order cone linear complementarity problems pp. 671-697

Zijun Hao, Chieu Thanh Nguyen and Jein-Shan Chen

Solving non-monotone equilibrium problems via a DIRECT-type approach pp. 699-725

Stefano Lucidi, Mauro Passacantando and Francesco Rinaldi

Maximizing a non-decreasing non-submodular function subject to various types of constraints pp. 727-751

Cheng Lu, Wenguo Yang, Ruiqi Yang and Suixiang Gao

Global convergence of model function based Bregman proximal minimization algorithms pp. 753-781

Mahesh Chandra Mukkamala, Jalal Fadili and Peter Ochs

Sparse signal recovery via generalized gaussian function pp. 783-801

Haiyang Li, Qian Zhang, Shoujin Lin and Jigen Peng

The robust bilevel continuous knapsack problem with uncertain coefficients in the follower’s objective pp. 803-824

Christoph Buchheim and Dorothee Henke

Consistency of statistical estimators of solutions to stochastic optimization problems pp. 825-842

Huynh Thi Hong Diem

LR-NIMBUS: an interactive algorithm for uncertain multiobjective optimization with lightly robust efficient solutions pp. 843-863

Javad Koushki, Kaisa Miettinen and Majid Soleimani-damaneh

Optimistic NAUTILUS navigator for multiobjective optimization with costly function evaluations pp. 865-889

Bhupinder Singh Saini, Michael Emmerich, Atanu Mazumdar, Bekir Afsar, Babooshka Shavazipour and Kaisa Miettinen

Numerical certification of Pareto optimality for biobjective nonlinear problems pp. 891-908

Charles Audet, Frédéric Messine and Jordan Ninin

Correction to: Numerical certification of Pareto optimality for biobjective nonlinear problems pp. 909-910

Charles Audet, Frédéric Messine and Jordan Ninin

Volume 83, issue 3, 2022

Special Issue: 18th International conference on mathematical optimization theory and operations research (MOTOR 2019) pp. 403-404

Panos M. Pardalos, Michael Khachay and Yuri Kochetov

A variable neighborhood search algorithm for the $$ (r{\mid }p) $$ ( r ∣ p ) hub–centroid problem under the price war pp. 405-444

Dimitrije D. Čvokić, Yury A. Kochetov, Aleksandr V. Plyasunov and Aleksandar Savić

On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements pp. 445-456

Alexander Kononov, Julia Memar and Yakov Zinder

On strong duality in linear copositive programming pp. 457-480

O. I. Kostyukova and T. V. Tchemisova

Critical sets, crowns and local maximum independent sets pp. 481-495

Vadim E. Levit and Eugen Mandrescu

A regularized point cloud registration approach for orthogonal transformations pp. 497-519

Artyom Makovetskii, Sergei Voronin, Vitaly Kober and Aleksei Voronin

Dynamic multicriteria games with asymmetric players pp. 521-537

Anna N. Rettieva

Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion pp. 539-564

Alexander Kononov and Yulia Zakharova

Hospital service levels during drug shortages: Stocking and transshipment policies for pharmaceutical inventory pp. 565-584

Cem Deniz Caglar Bozkir, O. Erhun Kundakcioglu and Andrea C. Henry

Multi-stage portfolio selection problem with dynamic stochastic dominance constraints pp. 585-613

Yu Mei, Zhiping Chen, Jia Liu and Bingbing Ji

Supply chain networks, wages, and labor productivity: insights from Lagrange. analysis and computations pp. 615-638

Anna Nagurney

Volume 83, issue 2, 2022

A revision of the rectangular algorithm for a class of DC optimization problems pp. 187-200

Takahito Kuno

Exact and approximate results for convex envelopes of special structured functions over simplices pp. 201-220

M. Locatelli

On the branch and bound algorithm for the extended trust-region subproblem pp. 221-233

Saeid Ansary Karbasy and Maziar Salahi

A new greedy strategy for maximizing monotone submodular function under a cardinality constraint pp. 235-247

Cheng Lu, Wenguo Yang and Suixiang Gao

Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in hilbert spaces pp. 249-271

Regina S. Burachik, Yaohua Hu and Xiaoqi Yang

A Newton Frank–Wolfe method for constrained self-concordant minimization pp. 273-299

Deyi Liu, Volkan Cevher and Quoc Tran-Dinh

Convex projection and convex multi-objective optimization pp. 301-327

Gabriela Kováčová and Birgit Rudloff

An approximation algorithm for multi-objective optimization problems using a box-coverage pp. 329-357

Gabriele Eichfelder and Leo Warnow

Stable global well-posedness and global strong metric regularity pp. 359-376

Xi Yin Zheng and Jiangxing Zhu

Higher-order set-valued Hadamard directional derivatives: calculus rules and sensitivity analysis of equilibrium problems and generalized equations pp. 377-402

Nguyen Minh Tung and Nguyen Xuan Duy Bao

Volume 83, issue 1, 2022

Preface: special issue on optimization in distance geometry pp. 1-2

Andrés D. Báez-Sánchez, Carlile Lavor and Antonio Mucherino

NMR assignment through linear programming pp. 3-28

José F. S. Bravo-Ferreira, David Cowburn, Yuehaw Khoo and Amit Singer

Maximum feasible subsystems of distance geometry constraints pp. 29-47

Maurizio Bruglieri, Roberto Cordone and Leo Liberti

Which graphs are rigid in $$\ell _p^d$$ ℓ p d ? pp. 49-71

Sean Dewar, Derek Kitson and Anthony Nixon

Unassigned distance geometry and molecular conformation problems pp. 73-82

Phil Duxbury, Carlile Lavor, Leo Liberti and Luiz Leduino Salles-Neto

Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections pp. 83-118

Leo Liberti and Benedetto Manca

Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in $$\mathbb {R}^d$$ R d pp. 119-136

Hacene Ouzia and Nelson Maculan

An exact algorithm for constructing minimum Euclidean skeletons of polygons pp. 137-162

Nicolau Andrés-Thió, Marcus Brazil, Charl Ras, Doreen Thomas and Marcus Volz

Global exact optimization for covering a rectangle with 6 circles pp. 163-185

Sonia Cafieri, Pierre Hansen and Frédéric Messine