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 78, issue 4, 2020

Saddle point approximation approaches for two-stage robust optimization problems pp. 651-670

Ning Zhang and Chang Fang

Strategic decisions of sales and pay-per-use rentals under incomplete product availability pp. 671-691

Ping Yan, Jun Pei and Altannar Chinchuluun

Parallel-batching scheduling with nonlinear processing times on a single and unrelated parallel machines pp. 693-715

Min Kong, Xinbao Liu, Jun Pei, Panos M. Pardalos and Nenad Mladenovic

Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration pp. 717-742

Baoyu Liao, Qingru Song, Jun Pei, Shanlin Yang and Panos M. Pardalos

High-end weapon equipment portfolio selection based on a heterogeneous network model pp. 743-761

Jichao Li, Bingfeng Ge, Jiang Jiang, Kewei Yang and Yingwu Chen

Fast algorithms for sparse portfolio selection considering industries and investment styles pp. 763-789

Zhi-Long Dong, Fengmin Xu and Yu-Hong Dai

A heuristic and metaheuristic approach to the static weapon target assignment problem pp. 791-812

Alexander G. Kline, Darryl K. Ahner and Brian J. Lunday

Volume 78, issue 3, 2020

Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations pp. 397-422

Miju Ahn

Penalized semidefinite programming for quadratically-constrained quadratic optimization pp. 423-451

Ramtin Madani, Mohsen Kheirandishfard, Javad Lavaei and Alper Atamtürk

Outer space branch and bound algorithm for solving linear multiplicative programming problems pp. 453-482

Peiping Shen, Kaimin Wang and Ting Lu

Gaussian process optimization with failures: classification and convergence proof pp. 483-506

François Bachoc, Céline Helbert and Victor Picheny

Expected improvement for expensive optimization: a review pp. 507-544

Dawei Zhan and Huanlai Xing

Geoffrion’s proper efficiency in linear fractional vector optimization with unbounded constraint sets pp. 545-562

N. T. T. Huong, J.-C. Yao and N. D. Yen

Stability of efficient solutions to set optimization problems pp. 563-580

L. Q. Anh, T. Q. Duy and D. V. Hien

On the sensitivity of Pareto efficiency in set-valued optimization problems pp. 581-596

Marius Durea and Radu Strugariu

Portfolio optimization with two coherent risk measures pp. 597-626

Tahsin Deniz Aktürk and Çağın Ararat

Refugee migration networks and regulations: a multiclass, multipath variational inequality framework pp. 627-649

Anna Nagurney, Patrizia Daniele and Ladimer S. Nagurney

Volume 78, issue 2, 2020

Preface to the special issue “ICVNS 2018” pp. 239-240

Angelo Sifaleras, Nenad Mladenović and Panos M. Pardalos

Improved metaheuristics for the quartet method of hierarchical clustering pp. 241-270

Sergio Consoli, Jan Korst, Steffen Pauws and Gijs Geleijnse

The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods pp. 271-294

Chandra Ade Irawan, Said Salhi and Kusmaningrum Soemadi

GRASP with Variable Neighborhood Descent for the online order batching problem pp. 295-325

Sergio Gil-Borrás, Eduardo G. Pardo, Antonio Alonso-Ayuso and Abraham Duarte

Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem pp. 327-348

Panagiotis Kalatzantonakis, Angelo Sifaleras and Nikolaos Samaras

Modelling and solving the multi-quays berth allocation and crane assignment problem with availability constraints pp. 349-373

Issam Krimi, Raca Todosijević, Rachid Benmansour, Mustapha Ratli, Abdessamad Ait Cadi and Afaf Aloullal

Revenue maximization of Internet of things provider using variable neighbourhood search pp. 375-396

Vesna Radonjić Ɖogatović, Marko Ɖogatović, Milorad Stanojević and Nenad Mladenović

Volume 78, issue 1, 2020

DOMINO: Data-driven Optimization of bi-level Mixed-Integer NOnlinear Problems pp. 1-36

Burcu Beykal, Styliani Avraamidou, Ioannis P. E. Pistikopoulos, Melis Onel and Efstratios N. Pistikopoulos

Solving polyhedral d.c. optimization problems via concave minimization pp. 37-47

Simeon vom Dahl and Andreas Löhne

A general asymptotic function with applications in nonconvex optimization pp. 49-68

Nicolas Hadjisavvas, Felipe Lara and Dinh The Luc

Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions pp. 69-89

Wei Peng, Hui Zhang, Xiaoya Zhang and Lizhi Cheng

Two modified extragradient algorithms for solving variational inequalities pp. 91-106

Trinh Ngoc Hai

A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection pp. 107-136

Chen Chen, Ting Kei Pong, Lulin Tan and Liaoyuan Zeng

Development of an adaptive infill criterion for constrained multi-objective asynchronous surrogate-based optimization pp. 137-160

Jolan Wauters, Andy Keane and Joris Degroote

On the relation between the extended supporting hyperplane algorithm and Kelley’s cutting plane algorithm pp. 161-179

Felipe Serrano, Robert Schwarz and Ambros Gleixner

Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs pp. 181-205

Mengwei Xu and Jane J. Ye

Generalized risk parity portfolio optimization: an ADMM approach pp. 207-238

Giorgio Costa and Roy H. Kwon

Volume 77, issue 4, 2020

An enhanced logical benders approach for linear programs with complementarity constraints pp. 687-714

Francisco Jara-Moroni, John E. Mitchell, Jong-Shi Pang and Andreas Wächter

An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem pp. 715-742

