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 56, issue 4, 2013

Preface: Special issue of Journal of Global Optimization for the 8th international conference on optimization: techniques and applications pp. 1295-1296

Xiaoling Sun, Duan Li and Shuzhong Zhang

Establishing Nash equilibrium of the manufacturer–supplier game in supply chain management pp. 1297-1312

James Ang, Masao Fukushima, Fanwen Meng, Takahiro Noda and Jie Sun

Convergence analysis of power penalty method for American bond option pricing pp. 1313-1323

K. Zhang and K. Teo

A cross-monotonic cost-sharing scheme for the concave facility location game pp. 1325-1334

Gaidi Li, Yu Li, Jia Shu and Dachuan Xu

On a generalized Cournot oligopolistic competition game pp. 1335-1345

Simai He, Xiaoguo Wang and Shuzhong Zhang

A pair of positive solutions for the Dirichlet p(z)-Laplacian with concave and convex nonlinearities pp. 1347-1360

Leszek Gasiński and Nikolaos Papageorgiou

An adaptive domain decomposition method for the Hamilton–Jacobi–Bellman equation pp. 1361-1373

H. Alwardi, S. Wang and L. Jennings

System modeling and performance analysis of the power saving class type II in BWA networks pp. 1375-1391

Shunfu Jin and Wuyi Yue

Binary classification via spherical separator by DC programming and DCA pp. 1393-1407

Hoai Le Thi, Hoai Le, Tao Pham Dinh and Ngai Van Huynh

Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems pp. 1409-1423

X. Cui, X. Zheng, S. Zhu and X. Sun

On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graph pp. 1425-1440

J. Filar, M. Haythorpe and W. Murray

A polynomial case of the cardinality-constrained quadratic optimization problem pp. 1441-1455

Jianjun Gao and Duan Li

A note on a selfish bin packing problem pp. 1457-1462

Ruixin Ma, György Dósa, Xin Han, Hing-Fung Ting, Deshi Ye and Yong Zhang

Approximate KKT points and a proximity measure for termination pp. 1463-1499

Joydeep Dutta, Kalyanmoy Deb, Rupesh Tulshyan and Ramnik Arora

Convergence of a class of penalty methods for constrained scalar set-valued optimization pp. 1501-1513

Xiaoqi Huang

Continuity of the solution mapping to parametric generalized vector equilibrium problems pp. 1515-1528

Bin Chen and Nan-jing Huang

Strong convergence theorems for variational inequality problems and fixed point problems in uniformly smooth and uniformly convex Banach spaces pp. 1529-1542

Gang Cai and Shangquan Bu

A new iterative scheme for fixed point problems of infinite family of κ i -pseudo contractive mappings, equilibrium problem, variational inequality problems pp. 1543-1562

Atid Kangtunyakarn

An iterative algorithm for common fixed points for nonexpansive semigroups and strictly pseudo-contractive mappings with optimization problems pp. 1563-1589

Phayap Katchang and Poom Kumam

Halpern’s type iterations with perturbations in Hilbert spaces: equilibrium solutions and fixed points pp. 1591-1601

Chih-Sheng Chuang, Lai-Jiu Lin and Wataru Takahashi

Efficient Nash equilibria on semilattices pp. 1603-1615

Walter Briec, Charles Horvath and QiBin Liang

Hadamard well-posedness of a general mixed variational inequality in Banach space pp. 1617-1629

Xiao-bo Li and Fu-quan Xia

Strong convergence theorems for approximating common fixed points of families of nonexpansive mappings and applications pp. 1631-1651

D. Sahu, V. Colao and G. Marino

Constant-approximation for optimal data aggregation with physical interference pp. 1653-1666

Hongwei Du, Zhao Zhang, Weili Wu, Lidong Wu and Kai Xing

Best proximity point theorems for cyclic strongly quasi-contraction mappings pp. 1667-1674

A. Amini-Harandi

Strong convergence theorem for nonexpansive semigroups and systems of equilibrium problems pp. 1675-1688

Yekini Shehu

On Olaleru’s open problem on Gregus fixed point theorem pp. 1689-1697

Sirous Moradi and Ali Farajzadeh

Best proximity point theorems: exposition of a significant non-linear programming problem pp. 1699-1705

S. Sadiq Basha, N. Shahzad and R. Jeyaraj

Filippov–Pliss lemma and m-dissipative differential inclusions pp. 1707-1717

Qamar Din, Tzanko Donchev and Dimitar Kolev

A quasi-multistart framework for global optimization of expensive functions using response surface models pp. 1719-1753

Rommel Regis and Christine Shoemaker

An extension of the Basic Constraint Qualification to nonconvex vector optimization problems pp. 1755-1771

Bienvenido Jiménez, Vicente Novo and Miguel Sama

Examples of inconsistency in optimization by expected improvement pp. 1773-1790

