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 59, issue 4, 2014

Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming pp. 695-727

H. Wu, H. Luo and J. Yang

A solution method for linear variational relation problems pp. 729-756

Anulekha Dhara and Dinh Luc

On efficiency and mixed duality for a new class of nonconvex multiobjective variational control problems pp. 757-785

Tadeusz Antczak

Level bundle-like algorithms for convex optimization pp. 787-809

J. Bello Cruz and W. Oliveira

Benson type algorithms for linear vector optimization and applications pp. 811-836

Andreas Hamel, Andreas Löhne and Birgit Rudloff

Functional inequalities and theorems of the alternative involving composite functions pp. 837-863

N. Dinh, G. Vallet and M. Volle

SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications pp. 865-889

Juliane Müller, Christine Shoemaker and Robert Piché

Volume 59, issue 2, 2014

Preface: Honoring the 60th birthday of Panos M. Pardalos pp. 207-207

Oleg Prokopyev and Nikolaos Sahinidis

Globally convergent DC trust-region methods pp. 209-225

Hoai Le Thi, Huynh Van, Tao Dinh, A. Vaz and L. Vicente

Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems pp. 227-242

Miguel Anjos, Xiao-Wen Chang and Wen-Yang Ku

Rounding on the standard simplex: regular grids for global optimization pp. 243-258

Immanuel Bomze, Stefan Gollowitzer and E. Yıldırım

PAVER 2.0: an open source environment for automated performance analysis of benchmarking data pp. 259-275

Michael Bussieck, Steven Dirkse and Stefan Vigerske

Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems pp. 277-306

Pedro Castro and Ignacio Grossmann

On the computation of all eigenvalues for the eigenvalue complementarity problem pp. 307-326

Luís Fernandes, Joaquim Júdice, Hanif Sherali and Masao Fukushima

Error estimation in nonlinear optimization pp. 327-341

William Hager and Delphine Mico-Umutesi

Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation pp. 343-365

Mahdi Hamzeei and James Luedtke

A fully general, exact algorithm for nesting irregular shapes pp. 367-404

Donald Jones

Cutting ellipses from area-minimizing rectangles pp. 405-437

Josef Kallrath and Steffen Rebennack

Sparse optimization in feature selection: application in neuroimaging pp. 439-457

K. Kampa, S. Mehta, C. Chou, W. Chaovalitwongse and T. Grabowski

On rigorous upper bounds to a global optimum pp. 459-476

Ralph Kearfott

A technique to derive the analytical form of convex envelopes for some bivariate functions pp. 477-501

Marco Locatelli

ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations pp. 503-526

Ruth Misener and Christodoulos Floudas

A branch and bound method for the solution of multiparametric mixed integer linear programming problems pp. 527-543

Richard Oberdieck, Martina Wittmann-Hohlbein and Efstratios Pistikopoulos

Globally-biased Disimpl algorithm for expensive global optimization pp. 545-567

Remigijus Paulavičius, Yaroslav Sergeyev, Dmitri Kvasov and Julius Žilinskas

Exclusion regions for optimization problems pp. 569-595

Hermann Schichl, Mihály Markót and Arnold Neumaier

Models and solution techniques for production planning problems with increasing byproducts pp. 597-631

Srikrishna Sridhar, Jeffrey Linderoth and James Luedtke

Multivariate McCormick relaxations pp. 633-662

A. Tsoukalas and A. Mitsos

Minimum vertex cover in ball graphs through local search pp. 663-671

Zhao Zhang, Weili Wu, Lidan Fan and Ding-Zhu Du

Global optimization of general nonconvex problems with intermediate polynomial substructures pp. 673-693

Keith Zorn and Nikolaos Sahinidis

Volume 59, issue 1, 2014

Speeding up branch and bound algorithms for solving the maximum clique problem pp. 1-21

Evgeny Maslov, Mikhail Batsyn and Panos Pardalos

Simplicial Lipschitz optimization without the Lipschitz constant pp. 23-40

Remigijus Paulavičius and Julius Žilinskas

Multiobjective DC programs with infinite convex constraints pp. 41-58

Shaojian Qu, Mark Goh, Soon-Yi Wu and Robert Souza

Path-following gradient-based decomposition algorithms for separable convex optimization pp. 59-80

Quoc Tran Dinh, Ion Necoara and Moritz Diehl

A full-Newton step feasible interior-point algorithm for $$P_*(\kappa )$$ P ∗ ( κ ) -linear complementarity problems pp. 81-99

G. Wang, C. Yu and K. Teo

Subdifferential test for optimality pp. 101-106

Florence Jules and Marc Lassonde

Order statistics and region-based evolutionary computation pp. 107-130

S. Puechmorel and D. Delahaye

On penalty methods for non monotone equilibrium problems pp. 131-138

Igor Konnov

Stability for trust-region methods via generalized differentiation pp. 139-164

Nguyen Qui

On the stability of the linear functional equation in a single variable on complete metric groups pp. 165-171

Soon-Mo Jung, Dorian Popa and Michael Rassias

Projected viscosity subgradient methods for variational inequalities with equilibrium problem constraints in Hilbert spaces pp. 173-190

Phan Vuong, Jean Strodiot and Nguyen Van

Levitin–Polyak well-posedness for constrained quasiconvex vector optimization problems pp. 191-205

C. Lalitha and Prashanto Chatterjee

Volume 58, issue 4, 2014

