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 51, issue 4, 2011

Generalized McCormick relaxations pp. 569-606

Joseph Scott, Matthew Stuber and Paul Barton

Self-adaptive randomized and rank-based differential evolution for multimodal problems pp. 607-640

Onay Urfalioglu and Orhan Arikan

The prox-Tikhonov regularization method for the proximal point algorithm in Banach spaces pp. 641-655

D. Sahu and J. Yao

Existence results for proper efficient solutions of vector equilibrium problems and applications pp. 657-675

Adela Capătă

Calmness of efficient solution maps in parametric vector optimization pp. 677-688

T. Chuong, A. Kruger and J.-C. Yao

Generalized equilibrium problems and fixed point problems for nonexpansive semigroups in Hilbert spaces pp. 689-714

Uthai Kamraksa and Rabian Wangkeeree

Low order-value approach for solving VaR-constrained optimization problems pp. 715-742

E. Birgin, L. Bueno, N. Krejić and J. Martínez

Markov modelling and parameterisation of genetic evolutionary test generations pp. 743-751

Adriel Cheng and Cheng-Chew Lim

Volume 51, issue 3, 2011

Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs pp. 377-393

Hanif Sherali and Evrim Dalkiran

Subdifferential properties of the minimal time function of linear control systems pp. 395-412

Yi Jiang, Yi He and Jie Sun

Evolution hemivariational inequality problems with doubly nonlinear operators pp. 413-427

Zijia Peng and Zhenhai Liu

Alternating direction method for bi-quadratic programming pp. 429-446

Sheng-Long Hu and Zheng-Hai Huang

Maximum lifetime coverage preserving scheduling algorithms in sensor networks pp. 447-462

Maggie Cheng and Xuan Gong

Heuristic algorithms for the inverse mixed integer linear programming problem pp. 463-471

Zhaoyang Duan and Lizhi Wang

A new smoothing Broyden-like method for solving nonlinear complementarity problem with a P 0 -function pp. 473-495

Bilian Chen and Changfeng Ma

New decision rules for exact search in N-Queens pp. 497-514

Pablo San Segundo

Seeking global edges for traveling salesman problem in multi-start search pp. 515-540

Weiqi Li

Continuity of approximate solution mappings for parametric equilibrium problems pp. 541-548

X. Li and S. Li

Global optimality conditions and optimization methods for quadratic integer programming problems pp. 549-568

Z. Wu, G. Li and J. Quan

Volume 51, issue 2, 2011

Guest editorial: a special issue on optimization techniques for business intelligence systems pp. 185-187

Jie Lu and Guangquan Zhang

A multi-criteria optimization model for humanitarian aid distribution pp. 189-208

Begoña Vitoriano, M. Ortuño, Gregorio Tirado and Javier Montero

A comparison study of fuzzy MADM methods in nuclear safeguards evaluation pp. 209-226

Özgür Kabak and Da Ruan

An intelligent multi-criteria optimization method for quick and market-oriented textile material design pp. 227-244

Xiaoguang Deng, Xianyi Zeng, Philippe Vroman and Ludovic Koehl

Particle swarm optimization for bi-level pricing problems in supply chains pp. 245-254

Ya Gao, Guangquan Zhang, Jie Lu and Hui-Ming Wee

Optimization algorithm for learning consistent belief rule-base from examples pp. 255-270

Jun Liu, Luis Martinez, Da Ruan, Rosa Rodriguez and Alberto Calzada

An improved training algorithm for feedforward neural network learning based on terminal attractors pp. 271-284

Xinghuo Yu, Bin Wang, Batsukh Batbayar, Liuping Wang and Zhihong Man

Maturity, distance and density (MD 2 ) metrics for optimizing trust prediction for business intelligence pp. 285-300

Muhammad Raza, Omar Hussain, Farookh Hussain and Elizabeth Chang

Pareto-optimality of oblique decision trees from evolutionary algorithms pp. 301-311

Jose Pangilinan and Gerrit Janssens

Constructing composite search directions with parameters in quadratic interpolation models pp. 313-324

Qinghua Zhou, Yan Li and Minghu Ha

Incremental learning optimization on knowledge discovery in dynamic business intelligent systems pp. 325-344

Dun Liu, Tianrui Li, Da Ruan and Junbo Zhang

Multitime dynamic programming for multiple integral actions pp. 345-360

Constantin Udrişte and Ionel Ţevy

Riemannian convexity of functionals pp. 361-376

Constantin Udrişte and Andreea Bejenaru

Volume 51, issue 1, 2011

Min-max and robust polynomial optimization pp. 1-10

J. Lasserre

Inexact Halpern-type proximal point algorithm pp. 11-26

O. Boikanyo and G. Moroşanu

The general iterative methods for nonexpansive mappings in Banach spaces pp. 27-46

Rattanaporn Wangkeeree, Narin Petrot and Rabian Wangkeeree

Discrete time dynamic traffic assignment models and solution algorithm for managed lanes pp. 47-68

Qipeng Zheng and Ashwin Arulselvan

