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 67, issue 4, 2017

Differentiable McCormick relaxations pp. 687-729

Kamil A. Khan, Harry A. J. Watson and Paul I. Barton

Three enhancements for optimization-based bound tightening pp. 731-757

Ambros M. Gleixner, Timo Berthold, Benjamin Müller and Stefan Weltge

Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization pp. 759-786

Christoph Buchheim and Claudia D’Ambrosio

On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem pp. 787-804

José L. Sainz-Pardo, Javier Alcaraz, Mercedes Landete and Juan F. Monge

Robust optimization approximation for joint chance constrained optimization problem pp. 805-827

Yuan Yuan, Zukui Li and Biao Huang

Bounded Lagrange multiplier rules for general nonsmooth problems and application to mathematical programs with equilibrium constraints pp. 829-850

Nooshin Movahedian

Improving the convergence rate of the DIRECT global optimization algorithm pp. 851-872

Qunfeng Liu, Guang Yang, Zhongzhi Zhang and Jinping Zeng

Balancing global and local search in parallel efficient global optimization algorithms pp. 873-892

Dawei Zhan, Jiachang Qian and Yuansheng Cheng

Default policies for global optimisation of noisy functions with severe noise pp. 893-907

Spyridon Samothrakis, Maria Fasli, Diego Perez and Simon Lucas

Universal rigidity of bar frameworks via the geometry of spectrahedra pp. 909-924

A. Y. Alfakih

Volume 67, issue 3, 2017

Enclosure of all index-1 saddle points of general nonlinear functions pp. 451-474

Dimitrios Nerantzis and Claire S. Adjiman

An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints pp. 475-493

Cheng Lu, Zhibin Deng and Qingwei Jin

Analysis of budget for interdiction on multicommodity network flows pp. 495-525

Pengfei Zhang and Neng Fan

Multiple depot ring star problem: a polyhedral study and an exact algorithm pp. 527-551

Kaarthik Sundar and Sivakumar Rathinam

Branch and bound algorithm with applications to robust stability pp. 553-579

Laleh Ravanbod, Dominikus Noll and Pierre Apkarian

A coverage-based Box-Algorithm to compute a representation for optimization problems with three objective functions pp. 581-600

Tobias Kuhn and Stefan Ruzika

Covers and approximations in multiobjective optimization pp. 601-619

Daniel Vanderpooten, Lakmali Weerasena and Margaret M. Wiecek

A polynomially solvable case of the pooling problem pp. 621-630

Natashia Boland, Thomas Kalinowski and Fabian Rigterink

Relaxations and discretizations for the pooling problem pp. 631-669

Akshay Gupte, Shabbir Ahmed, Santanu S. Dey and Myun Seok Cheon

Heuristic solution approaches for the maximum minsum dispersion problem pp. 671-686

Anna Martínez-Gavara, Vicente Campos, Manuel Laguna and Rafael Martí

Volume 67, issue 1, 2017

Preface pp. 1-1

Panos M. Pardalos

Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption pp. 3-42

Fani Boukouvala, M. M. Faruque Hasan and Christodoulos A. Floudas

Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques pp. 43-58

Juan P. Ruiz and Ignacio E. Grossmann

Bounds tightening based on optimality conditions for nonconvex box-constrained optimization pp. 59-77

Yash Puranik and Nikolaos V. Sahinidis

ParEGO extensions for multi-objective optimization of expensive evaluation functions pp. 79-96

Joan Davins-Valldaura, Saïd Moussaoui, Guillermo Pita-Gil and Franck Plestan

A Bayesian approach to constrained single- and multi-objective optimization pp. 97-133

Paul Feliot, Julien Bect and Emmanuel Vazquez

Interactive model-based search with reactive resource allocation pp. 135-149

Yue Sun and Alfredo Garcia

Packing ellipsoids into volume-minimizing rectangular boxes pp. 151-185

Josef Kallrath

On Laplacian spectra of parametric families of closely connected networks with application to cooperative control pp. 187-205

Alla Kammerdiner, Alexander Veremyev and Eduardo Pasiliao

Optimal transport and a bilevel location-allocation problem pp. 207-221

Lina Mallozzi and Antonia Passarelli di Napoli

Supply chain performance assessment and supplier and component importance identification in a general competitive multitiered supply chain network model pp. 223-250

Dong Li and Anna Nagurney

Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine pp. 251-262

Jun Pei, Xinbao Liu, Panos M. Pardalos, Athanasios Migdalas and Shanlin Yang

Dynamic algorithm selection for pareto optimal set approximation pp. 263-282

Ingrida Steponavičė, Rob Hyndman, Kate Smith-Miles and Laura Villanova

