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 73, issue 4, 2019

Lifted polymatroid inequalities for mean-risk optimization with indicator variables pp. 677-699

Alper Atamtürk and Hyemin Jeon

Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming pp. 701-722

Tiago Andrade, Fabricio Oliveira, Silvio Hamacher and Andrew Eberhard

Packing circles into perimeter-minimizing convex hulls pp. 723-759

Josef Kallrath and Markus M. Frey

On the complexity of quasiconvex integer minimization problem pp. 761-788

A. Yu. Chirkov, D. V. Gribanov, D. S. Malyshev, P. M. Pardalos, S. I. Veselov and N. Yu. Zolotykh

A mixed integer programming approach to the tensor complementarity problem pp. 789-800

Shouqiang Du and Liping Zhang

MiKM: multi-step inertial Krasnosel’skiǐ–Mann algorithm and its applications pp. 801-824

Q. L. Dong, J. Z. Huang, X. H. Li, Y. J. Cho and Th. M. Rassias

Generalized forward–backward splitting with penalization for monotone inclusion problems pp. 825-847

Nimit Nimana and Narin Petrot

A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models pp. 849-868

Le Hai Yen, Nguyen Thi Thanh Huyen and Le Dung Muu

Properties of the nonlinear scalar functional and its applications to vector optimization problems pp. 869-889

Ying Gao and Xin-Min Yang

On the hierarchical structure of Pareto critical sets pp. 891-913

Bennet Gebken, Sebastian Peitz and Michael Dellnitz

Volume 73, issue 3, 2019

Tighter $$\alpha $$ α BB relaxations through a refinement scheme for the scaled Gerschgorin theorem pp. 467-483

Dimitrios Nerantzis and Claire S. Adjiman

SDP-based branch-and-bound for non-convex quadratic integer optimization pp. 485-514

Christoph Buchheim, Maribel Montenegro and Angelika Wiegele

A generic interval branch and bound algorithm for parameter estimation pp. 515-535

Bertrand Neveu, Martin Gorce, Pascal Monasse and Gilles Trombettoni

On the spherical convexity of quadratic functions pp. 537-545

O. P. Ferreira and S. Z. Németh

Rigorous packing of unit squares into a circle pp. 547-565

Tiago Montanher, Arnold Neumaier, Mihály Csaba Markót, Ferenc Domes and Hermann Schichl

A topological convergence on power sets well-suited for set optimization pp. 567-581

Michel H. Geoffroy

Efficient global optimization of constrained mixed variable problems pp. 583-613

Julien Pelamatti, Loïc Brevault, Mathieu Balesdent, El-Ghazali Talbi and Yannick Guerin

Conditional optimization of a noisy function using a kriging metamodel pp. 615-636

Diariétou Sambakhé, Lauriane Rouan, Jean-Noël Bacro and Eric Gozé

Novel self-adaptive algorithms for non-Lipschitz equilibrium problems with applications pp. 637-657

Pham Ky Anh and Trinh Ngoc Hai

Revisiting norm optimization for multi-objective black-box problems: a finite-time analysis pp. 659-673

Abdullah Al-Dujaili and S. Suresh

Book Review: Xinbao Liu, Jun Pei, Lin Liu, Hao Cheng, Mi Zhou, and Panos M. Pardalos: Optimization and management in manufacturing engineering. Resource collaborative optimization and management through the Internet of Things. Springer optimization and its applications series pp. 675-676

John Birge

Volume 73, issue 2, 2019

Global optimization issues in deep network regression: an overview pp. 239-277

Laura Palagi

A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning pp. 279-310

Hoai An Le Thi, Vinh Thanh Ho and Tao Pham Dinh

A fast algorithm for globally solving Tikhonov regularized total least squares problem pp. 311-330

Yong Xia, Longfei Wang and Meijia Yang

Iteration-complexity analysis of a generalized alternating direction method of multipliers pp. 331-348

V. A. Adona, M. L. N. Gonçalves and J. G. Melo