Iterative approximation method for finite family of relatively quasi nonexpansive mappings and systems of equilibrium problems pp. 69-78

Yekini Shehu

Mixture surrogate models based on Dempster-Shafer theory for global optimization problems pp. 79-104

Juliane Müller and Robert Piché

A new C-function for symmetric cone complementarity problems pp. 105-113

Jia Tang, Sanyang Liu and Changfeng Ma

Geometric fit of a point set by generalized circles pp. 115-132

Mark-Christoph Körner, Jack Brimberg, Henrik Juel and Anita Schöbel

A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm pp. 133-148

Yi-Feng Hung and Wei-Chih Chen

Generalized Benders’ Decomposition for topology optimization problems pp. 149-183

Eduardo Muñoz and Mathias Stolpe

Volume 50, issue 4, 2011

Preface: Special issue SAGO08 pp. 555-556

M. Montaz Ali and Eligius Hendrix

Parallel algorithms for continuous multifacility competitive location problems pp. 557-573

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

Dynamic sample budget allocation in model-based optimization pp. 575-596

Jiaqiao Hu, Hyeong Chang, Michael Fu and Steven Marcus

Pattern discrete and mixed Hit-and-Run for global optimization pp. 597-627

Huseyin Mete, Yanfang Shen, Zelda Zabinsky, Seksan Kiatsupaibul and Robert Smith

A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms pp. 629-644

Jordan Ninin and Frédéric Messine

On determining the cover of a simplex by spheres centered at its vertices pp. 645-655

L. Casado, I. García, B. Tóth and E. Hendrix

An exact algorithm for the 0–1 linear knapsack problem with a single continuous variable pp. 657-673

Geng Lin, Wenxing Zhu and Majid Ali

A globally and superlinearly convergent quasi-Newton method for general box constrained variational inequalities without smoothing approximation pp. 675-694

Xuebin Wang, Changfeng Ma and Meiyan Li

Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations pp. 695-712

X. Zheng, X. Sun and D. Li

A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation pp. 713-728

Jein-Shan Chen, Shaohua Pan and Chun-Hsu Ko

Volume 50, issue 3, 2011

A new topological minimax theorem with application pp. 371-378

Hoang Tuy

Global descent methods for unconstrained global optimization pp. 379-396

Z. Wu, D. Li and L. Zhang

An approximation algorithm for convex multi-objective programming problems pp. 397-416

Matthias Ehrgott, Lizhen Shao and Anita Schöbel

Massively parallel differential evolution—pattern search optimization with graphics hardware acceleration: an investigation on bound constrained optimization problems pp. 417-437

Weihang Zhu

Global optimization for the generalized polynomial sum of ratios problem pp. 439-455

Peiping Shen, Yuan Ma and Yongqiang Chen

A new iterative algorithm for equilibrium and fixed point problems of nonexpansive mapping pp. 457-472

Zi-Ming Wang, Yongfu Su, Sun Cho and Wandong Lou

Maximum information stored in a labeled connected network with minimum edges pp. 473-483

Chao-Lin Chen

On the Dini-Hadamard subdifferential of the difference of two functions pp. 485-502

Radu Boţ and Delia-Maria Nechita

A biased random-key genetic algorithm for routing and wavelength assignment pp. 503-518

Thiago Noronha, Mauricio Resende and Celso Ribeiro

Second-order Kuhn-Tucker invex constrained problems pp. 519-529

Vsevolod Ivanov

A note on the regularized proximal point algorithm pp. 531-535

Fenghui Wang

Alternative principles and their applications pp. 537-547

Mircea Balaj

Equivalent formulations of the gradient pp. 549-553

Sanjo Zlobec

Volume 50, issue 1, 2011

Preface pp. 1-2

Juan Enrique Martinez-Legaz and Wilfredo Sosa Sandoval

Codifferential method for minimizing nonsmooth DC functions pp. 3-22

A. Bagirov and J. Ugon

SSDB spaces and maximal monotonicity pp. 23-37

Stephen Simons

Partial penalization for the solution of generalized Nash equilibrium problems pp. 39-57

Francisco Facchinei and Lorenzo Lampariello

Korpelevich’s method for variational inequality problems in Banach spaces pp. 59-76

Alfredo Iusem and Mostafa Nasri

Small sets in best approximation theory pp. 77-91

J. Revalski and N. Zhivkov

Semicontinuity of the solution map of quasivariational inequalities pp. 93-105

D. Aussel and J. Cotrina

Maximizing selections from the core of a cooperative game pp. 107-118

Hans Keiding

Generalized Nash equilibrium problems for lower semi-continuous strategy maps pp. 119-125

P. Georgiev and P. Pardalos

Optimizing microwind rural electrification projects. A case study in Peru pp. 127-143

Laia Ferrer-Martí, Rafael Pastor, G. Capó and Enrique Velo

Enhanced metric regularity and Lipschitzian properties of variational systems pp. 145-167

Francisco Aragón Artacho and Boris Mordukhovich

Transversality condition for singular infinite horizon calculus of variations pp. 169-178

Eladio Ocaña Anaya and Pierre Cartigny