Aircraft deconfliction with speed regulation: new models from mixed-integer optimization pp. 613-629

Sonia Cafieri and Nicolas Durand

Efficient computation of spectral bounds for Hessian matrices on hyperrectangles for global optimization pp. 631-652

Moritz Schulze Darup, Martin Kastsian, Stefan Mross and Martin Mönnigmann

First order rejection tests for multiple-objective optimization pp. 653-672

Alexandre Goldsztejn, Ferenc Domes and Brice Chevalier

Second-order Karush–Kuhn–Tucker optimality conditions for set-valued optimization pp. 673-692

S. Zhu, S. Li and K. Teo

Higher-order optimality conditions for proper efficiency in nonsmooth vector optimization using radial sets and radial derivatives pp. 693-709

Nguyen Hoang Anh and Phan Khanh

An objective space cut and bound algorithm for convex multiplicative programmes pp. 711-728

Lizhen Shao and Matthias Ehrgott

An illumination problem: optimal apex and optimal orientation for a cone of light pp. 729-750

Annabella Astorino, Manlio Gaudioso and Alberto Seeger

Vector quasi-equilibrium problems: separation, saddle points and error bounds for the solution set pp. 751-767

S.-M. Guu and J. Li

Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem pp. 769-794

Eduardo Segredo, Carlos Segura and Coromoto León

Carbon tax based on the emission factor: a bilevel programming approach pp. 795-815

Hossa Almutairi and Samir Elhedhli

Volume 58, issue 3, 2014

New methods for calculating $$\alpha $$ BB-type underestimators pp. 411-427

Anders Skjäl and Tapio Westerlund

The cluster problem revisited pp. 429-438

Achim Wechsung, Spencer Schaber and Paul Barton

A continuous characterization of the maximum-edge biclique problem pp. 439-464

Nicolas Gillis and François Glineur

A Semidefinite Programming approach for solving Multiobjective Linear Programming pp. 465-480

Victor Blanco, Justo Puerto and Safae El Haj Ben Ali

Problems with resource allocation constraints and optimization over the efficient set pp. 481-495

P. Thach and T. Thang

A black-box scatter search for optimization problems with integer variables pp. 497-516

Manuel Laguna, Francisco Gortázar, Micael Gallego, Abraham Duarte and Rafael Martí

Optimal learning for sequential sampling with non-parametric beliefs pp. 517-543

Emre Barut and Warren Powell

Invariant-point theorems and existence of solutions to optimization-related problems pp. 545-564

Phan Khanh and Vo Long

Strongly nonlinear multivalued elliptic equations on a bounded domain pp. 565-593

Claudianor Alves, José Gonçalves and Jefferson Santos

Mordukhovich subgradients of the value function to a parametric discrete optimal control problem pp. 595-612

N. Toan and J.-C. Yao

Volume 58, issue 2, 2014

Journal of Global Optimization Best Paper Award for a paper published in 2012 pp. 205-205

Sergiy Butenko

Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming pp. 207-242

E. Birgin, J. Martínez and L. Prudente

Existence of augmented Lagrange multipliers for cone constrained optimization problems pp. 243-260

Yu Zhou, Jin Zhou and Xiao Yang

Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities pp. 261-284

Feng Guo, Li Wang and Guangming Zhou

Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework pp. 285-319

Jingu Kim, Yunlong He and Haesun Park

Equilibrium problems involving the Lorentz cone pp. 321-340

Pedro Gajardo and Alberto Seeger

Modified projection method for strongly pseudomonotone variational inequalities pp. 341-350

Pham Khanh and Phan Vuong

Generalized second-order contingent epiderivatives in parametric vector optimization problems pp. 351-363

Xiang-Kai Sun and Sheng-Jie Li

Abstract convexity of topical functions pp. 365-375

H. Mohebi and M. Samet

Online pricing for bundles of multiple items pp. 377-387

Yong Zhang, Francis Chin and Hing-Fung Ting

High-order moments conservation in thermostatted kinetic models pp. 389-404

Carlo Bianca, Massimiliano Ferrara and Luca Guerrini

Construction of error-tolerance pooling designs in symplectic spaces pp. 405-410

Haixia Guo and Jizhu Nan

Volume 58, issue 1, 2014

Global optimization of bounded factorable functions with discontinuities pp. 1-30

Achim Wechsung and Paul Barton

Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations pp. 31-50

V. Jeyakumar, G. Li and S. Srisatkunarajah

A new class of exact penalty functions and penalty algorithms pp. 51-73

Changyu Wang, Cheng Ma and Jinchuan Zhou

Evolutionary annealing: global optimization in measure spaces pp. 75-108

Alan Lockett and Risto Miikkulainen

An entire space polynomial-time algorithm for linear programming pp. 109-135

Da Tian

Interior-point algorithms for $$P_{*}(\kappa )$$ -LCP based on a new class of kernel functions pp. 137-149

Yong-Hoon Lee, You-Young Cho and Gyeong-Mi Cho

A smoothing homotopy method for variational inequality problems on polyhedral convex sets pp. 151-168

Zhengyong Zhou and Bo Yu

On proximal gradient method for the convex problems regularized with the group reproducing kernel norm pp. 169-188

Haibin Zhang, Juan Wei, Meixia Li, Jie Zhou and Miantao Chao

On the exhaustivity of simplicial partitioning pp. 189-203

Peter Dickinson