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 70, issue 4, 2018

How to project onto extended second order cones pp. 707-718

O. P. Ferreira and S. Z. Németh

Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint pp. 719-735

Xiaojin Zheng, Yutong Pan and Xueting Cui

An interleaved depth-first search method for the linear optimization problem with disjunctive constraints pp. 737-756

Yinrun Lyu, Li Chen, Changyou Zhang, Dacheng Qu, Nasro Min-Allah and Yongji Wang

An adaptive framework for costly black-box global optimization based on radial basis function interpolation pp. 757-781

Zhe Zhou and Fusheng Bai

Simulation optimization of risk measures with adaptive risk levels pp. 783-809

Helin Zhu, Joshua Hale and Enlu Zhou

A Utility Theory Based Interactive Approach to Robustness in Linear Optimization pp. 811-842

Mehdi Karimi, Somayeh Moazeni and Levent Tunçel

Tensor maximal correlation problems pp. 843-858

Anwa Zhou, Xin Zhao, Jinyan Fan and Yanqin Bai

Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain pp. 859-873

Qiaoming Han, Donglei Du, Dachuan Xu and Yicheng Xu

Approximate solutions of vector optimization problems via improvement sets in real linear spaces pp. 875-901

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

Scalarizations for a unified vector optimization problem based on order representing and order preserving properties pp. 903-916

Khushboo and C. S. Lalitha

Volume 70, issue 3, 2018

An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver pp. 497-516

Kai Zhou, Mustafa R. Kılınç, Xi Chen and Nikolaos V. Sahinidis

A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information pp. 517-549

Jian Lv, Li-Ping Pang and Fan-Yun Meng

Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization pp. 551-577

Xiaolong Kuang and Luis F. Zuluaga

An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming pp. 579-599

Yiduo Zhan, Qipeng P. Zheng, Chung-Li Tseng and Eduardo L. Pasiliao

A trajectory-based method for mixed integer nonlinear programming problems pp. 601-623

Terry-Leigh Oliphant and M. Montaz Ali

A Frank–Wolfe based branch-and-bound algorithm for mean-risk optimization pp. 625-644

Christoph Buchheim, Marianna De Santis, Francesco Rinaldi and Long Trieu

Order-based error for managing ensembles of surrogates in mesh adaptive direct search pp. 645-675

Charles Audet, Michael Kokkolaras, Sébastien Le Digabel and Bastien Talgorn

Partial inverse maximum spanning tree in which weight can only be decreased under $$l_p$$ l p -norm pp. 677-685

Xianyue Li, Zhao Zhang and Ding-Zhu Du

Inertial projection and contraction algorithms for variational inequalities pp. 687-704

Q. L. Dong, Y. J. Cho, L. L. Zhong and Th. M. Rassias

Corrections to: Differentiable McCormick relaxations pp. 705-706

Kamil A. Khan, Matthew Wilhelm, Matthew D. Stuber, Huiyi Cao, Harry A. J. Watson and Paul I. Barton

Volume 70, issue 2, 2018

Preface pp. 307-307

Sebastiano Battiato, Patrizia Daniele, Giovanni Maria Farinella, Sofia Giuffrè and Laura Rosa Maria Scrimali

New necessary and sufficient optimality conditions for strong bilevel programming problems pp. 309-327

Abdelmalek Aboussoror and Samir Adly

On an equilibrium problem with complementarity constraints formulation of pay-as-clear electricity market with demand elasticity pp. 329-346

Elisabetta Allevi, Didier Aussel and Rossana Riccardi

Evaluating the impacts of the external supply risk in a natural gas supply chain: the case of the Italian market pp. 347-384

E. Allevi, L. Boffino, M. E. Giuli and G. Oggioni

New extragradient-like algorithms for strongly pseudomonotone variational inequalities pp. 385-399

Dang Hieu and Duong Viet Thong

Inverse problems for quasi-variational inequalities pp. 401-411

Akhtar A. Khan and Dumitru Motreanu

Security investment and information sharing in the market of complementary firms: impact of complementarity degree and industry size pp. 413-436

Xinbao Liu, Xiaofei Qian, Jun Pei and Panos M. Pardalos

Second-order necessary efficiency conditions for nonsmooth vector equilibrium problems pp. 437-453

Do Van Luu

Cooperation in pollution control problems via evolutionary variational inequalities pp. 455-476

Laura Scrimali and Cristina Mirabella

The Glowinski–Le Tallec splitting method revisited in the framework of equilibrium problems in Hilbert spaces pp. 477-495

Phan Tu Vuong and Jean Jacques Strodiot

Volume 70, issue 1, 2018

Preface: Special issue of MOA 2016 pp. 1-3

Thorsten Koch, Ya-Feng Liu and Jiming Peng

A sparse enhanced indexation model with chance and cardinality constraints pp. 5-25

Fengmin Xu, Meihua Wang, Yu-Hong Dai and Dachuan Xu

Optimal replenishment and stocking strategies for inventory mechanism with a dynamically stochastic short-term price discount pp. 27-53

Yiju Wang, Hengxia Gao and Wei Xing

On the stability of solutions for semi-infinite vector optimization problems pp. 55-69

Zai-Yun Peng, Jian-Wen Peng, Xian-Jun Long and Jen-Chih Yao

Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss pp. 71-97

Le Han and Shujun Bi

Approximation algorithms for optimization of real-valued general conjugate complex forms pp. 99-130

Taoran Fu, Bo Jiang and Zhening Li

Distributionally robust chance constrained optimization for economic dispatch in renewable energy integrated systems pp. 131-158

Xiaojiao Tong, Hailin Sun, Xiao Luo and Quanguo Zheng

Optimality analysis on partial $$l_1$$ l 1 -minimization recovery pp. 159-170

Huan Gao, Haibin Zhang, Zhibao Li and Kai Tu

Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming pp. 171-187

Cheng Lu, Zhibin Deng, Wei-Qiang Zhang and Shu-Cherng Fang

A computational study of primal heuristics inside an MI(NL)P solver pp. 189-206

Timo Berthold

Approximation algorithms for the robust/soft-capacitated 2-level facility location problems pp. 207-222

Chenchen Wu, Dachuan Xu, Dongmei Zhang and Peng Zhang

Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints pp. 223-236

Suhong Jiang, Jin Zhang, Caihua Chen and Guihua Lin

A quadratic penalty method for hypergraph matching pp. 237-259

Chunfeng Cui, Qingna Li, Liqun Qi and Hong Yan

Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications pp. 261-288

Davood Hajinezhad and Qingjiang Shi

Generalized coefficient strengthening cuts for mixed integer programming pp. 289-306

Wei-Kun Chen, Liang Chen, Mu-Ming Yang and Yu-Hong Dai

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