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

Volume 74, issue 4, 2019

Preface pp. 597-598

Sergiy Butenko and Efstratios N. Pistikopoulos

Bi-objective decision making in global optimization based on statistical models pp. 599-609

Antanas Žilinskas and James Calvin

Tuning BARON using derivative-free optimization algorithms pp. 611-637

Jianfeng Liu, Nikolaos Ploskas and Nikolaos V. Sahinidis

An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs pp. 639-675

Harsha Nagarajan, Mowen Lu, Site Wang, Russell Bent and Kaarthik Sundar

On tightness and anchoring of McCormick and other relaxations pp. 677-703

Jaromił Najman and Alexander Mitsos

A multi-term, polyhedral relaxation of a 0–1 multilinear function for Boolean logical pattern generation pp. 705-735

Kedong Yan and Hong Seo Ryoo

Geometric conditions of reduction of exhausters pp. 737-751

Majid E. Abbasov

Invex optimization revisited pp. 753-782

Ksenia Bestuzheva and Hassan Hijazi

On the chance-constrained minimum spanning k-core problem pp. 783-801

Juan Ma and Balabhaskar Balasundaram

Critical nodes in interdependent networks with deterministic and probabilistic cascading failures pp. 803-838

Alexander Veremyev, Konstantin Pavlikov, Eduardo L. Pasiliao, My T. Thai and Vladimir Boginski

A cutting plane method for risk-constrained traveling salesman problem with random arc costs pp. 839-859

Zhouchun Huang, Qipeng Phil Zheng, Eduardo Pasiliao, Vladimir Boginski and Tao Zhang

Hybrid clustering based on content and connection structure using joint nonnegative matrix factorization pp. 861-877

Rundong Du, Barry Drake and Haesun Park

Joint production and transportation scheduling in flexible manufacturing systems pp. 879-908

Dalila B. M. M. Fontes and Seyed Mahdi Homayouni

Local search approximation algorithms for the sum of squares facility location problems pp. 909-932

Dongmei Zhang, Dachuan Xu, Yishui Wang, Peng Zhang and Zhenning Zhang

Volume 74, issue 3, 2019

Facets of a mixed-integer bilinear covering set with bounds on variables pp. 417-442

Hamidur Rahman and Ashutosh Mahajan

Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems pp. 443-465

Styliani Avraamidou and Efstratios N. Pistikopoulos

Large proper gaps in bin packing and dual bin packing problems pp. 467-476

Vadim M. Kartak and Artem V. Ripatti

Solving the multistage PMU placement problem by integer programming and equivalent network design model pp. 477-493

Ou Sun and Neng Fan

Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions pp. 495-522

Britta Schulze, Kathrin Klamroth and Michael Stiglmayr

On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems pp. 523-548

Shuvomoy Das Gupta and Lacra Pavel

Variable neighborhood search for stochastic linear programming problem with quantile criterion pp. 549-564

Sergey V. Ivanov, Andrey I. Kibzun, Nenad Mladenović and Dragan Urošević

Optimal control problems with states of bounded variation and hysteresis pp. 565-596

Olga N. Samsonyuk and Sergey A. Timoshin

Volume 74, issue 2, 2019

NAUTILUS Navigator: free search interactive multiobjective optimization without trading-off pp. 213-231

Ana B. Ruiz, Francisco Ruiz, Kaisa Miettinen, Laura Delgado-Antequera and Vesa Ojalehto

Necessary and sufficient conditions for achieving global optimal solutions in multiobjective quadratic fractional optimization problems pp. 233-253

Washington Alves Oliveira, Marko Antonio Rojas-Medar, Antonio Beato-Moreno and Maria Beatriz Hernández-Jiménez

Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs pp. 255-284

H. Boualam and A. Roubi

Weighted LCPs and interior point systems for copositive linear transformations on Euclidean Jordan algebras pp. 285-295

M. Seetharama Gowda

Solving inverse optimal control problems via value functions to global optimality pp. 297-325

Stephan Dempe, Felix Harder, Patrick Mehlitz and Gerd Wachsmuth

Two-layer adaptive surrogate-assisted evolutionary algorithm for high-dimensional computationally expensive problems pp. 327-359

Zan Yang, Haobo Qiu, Liang Gao, Chen Jiang and Jinhao Zhang

Variants of the Ekeland variational principle for approximate proper solutions of vector equilibrium problems pp. 361-382

L. P. Hai, L. Huerga, P. Q. Khanh and V. Novo

Stability in unified semi-infinite vector optimization pp. 383-399

Shiva Kapoor and C. S. Lalitha

When is there a representer theorem? pp. 401-415

Kevin Schlegel

Volume 74, issue 1, 2019

Enhancing interval constraint propagation by identifying and filtering n-ary subsystems pp. 1-20

Ignacio Araya and Victor Reyes

Minimum variance allocation among constrained intervals pp. 21-44

Hsin-Min Sun and Ruey-Lin Sheu

On three soft rectangle packing problems with guillotine constraints pp. 45-62

Quoc Trung Bui, Thibaut Vidal and Minh Hoàng Hà

Application of the DIRECT algorithm to searching for an optimal k-partition of the set $$\mathcal {A}\subset \mathbb {R}^n$$ A ⊂ R n and its application to the multiple circle detection problem pp. 63-77

Rudolf Scitovski and Kristian Sabo

The Douglas–Rachford algorithm for a hyperplane and a doubleton pp. 79-93

Heinz H. Bauschke, Minh N. Dao and Scott B. Lindstrom

Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems pp. 95-119

Howard Heaton and Yair Censor

A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality pp. 121-160

Sorin-Mihai Grad and Oleg Wilfer

Necessary optimality conditions for a nonsmooth semi-infinite programming problem pp. 161-168

Nazih Abderrazzak Gadhi

The locally Chen–Harker–Kanzow–Smale smoothing functions for mixed complementarity problems pp. 169-193

Zhengyong Zhou and Yunchan Peng

A unified minimal solution in set optimization pp. 195-211

Khushboo and C. S. Lalitha