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

Volume 76, issue 4, 2020

Preface: special issue of MOA 2018 pp. 661-663

Ya-Feng Liu, Fengmin Xu, Neng Fan and Jiming Peng

A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems pp. 665-693

Kai Tu, Haibin Zhang, Huan Gao and Junkai Feng

The seeding algorithms for spherical k-means clustering pp. 695-708

Min Li, Dachuan Xu, Dongmei Zhang and Juan Zou

A Euclidean distance matrix model for protein molecular conformation pp. 709-728

Fengzhen Zhai and Qingna Li

Non-submodular maximization on massive data streams pp. 729-743

Yijing Wang, Dachuan Xu, Yishui Wang and Dongmei Zhang

A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems pp. 745-768

Qian Liu, Yuqing Xu and Yang Zhou

An active set Barzilar–Borwein algorithm for $$l_{0}$$l0 regularized optimization pp. 769-791

Wanyou Cheng, Zixin Chen and Qingjie Hu

An ADMM-based location–allocation algorithm for nonconvex constrained multi-source Weber problem under gauge pp. 793-818

Jianlin Jiang, Su Zhang, Yibing Lv, Xin Du and Ziwei Yan

Accelerated iterative hard thresholding algorithm for $$l_0$$l0 regularized regression problem pp. 819-840

Fan Wu and Wei Bian

A derivative-free algorithm for spherically constrained optimization pp. 841-861

Min Xi, Wenyu Sun, Yannan Chen and Hailin Sun

A Gauss–Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems pp. 863-887

Xue Gao, Xingju Cai and Deren Han

A descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors pp. 889-911

Minru Bai, Jing Zhao and ZhangHui Zhang

Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting pp. 913-932

Florian Jarre, Felix Lieder, Ya-Feng Liu and Cheng Lu

Volume 76, issue 3, 2020

Preface pp. 453-454

Alexander Kononov, Alexander Strekalovsky, Mikhail Posypkin and Artem Pyatkin

Cooperation in dynamic multicriteria games with random horizons pp. 455-470

Anna N. Rettieva

Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost pp. 471-490

Akiyoshi Shioura, Natalia V. Shakhlevich and Vitaly A. Strusevich

Approximating the 2-machine flow shop problem with exact delays taking two values pp. 491-497

Alexander Ageev

A model for optimization of transport infrastructure for some homogeneous goods markets pp. 499-518

Alexander Vasin, Olesya Grigoryeva and Nikita Tsyganov

A special three-level optimization problem pp. 519-531

S. Dempe, O. Khamisov and Yu. Kochetov

Extension technology and extrema selections in a stochastic multistart algorithm for optimal control problems pp. 533-543

Alexander Yu. Gornov, Tatiana S. Zarodnyuk, Anton S. Anikin and Evgeniya A. Finkelstein

The maximum independent union of cliques problem: complexity and exact approaches pp. 545-562

Zeynep Ertem, Eugene Lykhovyd, Yiming Wang and Sergiy Butenko

Multidimensional frontier visualization based on optimization methods using parallel computations pp. 563-574

Alexander P. Afanasiev, Vladimir E. Krivonozhko, Andrey V. Lychev and Oleg V. Sukhoroslov

Consensus and balancing on the three-sphere pp. 575-586

Aladin Crnkić and Vladimir Jaćimović

On feedback strengthening of the maximum principle for measure differential equations pp. 587-612

Maxim Staritsyn and Stepan Sorokin

Sparse solutions of optimal control via Newton method for under-determined systems pp. 613-623

Boris Polyak and Andrey Tremba

Optimality conditions for optimal impulsive control problems with multipoint state constraints pp. 625-644

Olga N. Samsonyuk

A puzzled driver is a better driver: enforcing speed limits using a randomization strategy pp. 645-660

Michael Dreyfuss and Irit Nowik

Volume 76, issue 2, 2020

Multi-objective optimization models in finance and investments pp. 243-244

Michalis Doumpos and Constantin Zopounidis

An optimization–diversification approach to portfolio selection pp. 245-265

Francesco Cesarone, Andrea Scozzari and Fabio Tardella

Global minimum variance portfolios under uncertainty: a robust optimization approach pp. 267-293

Sandra Caçador, Joana Dias and Pedro Godinho

Preference-based evolutionary multi-objective optimization for portfolio selection: a new credibilistic model under investor preferences pp. 295-315

Ana B. Ruiz, Rubén Saborido, José D. Bermúdez, Mariano Luque and Enriqueta Vercher

Tailor-made thematic portfolios: a core satellite optimization pp. 317-331

Florian Methling and Rüdiger Nitzsch

A stochastic goal programming model to derive stable cash management policies pp. 333-346

Francisco Salas-Molina, Juan A. Rodriguez-Aguilar and David Pla-Santamaria

The joint replenishment problem with trade credits pp. 347-382

Jen-Yen Lin and Ming-Jong Yao

Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices pp. 383-405

João Gouveia, Ting Kei Pong and Mina Saee

Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization pp. 407-431

Javad Koushki and Majid Soleimani-damaneh

Convergence analysis of a projection algorithm for variational inequality problems pp. 433-452

Biao Qu, Changyu Wang and Fanwen Meng

Volume 76, issue 1, 2020

Convex envelope of bivariate cubic functions over rectangular regions pp. 1-24

Marco Locatelli

New global optimality conditions for nonsmooth DC optimization problems pp. 25-55

M. V. Dolgopolik

Optimality conditions for an exhausterable function on an exhausterable set pp. 57-67

Majid E. Abbasov

On the choice of the low-dimensional domain for global optimization via random embeddings pp. 69-90

Mickaël Binois, David Ginsbourger and Olivier Roustant

Steklov regularization and trajectory methods for univariate global optimization pp. 91-120

Orhan Arıkan, Regina S. Burachik and C. Yalçın Kaya

Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere pp. 121-135

Nguyen Van-Bong, Thi Ngan Nguyen and Ruey-Lin Sheu

A residual-based algorithm for solving a class of structured nonsmooth optimization problems pp. 137-153

Lei Wu

The decompositions with respect to two core non-symmetric cones pp. 155-188

Yue Lu, Ching-Yu Yang, Jein-Shan Chen and Hou-Duo Qi

Solving k-center problems involving sets based on optimization techniques pp. 189-209

Nguyen Thai An, Nguyen Mau Nam and Xiaolong Qin

Multimode resource-constrained project scheduling in flexible projects pp. 211-241

Zsolt T. Kosztyán and István Szalkai