A diverse human learning optimization algorithm pp. 283-323

Ling Wang, Lu An, Jiaxing Pi, Minrui Fei and Panos M. Pardalos

A modified active set algorithm for transportation discrete network design bi-level problem pp. 325-342

Ximing Wang and Panos M. Pardalos

A Kriging-based constrained global optimization algorithm for expensive black-box functions with infeasible initial points pp. 343-366

Yaohui Li, Yizhong Wu, Jianjun Zhao and Liping Chen

Local search algorithm for universal facility location problem with linear penalties pp. 367-378

Yicheng Xu, Dachuan Xu, Donglei Du and Chenchen Wu

Some feasibility sampling procedures in interval methods for constrained global optimization pp. 379-397

Mengyi Ying and Min Sun

An efficient multi-objective PSO algorithm assisted by Kriging metamodel for expensive black-box problems pp. 399-423

Haoxiang Jie, Yizhong Wu, Jianjun Zhao, Jianwan Ding and Liangliang

Application of Reduced-set Pareto-Lipschitzian Optimization to truss optimization pp. 425-450

Jonas Mockus, Remigijus Paulavičius, Dainius Rusakevičius, Dmitrij Šešok and Julius Žilinskas

Volume 66, issue 4, 2016

Journal of Global Optimization Best Paper Award for 2015 pp. 595-596

Sergiy Butenko

Convergence analysis of multivariate McCormick relaxations pp. 597-628

Jaromił Najman and Alexander Mitsos

Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes pp. 629-668

Marco Locatelli

New multi-commodity flow formulations for the pooling problem pp. 669-710

Natashia Boland, Thomas Kalinowski and Fabian Rigterink

Solving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem pp. 711-727

Seksan Kiatsupaibul, Robert L. Smith and Zelda B. Zabinsky

MONEDA: scalable multi-objective optimization with a neural network-based estimation of distribution algorithm pp. 729-768

Luis Martí, Jesús García, Antonio Berlanga and José M. Molina

Scatter search for the bandpass problem pp. 769-790

Jesús Sánchez-Oro, Manuel Laguna, Rafael Martí and Abraham Duarte

Gap functions for quasi-equilibria pp. 791-810

Giancarlo Bigi and Mauro Passacantando

MSO: a framework for bound-constrained black-box global optimization algorithms pp. 811-845

Abdullah Al-Dujaili, S. Suresh and N. Sundararajan

Volume 66, issue 3, 2016

Delaunay-based derivative-free optimization via global surrogates, part I: linear constraints pp. 331-382

Pooriya Beyhaghi, Daniele Cavaglieri and Thomas Bewley

Delaunay-based derivative-free optimization via global surrogates, part II: convex constraints pp. 383-415

Pooriya Beyhaghi and Thomas R. Bewley

SOP: parallel surrogate global optimization with Pareto center selection for computationally expensive single objective problems pp. 417-437

Tipaluck Krityakierne, Taimoor Akhtar and Christine A. Shoemaker

Sufficient conditions for error bounds of difference functions and applications pp. 439-456

Nguyen Thi Hang and Jen-Chih Yao

A block coordinate variable metric forward–backward algorithm pp. 457-485

Emilie Chouzenoux, Jean-Christophe Pesquet and Audrey Repetti

Smoothing and SAA method for stochastic programming problems with non-smooth objective and constraints pp. 487-510

Gui-Hua Lin, Mei-Ju Luo and Jin Zhang

Global versus local search: the impact of population sizes on evolutionary algorithm performance pp. 511-534

Thomas Weise, Yuezhong Wu, Raymond Chiong, Ke Tang and Jörg Lässig

An optimal algorithm for Global Optimization and adaptive covering pp. 535-572

Serge L. Shishkin and Alan M. Finn

A primal–dual prediction–correction algorithm for saddle point optimization pp. 573-583

Hongjin He, Jitamitra Desai and Kai Wang

The Lyapunov rank of extended second order cones pp. 585-593

Roman Sznajder

Volume 66, issue 2, 2016

Convex hull characterizations of lexicographic orderings pp. 311-329

Warren Adams, Pietro Belotti and Ruobing Shen

Volume 66, issue 1, 2016

Special Issue: XVI Baikal International School-Seminar > pp. 1-1

Oleg Khamisov, Yury Kochetov and Alexander Strekalovsky

Parallel global optimization on GPU pp. 3-20

Konstantin Barkalov and Victor Gergel

Approximability of the minimum-weight k-size cycle cover problem pp. 65-82

Michael Khachay and Katherine Neznakhina

Discrete-continuous optimization of heat network operating conditions in parallel operation of similar pumps at pumping stations pp. 83-94

N. N. Novitsky and A. V. Lutsenko