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 71, issue 4, 2018

In memoriam: Professor Christodoulos A. Floudas (1959–2016) pp. 651-653

Efstratios N. Pistikopoulos

Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness pp. 655-690

Radu Baltean-Lugojan and Ruth Misener

Global optimization of MIQCPs with dynamic piecewise relaxations pp. 691-716

Pedro A. Castillo Castillo, Pedro M. Castro and Vladimir Mahalec

A symmetry-based splitting strategy for discretizable distance geometry problems pp. 717-733

Felipe Fidalgo, Douglas S. Gonçalves, Carlile Lavor, Leo Liberti and Antonio Mucherino

An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems pp. 735-752

M. M. Faruque Hasan

Convergence-order analysis of branch-and-bound algorithms for constrained problems pp. 753-813

Rohit Kannan and Paul I. Barton

Arbitrarily tight $$\alpha $$ α BB underestimators of general non-linear functions over sub-optimal domains pp. 815-844

N. Kazazakis and C. S. Adjiman

Optimization of black-box problems using Smolyak grids and polynomial approximations pp. 845-869

Chris A. Kieslich, Fani Boukouvala and Christodoulos A. Floudas

Global optimization algorithm for capacitated multi-facility continuous location-allocation problems pp. 871-889

Cristiana L. Lara, Francisco Trespalacios and Ignacio E. Grossmann

Optimal deterministic algorithm generation pp. 891-913

Alexander Mitsos, Jaromił Najman and Ioannis G. Kevrekidis

A computational study of global optimization solvers on two trust region subproblems pp. 915-934

Tiago Montanher, Arnold Neumaier and Ferenc Domes

A customized branch-and-bound approach for irregular shape nesting pp. 935-955

Akang Wang, Christopher L. Hanselman and Chrysanthos E. Gounaris

Surrogate-based feasibility analysis for black-box stochastic simulations with heteroscedastic noise pp. 957-985

Zilong Wang and Marianthi Ierapetritou

On solving generalized convex MINLP problems using supporting hyperplane techniques pp. 987-1011

Tapio Westerlund, Ville-Pekka Eronen and Marko M. Mäkelä

Preface of the Special JOGO issue in Memory of Professor Christodoulos A. Floudas (1959–2016) pp. 1013-1013

Ignacio Grossmann and Panos Pardalos

Volume 71, issue 3, 2018

Preface to the Special Issue “GOW’16” pp. 441-442

Ana Maria A. C. Rocha, M. Fernanda P. Costa and Edite M. G. P. Fernandes

Testing pseudoconvexity via interval computation pp. 443-455

Milan Hladík

Extensions on ellipsoid bounds for quadratic integer programming pp. 457-482

Marcia Fampa and Francisco Pinillos Nieto

lsmear: a variable selection strategy for interval branch and bound solvers pp. 483-500

Ignacio Araya and Bertrand Neveu

Feasibility pump for aircraft deconfliction with speed regulation pp. 501-515

Sonia Cafieri and Claudia D’Ambrosio

Filter-based DIRECT method for constrained global optimization pp. 517-536

M. Fernanda P. Costa, Ana Maria A. C. Rocha and Edite M. G. P. Fernandes

Metabolic pathway analysis using a nash equilibrium approach pp. 537-550

Angelo Lucia, Peter A. DiMaggio and Diego Alonso-Martinez

Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations pp. 551-569

Immanuel Bomze, Vaithilingam Jeyakumar and Guoyin Li

Reformulations for utilizing separability when solving convex MINLP problems pp. 571-592

Jan Kronqvist, Andreas Lundell and Tapio Westerlund

Integrality gap minimization heuristics for binary mixed integer nonlinear programming pp. 593-612

Wendel Melo, Marcia Fampa and Fernanda Raupp

A sampling-based exact algorithm for the solution of the minimax diameter clustering problem pp. 613-630

Daniel Aloise and Claudio Contardo

Improving the performance and energy of Non-Dominated Sorting for evolutionary multiobjective optimization on GPU/CPU platforms pp. 631-649

J. J. Moreno, G. Ortega, E. Filatovas, J. A. Martínez and E. M. Garzón

Volume 71, issue 2, 2018

Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property pp. 237-296

M. V. Dolgopolik

A modified simplicial algorithm for convex maximization based on an extension of $$\omega $$ ω -subdivision pp. 297-311

Takahito Kuno

Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization pp. 313-339

Shinji Yamada and Akiko Takeda

“Optimal” choice of the step length of the projection and contraction methods for solving the split feasibility problem pp. 341-360

Q. L. Dong, Y. C. Tang, Y. J. Cho and Th. M. Rassias

Nash game based efficient global optimization for large-scale design problems pp. 361-381