Geometric properties for level sets of quadratic functions pp. 349-369

Huu-Quang Nguyen and Ruey-Lin Sheu

A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming pp. 371-388

Cheng Lu, Zhibin Deng, Jing Zhou and Xiaoling Guo

Robot path planning in a dynamic environment with stochastic measurements pp. 389-410

Adriano Zanin Zambom, Brian Seguin and Feifei Zhao

An inexact splitting method for the subspace segmentation from incomplete and noisy observations pp. 411-429

Renli Liang, Yanqin Bai and Hai Xiang Lin

Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor pp. 431-446

Ryuta Tamura, Ken Kobayashi, Yuichi Takano, Ryuhei Miyashiro, Kazuhide Nakata and Tomomi Matsui

Well-posedness and scalarization in set optimization involving ordering cones with possibly empty interior pp. 447-463

Meenakshi Gupta and Manjari Srivastava

Correction to: Optimal deterministic algorithm generation pp. 465-465

Alexander Mitsos, Jaromił Najman and Ioannis G. Kevrekidis

Volume 73, issue 1, 2019

Global optimization of generalized semi-infinite programs using disjunctive programming pp. 1-25

Peter Kirst and Oliver Stein

A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs pp. 27-57

Dajun Yue, Jiyao Gao, Bo Zeng and Fengqi You

Spectral projected gradient method for stochastic optimization pp. 59-81

Nataša Krejić and Nataša Krklec Jerinkić

A Lyapunov-type approach to convergence of the Douglas–Rachford algorithm for a nonconvex setting pp. 83-112

Minh N. Dao and Matthew K. Tam

Convergence-order analysis for differential-inequalities-based bounds and relaxations of the solutions of ODEs pp. 113-151

Spencer D. Schaber, Joseph K. Scott and Paul I. Barton

The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra pp. 153-169

Xiaoni Chi, M. Seetharama Gowda and Jiyuan Tao

A Bayesian optimization approach to find Nash equilibria pp. 171-192

Victor Picheny, Mickael Binois and Abderrahmane Habbal

The least squares solution of a class of generalized Sylvester-transpose matrix equations with the norm inequality constraint pp. 193-221

Baohua Huang and Changfeng Ma

Numbers of the connected components of the solution sets of monotone affine vector variational inequalities pp. 223-237

Vu Trung Hieu

Volume 72, issue 4, 2018

Maximum-entropy sampling and the Boolean quadric polytope pp. 603-618

Kurt M. Anstreicher

Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems pp. 619-653

N. Ito, S. Kim, M. Kojima, A. Takeda and K.-C. Toh

Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers pp. 655-678

T. D. Chuong and V. Jeyakumar

Equivalent Lipschitz surrogates for zero-norm and rank optimization problems pp. 679-704

Yulan Liu, Shujun Bi and Shaohua Pan

A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique pp. 705-729

W. Geremew, N. M. Nam, A. Semenov, V. Boginski and E. Pasiliao

Tractability of convex vector optimization problems in the sense of polyhedral approximations pp. 731-742

Firdevs Ulus

Variational inequality formulation for the games with random payoffs pp. 743-760

Vikas Vikram Singh and Abdel Lisser

A class of differential hemivariational inequalities in Banach spaces pp. 761-779

Stanisław Migórski and Shengda Zeng

Methods to compare expensive stochastic optimization algorithms with random restarts pp. 781-801

Warren Hare, Jason Loeppky and Shangwei Xie

Volume 72, issue 3, 2018

Globally solving a class of optimal power flow problems in radial networks by tree reduction pp. 373-402

Amir Beck, Yuval Beck, Yoash Levron, Alex Shtof and Luba Tetruashvili

Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints pp. 403-429

Outi Montonen and Kaisa Joki

A note on the Douglas–Rachford splitting method for optimization problems involving hypoconvex functions pp. 431-441

Ke Guo and Deren Han

Linear convergence of the generalized Douglas–Rachford algorithm for feasibility problems pp. 443-474