Pascal Halffmann, Tobias Dietz, Anthony Przybylski and Stefan Ruzika

Delaunay-based derivative-free optimization via global surrogates. Part III: nonconvex constraints pp. 743-776

Ryan Alimo, Pooriya Beyhaghi and Thomas R. Bewley

Filter-based stochastic algorithm for global optimization pp. 777-805

M. Joseane F. G. Macêdo, Elizabeth W. Karas, M. Fernanda P. Costa and Ana Maria A. C. Rocha

Solution maps of polynomial variational inequalities pp. 807-824

Vu Trung Hieu

A sparse chance constrained portfolio selection model with multiple constraints pp. 825-852

Zhiping Chen, Shen Peng and Abdel Lisser

A stochastic approach to full inverse treatment planning for charged-particle therapy pp. 853-893

Marc C. Robini, Feng Yang and Yuemin Zhu

Capacitated assortment and price optimization under the nested logit model pp. 895-918

Rui Chen and Hai Jiang

Finding optimal points for expensive functions using adaptive RBF-based surrogate model via uncertainty quantification pp. 919-948

Ray-Bing Chen, Yuan Wang and C. F. Jeff Wu

A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model pp. 949-973

Bruno Q. Pinto, Celso C. Ribeiro, Isabel Rosseti and Thiago F. Noronha

Volume 77, issue 3, 2020

Optimality-based domain reduction for inequality-constrained NLP and MINLP problems pp. 425-454

Yi Zhang, Nikolaos V. Sahinidis, Carlos Nohra and Gang Rong

Mathematical programming formulations for piecewise polynomial functions pp. 455-486

Bjarne Grimstad and Brage R. Knudsen

Global dynamic optimization using edge-concave underestimator pp. 487-512

Ishan Bajaj and M. M. Faruque Hasan

Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures pp. 513-541

Sunyoung Kim, Masakazu Kojima and Kim-Chuan Toh

Subset selection for multiple linear regression via optimization pp. 543-574

Young Woong Park and Diego Klabjan

Primal-dual analysis for online interval scheduling problems pp. 575-602

Ge Yu and Sheldon H. Jacobson

Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization pp. 603-625

Yifu Chen and Christos T. Maravelias

Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization pp. 627-641

Nader Kanzi and Majid Soleimani-damaneh

Damped Newton’s method on Riemannian manifolds pp. 643-660

Marcio Antônio de A. Bortoloti, Teles A. Fernandes, Orizon P. Ferreira and Jinyun Yuan

Limiting Subdifferential Calculus and Perturbed Distance Function in Riemannian Manifolds pp. 661-685

M. Farrokhiniya and A. Barani

Volume 77, issue 2, 2020

New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm pp. 197-225

R. Paulavičius and C. S. Adjiman

Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem pp. 227-272

Santanu S. Dey, Burak Kocuk and Asteroide Santana

Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps pp. 273-287

Nithirat Sisarat, Rabian Wangkeeree and Tamaki Tanaka

Order cancellation law in the family of bounded convex sets pp. 289-300

J. Grzybowski and R. Urbański

Globally minimizing the sum of a convex–concave fraction and a convex function based on wave-curve bounds pp. 301-318

Yong Xia, Longfei Wang and Xiaohui Wang

Approximation algorithms for capacitated partial inverse maximum spanning tree problem pp. 319-340

Xianyue Li, Zhao Zhang, Ruowang Yang, Heping Zhang and Ding-Zhu Du

An exact completely positive programming formulation for the discrete ordered median problem: an extended version pp. 341-359

J. Puerto

Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem pp. 361-382

Md Sarowar Morshed, Md Saiful Islam and Md. Noor-E-Alam

An enhanced formulation for solving graph coloring problems with the Douglas–Rachford algorithm pp. 383-403

Francisco J. Aragón Artacho, Rubén Campoy and Veit Elser

Linear conditioning, weak sharpness and finite convergence for equilibrium problems pp. 405-424

Luong Nguyen, Qamrul Hasan Ansari and Xiaolong Qin

Volume 77, issue 1, 2020

Preface: Special issue Europt 2018 pp. 1-2

Eligius M. T. Hendrix and Leocadio G. Casado

An algorithmic approach to multiobjective optimization with decision uncertainty pp. 3-25

Gabriele Eichfelder, Julia Niebling and Stefan Rocktäschel

On generating the set of nondominated solutions of a linear programming problem with parameterized fuzzy numbers pp. 27-52

Manuel Arana-Jiménez and Carmen Sánchez-Gil

Distributed algorithms for convex problems with linear coupling constraints pp. 53-73

Tommaso Colombo and Simone Sagratella

The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming pp. 75-96

Pavlo Muts, Ivo Nowak and Eligius M. T. Hendrix

Block layer decomposition schemes for training deep neural networks pp. 97-124

Laura Palagi and Ruggiero Seccia

On ill-posedness and stability of tensor variational inequalities: application to an economic equilibrium pp. 125-141

Annamaria Barbagallo and Serena Guarino Lo Bianco

Optimality conditions for convex problems on intersections of non necessarily convex sets pp. 143-155

E. Allevi, Juan Enrique Martinez-Legaz and R. Riccardi

Global optimization of grillage-type foundations using a distributed genetic algorithm pp. 157-173

Mikalojus Ramanauskas, Dmitrij Šešok, Julius Žilinskas, Vadimas Starikovičius, Arnas Kačeniauskas and Rimantas Belevičius

Packing ovals in optimized regular polygons pp. 175-196

Frank J. Kampas, János D. Pintér and Ignacio Castillo