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 69, issue 4, 2017

Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations pp. 761-796

Dominik Bongartz and Alexander Mitsos

Adaptive block coordinate DIRECT algorithm pp. 797-822

Qinghua Tao, Xiaolin Huang, Shuning Wang and Li Li

Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap pp. 823-845

Fabián Flores-Bazán, William Echegaray, Fernando Flores-Bazán and Eladio Ocaña

Posterior exploration based sequential Monte Carlo for global optimization pp. 847-868

Bin Liu

On the convergence rate issues of general Markov search for global minimum pp. 869-888

Dawid Tarłowski

A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem pp. 889-909

D. Russell Luke, Shoham Sabach, Marc Teboulle and Kobi Zatlawey

Inverse max $$+$$ + sum spanning tree problem under Hamming distance by modifying the sum-cost vector pp. 911-925

Xiucui Guan, Xinyan He, Panos M. Pardalos and Binwu Zhang

Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization pp. 927-949

Pooriya Beyhaghi and Thomas Bewley

On some geometric conditions for minimality of DCH-functions via DC-duality approach pp. 951-965

Mahide Küçük, Didem Tozkan and Yalçın Küçük

Volume 69, issue 3, 2017

Recent advances on the interval distance geometry problem pp. 525-545

Douglas S. Gonçalves, Antonio Mucherino, Carlile Lavor and Leo Liberti

On parallel Branch and Bound frameworks for Global Optimization pp. 547-560

Juan F. R. Herrera, José M. G. Salmerón, Eligius M. T. Hendrix, Rafael Asenjo and Leocadio G. Casado

On a smoothed penalty-based algorithm for global optimization pp. 561-585

Ana Maria A. C. Rocha, M. Fernanda P. Costa and Edite M. G. P. Fernandes

On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory pp. 587-606

Richard Oberdieck, Nikolaos A. Diangelakis, Styliani Avraamidou and Efstratios N. Pistikopoulos

Non-dominated sorting procedure for Pareto dominance ranking on multicore CPU and/or GPU pp. 607-627

G. Ortega, E. Filatovas, E. M. Garzón and L. G. Casado

The cluster problem in constrained global optimization pp. 629-676

Rohit Kannan and Paul I. Barton

Virtuous smoothing for global optimization pp. 677-697

Jon Lee and Daphne Skipper

On nadir points of multiobjective integer programming problems pp. 699-712

Ozgur Ozpeynirci

Knapsack with variable weights satisfying linear constraints pp. 713-725

Kameng Nip, Zhenbo Wang and Zizhuo Wang

A mixed integer programming-based global optimization framework for analyzing gene expression data pp. 727-744

Giovanni Felici, Kumar Parijat Tripathi, Daniela Evangelista and Mario Rosario Guarracino

Global optimization for optimal power flow over transmission networks pp. 745-760

Y. Shi, H. D. Tuan, H. Tuy and S. Su

Volume 69, issue 2, 2017

Global optimization of disjunctive programs pp. 283-307

Peter Kirst, Fabian Rigterink and Oliver Stein

A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints pp. 309-342

Amir Beck and Dror Pan

An exact algorithm for the minimum dilation triangulation problem pp. 343-367

Sattar Sattari and Mohammad Izadi

Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver pp. 369-385

Andreas Löhne and Andrea Wagner

Dual method of centers for solving generalized fractional programs pp. 387-426

K. Boufi and A. Roubi

A theorem of the alternative with an arbitrary number of inequalities and quadratic programming pp. 427-442

M. Ruiz Galán

Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems pp. 443-459

Ville-Pekka Eronen, Jan Kronqvist, Tapio Westerlund, Marko M. Mäkelä and Napsu Karmitsa

A certified Branch & Bound approach for reliability-based optimization problems pp. 461-484

Benjamin Martin, Marco Correia and Jorge Cruz

Decision uncertainty in multiobjective optimization pp. 485-510