Shengguan Xu and Hongquan Chen

Hartley properly and super nondominated solutions in vector optimization with a variable ordering structure pp. 383-405

Shokouh Shahbeyk, Majid Soleimani-damaneh and Refail Kasimbeyli

Efficient multiobjective optimization employing Gaussian processes, spectral sampling and a genetic algorithm pp. 407-438

Eric Bradford, Artur M. Schweidtmann and Alexei Lapkin

Correction to: Efficient multiobjective optimization employing Gaussian processes, spectral sampling and a genetic algorithm pp. 439-440

Eric Bradford, Artur M. Schweidtmann and Alexei Lapkin

Volume 71, issue 1, 2018

Guest editors’ preface to the special issue devoted to the 2nd International Conference “Numerical Computations: Theory and Algorithms”, June 19–25, 2016, Pizzo Calabro, Italy pp. 1-4

Renato Leone, Yaroslav D. Sergeyev and Anatoly Zhigljavsky

Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants pp. 5-20

Remigijus Paulavičius, Lakhdar Chiter and Julius Žilinskas

Solving a set of global optimization problems by the parallel technique with uniform convergence pp. 21-36

Konstantin Barkalov and Roman Strongin

Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations pp. 37-55

Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico and Adil M. Bagirov

Performance of global random search algorithms for large dimensions pp. 57-71

Andrey Pepelyshev, Anatoly Zhigljavsky and Antanas Žilinskas

Efficient multicriterial optimization based on intensive reuse of search information pp. 73-90

Victor Gergel and Evgeny Kozinov

On a class of bilevel linear mixed-integer programs in adversarial settings pp. 91-113

M. Hosein Zare, Osman Y. Özaltın and Oleg A. Prokopyev

An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section pp. 115-127

Albertas Gimbutas and Antanas Žilinskas

Approximating a solution set of nonlinear inequalities pp. 129-145

Yuri Evtushenko, Mikhail Posypkin, Larisa Rybak and Andrei Turkin

Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning pp. 147-163

Wenjuan Fan, Jun Pei, Xinbao Liu, Panos M. Pardalos and Min Kong

On convergence rate of a rectangular partition based global optimization algorithm pp. 165-191

James Calvin, Gražina Gimbutienė, William O. Phillips and Antanas Žilinskas

GOSH: derivative-free global optimization using multi-dimensional space-filling curves pp. 193-211

Daniela Lera and Yaroslav D. Sergeyev

Bayesian optimization of pump operations in water distribution systems pp. 213-235

A. Candelieri, R. Perego and F. Archetti

Volume 70, issue 4, 2018

How to project onto extended second order cones pp. 707-718

O. P. Ferreira and S. Z. Németh

Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint pp. 719-735

Xiaojin Zheng, Yutong Pan and Xueting Cui

An interleaved depth-first search method for the linear optimization problem with disjunctive constraints pp. 737-756

Yinrun Lyu, Li Chen, Changyou Zhang, Dacheng Qu, Nasro Min-Allah and Yongji Wang

An adaptive framework for costly black-box global optimization based on radial basis function interpolation pp. 757-781

Zhe Zhou and Fusheng Bai

Simulation optimization of risk measures with adaptive risk levels pp. 783-809

Helin Zhu, Joshua Hale and Enlu Zhou

A Utility Theory Based Interactive Approach to Robustness in Linear Optimization pp. 811-842

Mehdi Karimi, Somayeh Moazeni and Levent Tunçel

Tensor maximal correlation problems pp. 843-858

Anwa Zhou, Xin Zhao, Jinyan Fan and Yanqin Bai

Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain pp. 859-873

Qiaoming Han, Donglei Du, Dachuan Xu and Yicheng Xu

Approximate solutions of vector optimization problems via improvement sets in real linear spaces pp. 875-901

C. Gutiérrez, L. Huerga, B. Jiménez and V. Novo

Scalarizations for a unified vector optimization problem based on order representing and order preserving properties pp. 903-916

Khushboo and C. S. Lalitha

Volume 70, issue 3, 2018

An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver pp. 497-516

Kai Zhou, Mustafa R. Kılınç, Xi Chen and Nikolaos V. Sahinidis

A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information pp. 517-549

Jian Lv, Li-Ping Pang and Fan-Yun Meng

Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization pp. 551-577

Xiaolong Kuang and Luis F. Zuluaga

An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming pp. 579-599

Yiduo Zhan, Qipeng P. Zheng, Chung-Li Tseng and Eduardo L. Pasiliao

A trajectory-based method for mixed integer nonlinear programming problems pp. 601-623

Terry-Leigh Oliphant and M. Montaz Ali

A Frank–Wolfe based branch-and-bound algorithm for mean-risk optimization pp. 625-644

