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

Guided dive for the spatial branch-and-bound pp. 685-711

D. Gerard, M. Köppe and Q. Louveaux

A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set pp. 713-727

Rudolf Scitovski

Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers pp. 729-747

Abay Molla Kassa and Semu Mitiku Kassa

A new fully polynomial time approximation scheme for the interval subset sum problem pp. 749-775

Rui Diao, Ya-Feng Liu and Yu-Hong Dai

DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling pp. 777-798

Rundong Du, Da Kuang, Barry Drake and Haesun Park

Parallel machine scheduling with general sum of processing time based models pp. 799-814

Radosław Rudek

Global convergence of proximal iteratively reweighted algorithm pp. 815-826

Tao Sun, Hao Jiang and Lizhi Cheng

Kriging surrogate model with coordinate transformation based on likelihood and gradient pp. 827-849

Nobuo Namura, Koji Shimoyama and Shigeru Obayashi

A stochastic production planning problem in hybrid manufacturing and remanufacturing systems with resource capacity planning pp. 851-878

Chang Fang, Xinbao Liu, Panos M. Pardalos, Jianyu Long, Jun Pei and Chao Zuo

Global probability maximization for a Gaussian bilateral inequality in polynomial time pp. 879-898

Michel Minoux and Riadh Zorgati

Vectorial penalization for generalized functional constrained problems pp. 899-923

Marius Durea and Radu Strugariu

Volume 68, issue 3, 2017

A nonlinear programming model with implicit variables for packing ellipsoids pp. 467-499

E. G. Birgin, R. D. Lobato and J. M. Martínez

A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes pp. 501-535

Kaisa Joki, Adil M. Bagirov, Napsu Karmitsa and Marko M. Mäkelä

An approximate bundle method for solving nonsmooth equilibrium problems pp. 537-562

Fan-Yun Meng, Li-Ping Pang, Jian Lv and Jin-He Wang

Global optimization of non-convex piecewise linear regression splines pp. 563-586

Nadia Martinez, Hadis Anahideh, Jay M. Rosenberger, Diana Martinez, Victoria C. P. Chen and Bo Ping Wang

Coradiant sets and $$\varepsilon $$ ε -efficiency in multiobjective optimization pp. 587-600

Abbas Sayadi-bander, Latif Pourkarimi, Refail Kasimbeyli and Hadi Basirzadeh

The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems pp. 601-622

Marcel Turkensteen, Dmitry Malyshev, Boris Goldengorin and Panos M. Pardalos

Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems pp. 623-640

Hongtan Sun and Thomas C. Sharkey

Pseudo expected improvement criterion for parallel EGO algorithm pp. 641-662

Dawei Zhan, Jiachang Qian and Yuansheng Cheng

Decoupling linear and nonlinear regimes: an evaluation of efficiency for nonlinear multidimensional optimization pp. 663-675

Christopher M. Cotnoir and Balša Terzić

A review of computation of mathematically rigorous bounds on optima of linear programs pp. 677-683

Jared T. Guilbeau, Md. Istiaq Hossain, Sam D. Karhbet, Ralph Baker Kearfott, Temitope S. Sanusi and Lihong Zhao

Volume 68, issue 2, 2017

A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs pp. 227-253

Hatim Djelassi and Alexander Mitsos

Solving discrete linear bilevel optimization problems using the optimal value reformulation pp. 255-277

S. Dempe and F. Mefo Kue

Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach pp. 279-306

Alberto Seeger and José Vidal -Nuñez

Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization pp. 307-328

Duy Khuong Nguyen and Tu Bao Ho

Matrix product constraints by projection methods pp. 329-355

Veit Elser

Self-concordance is NP-hard pp. 357-366

Lek-Heng Lim

Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization pp. 367-385

J. M. Martínez and M. Raydan

Kantorovich’s theorem on Newton’s method under majorant condition in Riemannian manifolds pp. 387-411

T. Bittencourt and O. P. Ferreira

Chebyshev model arithmetic for factorable functions pp. 413-438

Jai Rajyaguru, Mario E. Villanueva, Boris Houska and Benoît Chachuat

Equal Risk Bounding is better than Risk Parity for portfolio selection pp. 439-461

Francesco Cesarone and Fabio Tardella

Erratum to: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem pp. 463-466

Amadeu Almeida Coco, João Carlos Abreu Júnior, Thiago F. Noronha and Andréa Cynthia Santos

Volume 68, issue 1, 2017

A branch and bound algorithm for quantified quadratic programming pp. 1-22

F. Domes and A. Goldsztejn

Algorithms for art gallery illumination pp. 23-45

Maximilian Ernestus, Stephan Friedrichs, Michael Hemmer, Jan Kokemüller, Alexander Kröller, Mahdi Moeini and Christiane Schmidt

A recursive algorithm for multivariate risk measures and a set-valued Bellman’s principle pp. 47-69

Zachary Feinstein and Birgit Rudloff

An approach to generate comprehensive piecewise linear interpolation of pareto outcomes to aid decision making pp. 71-93

Kalyan Shankar Bhattacharjee, Hemant Kumar Singh and Tapabrata Ray

Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms pp. 95-123

Hao-Chun Lu

Global saddle points of nonlinear augmented Lagrangian functions pp. 125-146

Changyu Wang, Qian Liu and Biao Qu

Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing pp. 147-167

Liangyu Chen, Yaochen Xu and Zhenbing Zeng

Application of the sequential parametric convex approximation method to the design of robust trusses pp. 169-187

Alfredo Canelas, Miguel Carrasco and Julio López

Improving simulated annealing through derandomization pp. 189-217

Mathieu Gerber and Luke Bornn

Erratum to: Multivariate McCormick relaxations pp. 219-225

Jaromił Najman, Dominik Bongartz, Angelos Tsoukalas and Alexander Mitsos

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