Gabriele Eichfelder, Corinna Krüger and Anita Schöbel

Optimality condition and complexity of order-value optimization problems and low order-value optimization problems pp. 511-523

Zhongyi Jiang, Qiying Hu and Xiaojin Zheng

Volume 69, issue 1, 2017

Parallel distributed block coordinate descent methods based on pairwise comparison oracle pp. 1-21

Kota Matsui, Wataru Kumagai and Takafumi Kanamori

Geodesic and contour optimization using conformal mapping pp. 23-44

Ricky Fok, Aijun An and Xiaogong Wang

iGreen: green scheduling for peak demand minimization pp. 45-67

Shaojie Tang, Jing Yuan, Zhao Zhang and Ding-zhu Du

Solving linear optimization over arithmetic constraint formula pp. 69-102

Li Chen, Yinrun Lyu, Chong Wang, Jingzheng Wu, Changyou Zhang, Nasro Min-Allah, Jamal Alhiyafi and Yongji Wang

Incorporation of delivery times in stereotactic radiosurgery treatment optimization pp. 103-115

Hamid R. Ghaffari, Dionne M. Aleman, David A. Jaffray and Mark Ruschin

GOSAC: global optimization with surrogate approximation of constraints pp. 117-136

Juliane Müller and Joshua D. Woodbury

A Lagrangian search method for the P-median problem pp. 137-156

Joshua Q. Hale, Enlu Zhou and Jiming Peng

Certificates of infeasibility via nonsmooth optimization pp. 157-182

Hannes Fendl, Arnold Neumaier and Hermann Schichl

Strong valid inequalities for Boolean logical pattern generation pp. 183-230

Kedong Yan and Hong Seo Ryoo

Supply chain network capacity competition with outsourcing: a variational equilibrium framework pp. 231-254

Anna Nagurney, Min Yu and Deniz Besik

Fractional 0–1 programming: applications and algorithms pp. 255-282

Juan S. Borrero, Colin Gillen and Oleg A. Prokopyev

Volume 68, issue 4, 2017

Guided dive for the spatial branch-and-bound pp. 685-711

D. Gerard, M. Köppe and Q. Louveaux

A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set pp. 713-727

Rudolf Scitovski

Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers pp. 729-747

Abay Molla Kassa and Semu Mitiku Kassa

A new fully polynomial time approximation scheme for the interval subset sum problem pp. 749-775

Rui Diao, Ya-Feng Liu and Yu-Hong Dai

DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling pp. 777-798

Rundong Du, Da Kuang, Barry Drake and Haesun Park

Parallel machine scheduling with general sum of processing time based models pp. 799-814

Radosław Rudek

Global convergence of proximal iteratively reweighted algorithm pp. 815-826

Tao Sun, Hao Jiang and Lizhi Cheng

Kriging surrogate model with coordinate transformation based on likelihood and gradient pp. 827-849

Nobuo Namura, Koji Shimoyama and Shigeru Obayashi

A stochastic production planning problem in hybrid manufacturing and remanufacturing systems with resource capacity planning pp. 851-878

Chang Fang, Xinbao Liu, Panos M. Pardalos, Jianyu Long, Jun Pei and Chao Zuo

Global probability maximization for a Gaussian bilateral inequality in polynomial time pp. 879-898

Michel Minoux and Riadh Zorgati

Vectorial penalization for generalized functional constrained problems pp. 899-923

Marius Durea and Radu Strugariu

Volume 68, issue 3, 2017

A nonlinear programming model with implicit variables for packing ellipsoids pp. 467-499

E. G. Birgin, R. D. Lobato and J. M. Martínez

A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes pp. 501-535

Kaisa Joki, Adil M. Bagirov, Napsu Karmitsa and Marko M. Mäkelä

An approximate bundle method for solving nonsmooth equilibrium problems pp. 537-562

Fan-Yun Meng, Li-Ping Pang, Jian Lv and Jin-He Wang