Minh N. Dao and Hung M. Phan

On upper approximations of Pareto fronts pp. 475-490

I. Kaliszewski and J. Miroforidis

Enhancing quantum efficiency of thin-film silicon solar cells by Pareto optimality pp. 491-515

Andrea Patanè, Andrea Santoro, Vittorio Romano, Antonino La Magna and Giuseppe Nicosia

The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation pp. 517-538

Yixin Zhao, Torbjörn Larsson, Elina Rönnberg and Panos M. Pardalos

Optimal channel assignment and L(p, 1)-labeling pp. 539-552

Junlei Zhu, Yuehua Bu, Miltiades P. Pardalos, Hongwei Du, Huijuan Wang and Bin Liu

An abstract proximal point algorithm pp. 553-577

Laurenţiu Leuştean, Adriana Nicolae and Andrei Sipoş

Limit vector variational inequality problems via scalarization pp. 579-590

M. Bianchi, Igor Konnov and R. Pini

On maximal monotonicity of bifunctions on Hadamard manifolds pp. 591-601

J. X. Cruz Neto, F. M. O. Jacinto, P. A. Soares and J. C. O. Souza

Volume 72, issue 2, 2018

On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation pp. 129-153

Emily Speakman and Jon Lee

Unifying local–global type properties in vector optimization pp. 155-179

Ovidiu Bagdasar and Nicolae Popovici

A simplicial homology algorithm for Lipschitz optimisation pp. 181-217

Stefan C. Endres, Carl Sandrock and Walter W. Focke

A nonconvex quadratic optimization approach to the maximum edge weight clique problem pp. 219-240

Seyedmohammadhossein Hosseinian, Dalila B. M. M. Fontes and Sergiy Butenko

Exploiting algebraic structure in global optimization and the Belgian chocolate problem pp. 241-254

Zachary Charles and Nigel Boston

Global optimization of nonconvex problems with convex-transformable intermediates pp. 255-276

Carlos J. Nohra and Nikolaos V. Sahinidis

Convex envelopes of bivariate functions through the solution of KKT systems pp. 277-303

Marco Locatelli

Decomposition-based Inner- and Outer-Refinement Algorithms for Global Optimization pp. 305-321

Ivo Nowak, Norman Breitfeld, Eligius M. T. Hendrix and Grégoire Njacheun-Njanzoua

MultiGLODS: global and local multiobjective optimization using direct search pp. 323-345

A. L. Custódio and J. F. A. Madeira

A vector linear programming approach for certain global optimization problems pp. 347-372

Daniel Ciripoi, Andreas Löhne and Benjamin Weißing

Volume 72, issue 1, 2018

Preface: Special issue dedicated to Distance Geometry pp. 1-4

Farid Alizadeh, Douglas Gonçalves, Nathan Krislock and Leo Liberti

Low-rank matrix completion using nuclear norm minimization and facial reduction pp. 5-26

Shimeng Huang and Henry Wolkowicz

The minimum distance superset problem: formulations and algorithms pp. 27-53

Leonardo Fontoura, Rafael Martinelli, Marcus Poggi and Thibaut Vidal

A new algorithm for the small-field astrometric point-pattern matching problem pp. 55-70

Cláudio P. Santiago, Carlile Lavor, Sérgio Assunção Monteiro and Alberto Kroner-Martins

Minimal curvature-constrained networks pp. 71-87

D. Kirszenblat, K. G. Sirinanda, M. Brazil, P. A. Grossman, J. H. Rubinstein and D. A. Thomas

Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations pp. 89-107

Luiz H. Cherri, Adriana C. Cherri and Edilaine M. Soler

Tuning interval Branch-and-Prune for protein structure determination pp. 109-127

Bradley Worley, Florent Delhommel, Florence Cordier, Thérèse E. Malliavin, Benjamin Bardiaux, Nicolas Wolff, Michael Nilges, Carlile Lavor and Leo Liberti