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

Volume 75, issue 4, 2019

A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs pp. 885-919

T. D. Chuong, V. Jeyakumar and G. Li

A finite $$\epsilon $$ϵ-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables pp. 921-947

Can Li and Ignacio E. Grossmann

A manifold-based approach to sparse global constraint satisfaction problems pp. 949-971

Ali Baharev, Arnold Neumaier and Hermann Schichl

Noisy Euclidean distance matrix completion with a single missing node pp. 973-1002

Stefan Sremac, Fei Wang, Henry Wolkowicz and Lucas Pettersson

Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions pp. 1003-1028

Yaohua Hu, Carisa Kwok Wai Yu and Xiaoqi Yang

Inexact proximal $$\epsilon $$ϵ-subgradient methods for composite convex optimization problems pp. 1029-1060

R. Díaz Millán and M. Pentón Machado

Stability of a convex feasibility problem pp. 1061-1077

Carlo Alberto Bernardi, Enrico Miglierina and Elena Molho

Surrogate-assisted Bounding-Box approach for optimization problems with tunable objectives fidelity pp. 1079-1109

M. Rivier and P. M. Congedo

Online hole healing for sensor coverage pp. 1111-1131

Zhao Zhang, Zaixin Lu, Xianyue Li, Xiaohui Huang and Ding-Zhu Du

Approximation algorithm for the partial set multi-cover problem pp. 1133-1146

Yishuo Shi, Yingli Ran, Zhao Zhang, James Willson, Guangmo Tong and Ding-Zhu Du

Volume 75, issue 3, 2019

Tighter McCormick relaxations through subgradient propagation pp. 565-593

Jaromił Najman and Alexander Mitsos

A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs pp. 595-629

Emmanuel Ogbe and Xiang Li

Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods pp. 631-654

Masaki Kimizuka, Sunyoung Kim and Makoto Yamashita

A new algorithm for concave quadratic programming pp. 655-681

Moslem Zamani

Solving the equality-constrained minimization problem of polynomial functions pp. 683-733

Shuijing Xiao and Guangxing Zeng

Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems pp. 735-766

Michel Minoux and Riadh Zorgati

On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems pp. 767-787

Bo Wen and Xiaoping Xue

Generalized polyhedral convex optimization problems pp. 789-811

Nguyen Ngoc Luan and Jen-Chih Yao

Convergence and correctness of belief propagation for the Chinese postman problem pp. 813-831

Guowei Dai, Fengwei Li, Yuefang Sun, Dachuan Xu and Xiaoyan Zhang

Parametric monotone function maximization with matroid constraints pp. 833-849

Suning Gong, Qingqin Nong, Wenjing Liu and Qizhi Fang

Systemic risk governance in a dynamical model of a banking system pp. 851-883

Lorella Fatone and Francesca Mariani

Volume 75, issue 2, 2019

Nonconvex min–max fractional quadratic problems under quadratic constraints: copositive relaxations pp. 227-245

Paula Alexandra Amaral and Immanuel M. Bomze

A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables pp. 247-272

Can Li and Ignacio E. Grossmann

Fractional 0–1 programs: links between mixed-integer linear and conic quadratic formulations pp. 273-339

Erfan Mehmanchi, Andrés Gómez and Oleg A. Prokopyev

Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints pp. 341-392

Hatim Djelassi, Moll Glass and Alexander Mitsos

A scalable global optimization algorithm for stochastic nonlinear programs pp. 393-416

Yankai Cao and Victor M. Zavala

A hierarchy of semidefinite relaxations for completely positive tensor optimization problems pp. 417-437

Anwa Zhou and Jinyan Fan

Global supply chain networks and tariff rate quotas: equilibrium analysis with application to agricultural products pp. 439-460

Anna Nagurney, Deniz Besik and Ladimer S. Nagurney

Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming pp. 461-494

Rujun Jiang and Duan Li

Packing ellipses in an optimized convex polygon pp. 495-522

A. Pankratov, T. Romanova and I. Litvinchev

Proximal bundle methods for nonsmooth DC programming pp. 523-563

Welington Oliveira

Volume 75, issue 1, 2019

Preface on the Special Issue Global Optimization with Multiple Criteria: Theory, Methods and Applications pp. 1-2

Kaisa Miettinen and Francisco Ruiz

Efficient computation of expected hypervolume improvement using box decomposition algorithms pp. 3-34

Kaifeng Yang, Michael Emmerich, André Deutz and Thomas Bäck

An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems pp. 35-62

Ozgu Turgut, Evrim Dalkiran and Alper E. Murat

Nonmonotone line searches for unconstrained multiobjective optimization problems pp. 63-90

Kanako Mita, Ellen H. Fukuda and Nobuo Yamashita

Nonlinear biobjective optimization: improvements to interval branch & bound algorithms pp. 91-110

Ignacio Araya, Jose Campusano and Damir Aliquintui

Necessary conditions for weak efficiency for nonsmooth degenerate multiobjective optimization problems pp. 111-129

Elena Constantin

Weak minimal elements and weak minimal solutions of a nonconvex set-valued optimization problem pp. 131-141

M. Chinaie, F. Fakhar, M. Fakhar and H. R. Hajisharifi

Coherent weights for pairwise comparison matrices and a mixed-integer linear programming problem pp. 143-161

Bice Cavallo

A coercivity condition for nonmonotone quasiequilibria on finite-dimensional spaces pp. 163-176

M. Castellani and M. Giuli

Quasi-equilibrium problems with non-self constraint map pp. 177-197

John Cotrina and Javier Zúñiga

Trajectory optimization using quantum computing pp. 199-225

Alok Shukla and Prakash Vedula