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

A particle swarm optimization-based hybrid algorithm for minimum concave cost network flow problems pp. 539-559

Shangyao Yan, Yu-Lin Shih and Wang-Tsang Lee

Scalarization and pointwise well-posedness in vector optimization problems pp. 561-574

Gang Xiao, Hong Xiao and Sanyang Liu

Nonmonotone equilibrium problems: coercivity conditions and weak regularization pp. 575-587

Igor Konnov and D. Dyabilkin

Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems pp. 589-606

George Mavrotas, José Figueira and Alexandros Antoniadis

Chebyshev scalarization of solutions to the vector equilibrium problems pp. 607-622

X. Gong

Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices pp. 623-649

Sanjay Mehrotra and Zhifeng Li

Stochastic lot-sizing with backlogging: computational complexity analysis pp. 651-678

Yongpei Guan

An extragradient-type method for generalized equilibrium problems involving strictly pseudocontractive mappings pp. 679-693

Xiaolong Qin, Sun Cho and Shin Kang

Generalized vector implicit quasi complementarity problems pp. 695-705

Suhel Khan

Counterexamples on some articles on quasi-variational inclusion problems pp. 707-712

H. Mohebi and M. Vatandoost

Necessary optimality conditions for nonsmooth semi-infinite programming problems pp. 713-725

Nader Kanzi

Volume 49, issue 3, 2011

Preface pp. 363-364

Tao Pham Dinh and Hoai Le Thi

Quasi-Newton methods in infinite-dimensional spaces and application to matrix equations pp. 365-379

Boubakeur Benahmed, Hocine Mokhtar-Kharroubi, Bruno Malafosse and Adnan Yassine

On generalized Ekeland’s variational principle and equivalent formulations for set-valued mappings pp. 381-396

P. Khanh and D. Quy

Knapsack problem with probability constraints pp. 397-413

Alexei Gaivoronski, Abdel Lisser, Rafael Lopez and Hu Xu

Application of convex lexicographical optimization to the balance of GRTgaz gas grid pp. 415-423

Soizic Adam, J. Bonnans, Ruben Paraisy and Sébastien Veyrat

An exact algorithm for solving the vertex separator problem pp. 425-434

Mohamed Didi Biha and Marie-Jean Meurs

A blind image watermarking using multiresolution visibility map pp. 435-448

M. Luong, Q. Do and A. Beghdadi

Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering pp. 449-465

Daniel Aloise and Pierre Hansen

The small hexagon and heptagon with maximum sum of distances between vertices pp. 467-480

Charles Audet, Anthony Guillou, Pierre Hansen, Frédéric Messine and Sylvain Perron

Properties of two DC algorithms in quadratic programming pp. 481-495

Hoai Le Thi, Tao Pham Dinh and Nguyen Yen

Automatic differentiation for the optimization of a ship propulsion and steering system: a proof of concept pp. 497-504

Ralf Leidenberger and Karsten Urban

The directional subdifferential of the difference of two convex functions pp. 505-519

Jean-Paul Penot

On 2-stage robust LP with RHS uncertainty: complexity results and applications pp. 521-537

Michel Minoux

Volume 49, issue 2, 2011

Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm pp. 185-212

P. Nataraj and M. Arounassalame

Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem pp. 213-235

Nikolaos Argyris, José Figueira and Alec Morton

Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems pp. 237-263

Ching-Feng Wen and Hsien-Chung Wu

Characterizing strict efficiency for convex multiobjective programming problems pp. 265-280

Anjana Gupta, Aparna Mehra and Davinder Bhatia

A logarithmic-quadratic proximal point scalarization method for multiobjective programming pp. 281-291

Ronaldo Gregório and Paulo Oliveira

Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints pp. 293-311

Xinzhen Zhang, Chen Ling and Liqun Qi

A generic approach to approximate efficiency and applications to vector optimization with set-valued maps pp. 313-342

C. Gutiérrez, B. Jiménez and V. Novo

Degree theory for a generalized set-valued variational inequality with an application in Banach spaces pp. 343-357

Zhong Wang and Nan Huang

Comments on “Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine” pp. 359-362

Jiping Tao, Zhijun Chao and Yugeng Xi

Volume 49, issue 1, 2011

Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems pp. 1-14

V. Jeyakumar and Guoyin Li

Best proximity points: global optimal approximate solutions pp. 15-21

S. Sadiq Basha

Optimality and duality in vector optimization involving generalized type I functions over cones pp. 23-35

S. Suneja, Seema Khurana and Meetu Bhatia

A class of r-semipreinvex functions and optimality in nonlinear programming pp. 37-47

Ke Zhao, Xue Liu and Zhe Chen

Model building using bi-level optimization pp. 49-67

G. Saharidis, I. Androulakis and M. Ierapetritou

A new differential mutation base generator for differential evolution pp. 69-90

Chuan Lin, Anyong Qing and Quanyuan Feng

Towards the global solution of the maximal correlation problem pp. 91-107

Lei-Hong Zhang, Li-Zhi Liao and Li-Ming Sun