Dmitry Yarotsky

A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions pp. 1791-1815

Jaroslav Fowkes, Nicholas Gould and Chris Farmer

Volume 56, issue 3, 2013

Toulouse Global optimization Workshop 2010 (TOGO10) pp. 757-759

Sonia Cafieri, Leo Liberti and Frédéric Messine

When only global optimization matters pp. 761-763

Jean-Baptiste Hiriart-Urruty

A general framework for convexity analysis in deterministic global optimization pp. 765-785

Ralph Kearfott, Jessie Castille and Gaurav Tyagi

Bound reduction using pairs of linear inequalities pp. 787-819

Pietro Belotti

On estimating workload in interval branch-and-bound global optimization algorithms pp. 821-844

José Berenguel, L. Casado, I. García and Eligius Hendrix

Global convergence and the Powell singular function pp. 845-853

Trond Steihaug and Sara Suleiman

The interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances pp. 855-871

Carlile Lavor, Leo Liberti and Antonio Mucherino

A light-propagation model for aircraft trajectory planning pp. 873-895

Nourelhouda Dougui, Daniel Delahaye, Stéphane Puechmorel and Marcel Mongeau

Strong formulations for the pooling problem pp. 897-916

Mohammed Alfaki and Dag Haugland

A multi-commodity flow formulation for the generalized pooling problem pp. 917-937

Mohammed Alfaki and Dag Haugland

Large-scale standard pooling problems with constrained pools and fixed demands pp. 939-956

Manuel Ruiz, Olivier Briant, Jean-Maurice Clochard and Bernard Penz

On the minimum volume simplex enclosure problem for estimating a linear mixing model pp. 957-970

E. Hendrix, I. García, J. Plaza and A. Plaza

On a continuous approach for the maximum weighted clique problem pp. 971-981

Tatyana Gruzdeva

A two-level evolutionary algorithm for solving the facility location and design (1|1)-centroid problem on the plane with variable demand pp. 983-1005

J. Redondo, A. Arrondo, J. Fernández, I. García and P. Ortigosa

Maximal perimeter, diameter and area of equilateral unit-width convex polygons pp. 1007-1016

Charles Audet and Jordan Ninin

Finding largest small polygons with GloptiPoly pp. 1017-1028

Didier Henrion and Frédéric Messine

A global optimization algorithm for solving the minimum multiple ratio spanning tree problem pp. 1029-1043

Oleksii Ursulenko, Sergiy Butenko and Oleg Prokopyev

Generalized S-Lemma and strong duality in nonconvex quadratic programming pp. 1045-1072

H. Tuy and H. Tuan

Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables pp. 1073-1100

Tomohiko Mizutani and Makoto Yamashita

On interval branch-and-bound for additively separable functions with common variables pp. 1101-1121

J. Berenguel, L. Casado, I. García, E. Hendrix and F. Messine

Branch-reduction-bound algorithm for generalized geometric programming pp. 1123-1142

Peiping Shen and Xiaoai Li

DIS-CARD: a new method of multiple criteria sorting to classes with desired cardinality pp. 1143-1166

Miłosz Kadziński and Roman Słowiński

Increasing the attraction area of the global minimum in the binary optimization problem pp. 1167-1185

Iakov Karandashev and Boris Kryzhanovsky

Packing non-identical circles within a rectangle with open length pp. 1187-1215

Yaohua He and Yong Wu

Constrained derivative-free optimization on thin domains pp. 1217-1232

J. Martínez and F. Sobral

Linear scaling and the DIRECT algorithm pp. 1233-1245

Qunfeng Liu

Derivative-free optimization: a review of algorithms and comparison of software implementations pp. 1247-1293

Luis Rios and Nikolaos Sahinidis

Volume 56, issue 2, 2013

Preface: Special issue of JOGO MEC EurOPT 2010-Izmir pp. 217-218

Refail Kasimbeyli, Musa Mammadov and Cemali Dinçer

Self-learning K-means clustering: a global optimization approach pp. 219-232

Z. Volkovich, D. Toledano-Kitai and G.-W. Weber

The new robust conic GPLM method with an application to finance: prediction of credit default pp. 233-249

Ayşe Özmen, Gerhard-Wilhelm Weber, Zehra Çavuşoğlu and Özlem Defterli

Global stabilization in nonlinear discrete systems with time-delay pp. 251-263

Anatoli Ivanov, Musa Mammadov and Sergei Trofimchuk

A hybrid global optimization algorithm for non-linear least squares regression pp. 265-277

Antanas Žilinskas and Julius Žilinskas

A conic scalarization method in multi-objective optimization pp. 279-297

Refail Kasimbeyli

Optimality conditions for a unified vector optimization problem with not necessarily preordering relations pp. 299-315