Global optimization of non-convex piecewise linear regression splines pp. 563-586

Nadia Martinez, Hadis Anahideh, Jay M. Rosenberger, Diana Martinez, Victoria C. P. Chen and Bo Ping Wang

Coradiant sets and $$\varepsilon $$ ε -efficiency in multiobjective optimization pp. 587-600

Abbas Sayadi-bander, Latif Pourkarimi, Refail Kasimbeyli and Hadi Basirzadeh

The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems pp. 601-622

Marcel Turkensteen, Dmitry Malyshev, Boris Goldengorin and Panos M. Pardalos

Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems pp. 623-640

Hongtan Sun and Thomas C. Sharkey

Pseudo expected improvement criterion for parallel EGO algorithm pp. 641-662

Dawei Zhan, Jiachang Qian and Yuansheng Cheng

Decoupling linear and nonlinear regimes: an evaluation of efficiency for nonlinear multidimensional optimization pp. 663-675

Christopher M. Cotnoir and Balša Terzić

A review of computation of mathematically rigorous bounds on optima of linear programs pp. 677-683

Jared T. Guilbeau, Md. Istiaq Hossain, Sam D. Karhbet, Ralph Baker Kearfott, Temitope S. Sanusi and Lihong Zhao

Volume 68, issue 2, 2017

A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs pp. 227-253

Hatim Djelassi and Alexander Mitsos

Solving discrete linear bilevel optimization problems using the optimal value reformulation pp. 255-277

S. Dempe and F. Mefo Kue

Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach pp. 279-306

Alberto Seeger and José Vidal -Nuñez

Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization pp. 307-328

Duy Khuong Nguyen and Tu Bao Ho

Matrix product constraints by projection methods pp. 329-355

Veit Elser

Self-concordance is NP-hard pp. 357-366

Lek-Heng Lim

Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization pp. 367-385

J. M. Martínez and M. Raydan

Kantorovich’s theorem on Newton’s method under majorant condition in Riemannian manifolds pp. 387-411

T. Bittencourt and O. P. Ferreira

Chebyshev model arithmetic for factorable functions pp. 413-438

Jai Rajyaguru, Mario E. Villanueva, Boris Houska and Benoît Chachuat

Equal Risk Bounding is better than Risk Parity for portfolio selection pp. 439-461

Francesco Cesarone and Fabio Tardella

Erratum to: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem pp. 463-466

Amadeu Almeida Coco, João Carlos Abreu Júnior, Thiago F. Noronha and Andréa Cynthia Santos

Volume 68, issue 1, 2017

A branch and bound algorithm for quantified quadratic programming pp. 1-22

F. Domes and A. Goldsztejn

Algorithms for art gallery illumination pp. 23-45

Maximilian Ernestus, Stephan Friedrichs, Michael Hemmer, Jan Kokemüller, Alexander Kröller, Mahdi Moeini and Christiane Schmidt

A recursive algorithm for multivariate risk measures and a set-valued Bellman’s principle pp. 47-69

Zachary Feinstein and Birgit Rudloff

An approach to generate comprehensive piecewise linear interpolation of pareto outcomes to aid decision making pp. 71-93

Kalyan Shankar Bhattacharjee, Hemant Kumar Singh and Tapabrata Ray

Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms pp. 95-123

Hao-Chun Lu

Global saddle points of nonlinear augmented Lagrangian functions pp. 125-146

Changyu Wang, Qian Liu and Biao Qu

Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing pp. 147-167

Liangyu Chen, Yaochen Xu and Zhenbing Zeng

Application of the sequential parametric convex approximation method to the design of robust trusses pp. 169-187

Alfredo Canelas, Miguel Carrasco and Julio López

Improving simulated annealing through derandomization pp. 189-217

Mathieu Gerber and Luke Bornn

Erratum to: Multivariate McCormick relaxations pp. 219-225

Jaromił Najman, Dominik Bongartz, Angelos Tsoukalas and Alexander Mitsos