Christoph Buchheim, Marianna De Santis, Francesco Rinaldi and Long Trieu

Order-based error for managing ensembles of surrogates in mesh adaptive direct search pp. 645-675

Charles Audet, Michael Kokkolaras, Sébastien Le Digabel and Bastien Talgorn

Partial inverse maximum spanning tree in which weight can only be decreased under $$l_p$$ l p -norm pp. 677-685

Xianyue Li, Zhao Zhang and Ding-Zhu Du

Inertial projection and contraction algorithms for variational inequalities pp. 687-704

Q. L. Dong, Y. J. Cho, L. L. Zhong and Th. M. Rassias

Corrections to: Differentiable McCormick relaxations pp. 705-706

Kamil A. Khan, Matthew Wilhelm, Matthew D. Stuber, Huiyi Cao, Harry A. J. Watson and Paul I. Barton

Volume 70, issue 2, 2018

Preface pp. 307-307

Sebastiano Battiato, Patrizia Daniele, Giovanni Maria Farinella, Sofia Giuffrè and Laura Rosa Maria Scrimali

New necessary and sufficient optimality conditions for strong bilevel programming problems pp. 309-327

Abdelmalek Aboussoror and Samir Adly

On an equilibrium problem with complementarity constraints formulation of pay-as-clear electricity market with demand elasticity pp. 329-346

Elisabetta Allevi, Didier Aussel and Rossana Riccardi

Evaluating the impacts of the external supply risk in a natural gas supply chain: the case of the Italian market pp. 347-384

E. Allevi, L. Boffino, M. E. Giuli and G. Oggioni

New extragradient-like algorithms for strongly pseudomonotone variational inequalities pp. 385-399

Dang Hieu and Duong Viet Thong

Inverse problems for quasi-variational inequalities pp. 401-411

Akhtar A. Khan and Dumitru Motreanu

Security investment and information sharing in the market of complementary firms: impact of complementarity degree and industry size pp. 413-436

Xinbao Liu, Xiaofei Qian, Jun Pei and Panos M. Pardalos

Second-order necessary efficiency conditions for nonsmooth vector equilibrium problems pp. 437-453

Do Van Luu

Cooperation in pollution control problems via evolutionary variational inequalities pp. 455-476

Laura Scrimali and Cristina Mirabella

The Glowinski–Le Tallec splitting method revisited in the framework of equilibrium problems in Hilbert spaces pp. 477-495

Phan Tu Vuong and Jean Jacques Strodiot

Volume 70, issue 1, 2018

Preface: Special issue of MOA 2016 pp. 1-3

Thorsten Koch, Ya-Feng Liu and Jiming Peng

A sparse enhanced indexation model with chance and cardinality constraints pp. 5-25

Fengmin Xu, Meihua Wang, Yu-Hong Dai and Dachuan Xu

Optimal replenishment and stocking strategies for inventory mechanism with a dynamically stochastic short-term price discount pp. 27-53

Yiju Wang, Hengxia Gao and Wei Xing

On the stability of solutions for semi-infinite vector optimization problems pp. 55-69

Zai-Yun Peng, Jian-Wen Peng, Xian-Jun Long and Jen-Chih Yao

Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss pp. 71-97

Le Han and Shujun Bi

Approximation algorithms for optimization of real-valued general conjugate complex forms pp. 99-130

Taoran Fu, Bo Jiang and Zhening Li

Distributionally robust chance constrained optimization for economic dispatch in renewable energy integrated systems pp. 131-158

Xiaojiao Tong, Hailin Sun, Xiao Luo and Quanguo Zheng

Optimality analysis on partial $$l_1$$ l 1 -minimization recovery pp. 159-170

Huan Gao, Haibin Zhang, Zhibao Li and Kai Tu

Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming pp. 171-187

Cheng Lu, Zhibin Deng, Wei-Qiang Zhang and Shu-Cherng Fang

A computational study of primal heuristics inside an MI(NL)P solver pp. 189-206

Timo Berthold

Approximation algorithms for the robust/soft-capacitated 2-level facility location problems pp. 207-222

Chenchen Wu, Dachuan Xu, Dongmei Zhang and Peng Zhang

Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints pp. 223-236

Suhong Jiang, Jin Zhang, Caihua Chen and Guihua Lin

A quadratic penalty method for hypergraph matching pp. 237-259

Chunfeng Cui, Qingna Li, Liqun Qi and Hong Yan

Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications pp. 261-288

Davood Hajinezhad and Qingjiang Shi

Generalized coefficient strengthening cuts for mixed integer programming pp. 289-306

Wei-Kun Chen, Liang Chen, Mu-Ming Yang and Yu-Hong Dai