The column-sufficiency and row-sufficiency of the linear transformation on Hilbert spaces pp. 109-123

Xin-He Miao and Zheng-Hai Huang

Approaching pooling design with smaller efficient ratio pp. 125-135

Suogang Gao, Zengti Li, Hongjie Du, Yan Shi and Weili Wu

Multiobjective optimization problems with modified objective functions and cone constraints and applications pp. 137-147

Jia Chen, Yeol Cho, Jong Kim and Jun Li

Study of multiscale global optimization based on parameter space partition pp. 149-172

Weitao Sun and Yuan Dong

Counterexamples to some triality and tri-duality results pp. 173-183

M. Voisei and C. Zălinescu

Volume 48, issue 4, 2010

Optimal placement of UV-based communications relay nodes pp. 511-531

Oleg Burdakov, Patrick Doherty, Kaj Holmberg and Per-Magnus Olsson

A heuristic method for the minimum toll booth problem pp. 533-548

Lihui Bai, Donald Hearn and Siriphong Lawphongpanich

Partitioning procedure for polynomial optimization pp. 549-567

Polyxeni-Margarita Kleniati, Panos Parpas and Berç Rustem

Pyramidal tours and multiple objectives pp. 569-582

Ozgur Ozpeynirci and Murat Köksalan

Piece adding technique for convex maximization problems pp. 583-593

Dominique Fortin and Ider Tseveendorj

An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs pp. 595-632

Tao Pham Dinh, Nam Nguyen Canh and Hoai An Le Thi

New dominating sets in social networks pp. 633-642

Xu Zhu, Jieun Yu, Wonjun Lee, Donghyun Kim, Shan Shan and Ding-Zhu Du

Minimization of equilibrium problems, variational inequality problems and fixed point problems pp. 643-656

Yonghong Yao, Yeong-Cheng Liou and Shin Kang

DC models for spherical separation pp. 657-669

A. Astorino, A. Fuduli and M. Gaudioso

Volume 48, issue 2, 2010

Duality and optimality conditions for generalized equilibrium problems involving DC functions pp. 183-208

N. Dinh, J. Strodiot and V. Nguyen

On the norm of a dc function pp. 209-213

Rafael Blanquero and Emilio Carrizosa

On numerical optimization theory of infinite kernel learning pp. 215-239

S. Özöğür-Akyüz and G.-W. Weber

A new smoothing and regularization Newton method for P 0 -NCP pp. 241-261

Changfeng Ma

A fractional programming approach for retail category price optimization pp. 263-277

Shivaram Subramanian and Hanif Sherali

A quasi-variational approach to a competitive economic equilibrium problem without strong monotonicity assumption pp. 279-287

G. Anello, M. Donato and M. Milasi

Continuous GRASP with a local active-set method for bound-constrained global optimization pp. 289-310

Ernesto Birgin, Erico Gozzi, Mauricio Resende and Ricardo Silva

Refined optimality conditions for differences of convex functions pp. 311-321

Tuomo Valkonen

Robust optimization with simulated annealing pp. 323-334

Dimitris Bertsimas and Omid Nohadani

Bounds of redundant multicast routing problem with SRLG-diverse constraints: edge, path and tree models pp. 335-345

Zhe Liang and Wanpracha Art Chaovalitwongse

Volume 48, issue 1, 2010

Foreword: Special issue celebrating the 70th birthday of Roman G. Strongin pp. 1-2

Panos Pardalos and Yaroslav Sergeyev

Methods of embedding-cutting off in problems of mathematical programming pp. 3-15

Valerian Bulatov

A lower bound on convergence rates of nonadaptive algorithms for univariate optimization with noise pp. 17-27

James Calvin

One-dimensional identification problem and ranking parameters pp. 29-40

V. Demyanova and V. Demyanov

A genetic algorithm for a global optimization problem arising in the detection of gravitational waves pp. 41-55

Daniela di Serafino, Susana Gomez, Leopoldo Milano, Filippo Riccio and Gerardo Toraldo

Linear and quadratic programming approaches for the general graph partitioning problem pp. 57-71

Neng Fan and Panos Pardalos

A local search method for continuous global optimization pp. 73-85

M. Gaviano, D. Lera and A. Steri

Stopping rules in k-adaptive global random search algorithms pp. 87-97

Anatoly Zhigljavsky and Emily Hamilton

An information global minimization algorithm using the local improvement technique pp. 99-112

Daniela Lera and Yaroslav Sergeyev

A partition-based global optimization algorithm pp. 113-128

Giampaolo Liuzzi, Stefano Lucidi and Veronica Piccialli

On simulation of optimal strategies and Nash equilibrium in the financial market context pp. 129-143

Jonas Mockus

Iterative regularization algorithms for constrained image deblurring on graphics processors pp. 145-157

Valeria Ruggiero, Thomas Serafini, Riccardo Zanella and Luca Zanni

On computational search for optimistic solutions in bilevel problems pp. 159-172

Alexander Strekalovsky, Andrey Orlov and Anton Malyshev

On similarities between two models of global optimization: statistical models and radial basis functions pp. 173-182

Antanas Žilinskas