Fabián Flores-Bazán and Elvira Hernández

Exact null controllability of semilinear evolution systems pp. 317-326

Nazim Mahmudov

A globalized Newton method for the computation of normalized Nash equilibria pp. 327-340

Axel Dreves, Anna Heusinger, Christian Kanzow and Masao Fukushima

The maximum principle for the nonlinear stochastic optimal control problem of switching systems pp. 341-352

Charkaz Aghayeva and Qurban Abushov

Development and calibration of a currency trading strategy using global optimization pp. 353-371

Mustafa Çağlayan and János Pintér

A new class of hybrid extragradient algorithms for solving quasi-equilibrium problems pp. 373-397

Jean Strodiot, Thi Nguyen and Nguyen Van

Multiple critical points for non-differentiable parametrized functionals and applications to differential inclusions pp. 399-416

Nicuşor Costea and Csaba Varga

Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems pp. 417-430

Nader Kanzi

Lipschitz behavior of solutions to nonconvex semi-infinite vector optimization problems pp. 431-448

N. Huy and D. Kim

PTAS for the minimum k-path connected vertex cover problem in unit disk graphs pp. 449-458

Xianliang Liu, Hongliang Lu, Wei Wang and Weili Wu

A continuation approach to mode-finding of multivariate Gaussian mixtures and kernel density estimates pp. 459-487

Seppo Pulkkinen, Marko Mäkelä and Napsu Karmitsa

Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints pp. 489-501

N. Gadhi and A. Jawhar

Optimal discrete-valued control computation pp. 503-518

Changjun Yu, Bin Li, Ryan Loxton and Kok Teo

Higher-order optimality conditions in set-valued optimization using radial sets and radial derivatives pp. 519-536

Nguyen Anh and Phan Khanh

Deterministic global optimization in ab-initio quantum chemistry pp. 537-558

Pete Janes and Alistair Rendell

Maximum lifetime connected coverage with two active-phase sensors pp. 559-568

Hongwei Du, Panos Pardalos, Weili Wu and Lidong Wu

Proper and adjoint exhausters in nonsmooth analysis: optimality conditions pp. 569-585

M. Abbasov and V. Demyanov

Calculus of tangent sets and derivatives of set-valued maps under metric subregularity conditions pp. 587-603

M. Durea and R. Strugariu

Existence theorems of the variational-hemivariational inequalities pp. 605-622

Guo-ji Tang and Nan-jing Huang

A generalized f-projection method for countable families of weak relatively nonexpansive mappings and the system of generalized Ky Fan inequalities pp. 623-645

S. Saewan and P. Kumam

Mixed generalized quasi-equilibrium problems pp. 647-667

Truong Duong

Efficient global optimization algorithm assisted by multiple surrogate techniques pp. 669-689

Felipe Viana, Raphael Haftka and Layne Watson

Exactness and algorithm of an objective penalty function pp. 691-711

Zhiqing Meng, Chuangyin Dang, Min Jiang, Xinsheng Xu and Rui Shen

Generic uniqueness theorems with some applications pp. 713-725

Dingtao Peng, Jian Yu and Naihua Xiu

Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications pp. 727-736

Myoung-Ju Park and Sung-Pil Hong

Modeling optimal social choice: matrix-vector representation of various solution concepts based on majority rule pp. 737-756

Fuad Aleskerov and Andrey Subochev

Volume 56, issue 1, 2013

Convex underestimators of polynomials pp. 1-25

Jean Lasserre and Tung Thanh

From approximate balls to approximate ellipses pp. 27-42

Asish Mukhopadhyay, Eugene Greene, Animesh Sarker and Tom Switzer

An extension of the proximal point algorithm with Bregman distances on Hadamard manifolds pp. 43-59

E. Papa Quiroz

New horizons in sphere-packing theory, part II: lattice-based derivative-free optimization via global surrogates pp. 61-91

Paul Belitz and Thomas Bewley

Optimising a nonlinear utility function in multi-objective integer programming pp. 93-102

Melih Ozlen, Meral Azizoğlu and Benjamin Burton

Antiplane shear deformation of piezoelectric bodies in contact with a conductive support pp. 103-119

Ionicǎ Andrei, Nicuşor Costea and Andaluzia Matei

A supplement to a regularization method for the proximal point algorithm pp. 121-129

Satit Saejung

Portfolio selection under model uncertainty: a penalized moment-based optimization approach pp. 131-164

Jonathan Li and Roy Kwon

Weak and strong convergence theorems for asymptotically pseudo-contraction mappings in the intermediate sense in Hilbert spaces pp. 165-183

Lai-Jiu Lin, Zenn-Tsun Yu and Chih-Sheng Chuang

From simulated annealing to stochastic continuation: a new trend in combinatorial optimization pp. 185-215

Marc Robini and Pierre-Jean Reissman