Economics at your fingertips  

Journal of Global Optimization

2004 - 2018

Current editor(s): Sergiy Butenko

From Springer
Bibliographic data for series maintained by Sonal Shukla ().

Access Statistics for this journal.
Track citations for all items by RSS feed
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 72, issue 4, 2018

Maximum-entropy sampling and the Boolean quadric polytope pp. 603-618 Downloads
Kurt M. Anstreicher
Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems pp. 619-653 Downloads
N. Ito, S. Kim, M. Kojima, A. Takeda and K.-C. Toh
Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers pp. 655-678 Downloads
T. D. Chuong and V. Jeyakumar
Equivalent Lipschitz surrogates for zero-norm and rank optimization problems pp. 679-704 Downloads
Yulan Liu, Shujun Bi and Shaohua Pan
A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique pp. 705-729 Downloads
W. Geremew, N. M. Nam, A. Semenov, V. Boginski and E. Pasiliao
Tractability of convex vector optimization problems in the sense of polyhedral approximations pp. 731-742 Downloads
Firdevs Ulus
Variational inequality formulation for the games with random payoffs pp. 743-760 Downloads
Vikas Vikram Singh and Abdel Lisser
A class of differential hemivariational inequalities in Banach spaces pp. 761-779 Downloads
Stanisław Migórski and Shengda Zeng
Methods to compare expensive stochastic optimization algorithms with random restarts pp. 781-801 Downloads
Warren Hare, Jason Loeppky and Shangwei Xie

Volume 72, issue 3, 2018

Globally solving a class of optimal power flow problems in radial networks by tree reduction pp. 373-402 Downloads
Amir Beck, Yuval Beck, Yoash Levron, Alex Shtof and Luba Tetruashvili
Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints pp. 403-429 Downloads
Outi Montonen and Kaisa Joki
A note on the Douglas–Rachford splitting method for optimization problems involving hypoconvex functions pp. 431-441 Downloads
Ke Guo and Deren Han
Linear convergence of the generalized Douglas–Rachford algorithm for feasibility problems pp. 443-474 Downloads
Minh N. Dao and Hung M. Phan
On upper approximations of Pareto fronts pp. 475-490 Downloads
I. Kaliszewski and J. Miroforidis
Enhancing quantum efficiency of thin-film silicon solar cells by Pareto optimality pp. 491-515 Downloads
Andrea Patanè, Andrea Santoro, Vittorio Romano, Antonino La Magna and Giuseppe Nicosia
The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation pp. 517-538 Downloads
Yixin Zhao, Torbjörn Larsson, Elina Rönnberg and Panos M. Pardalos
Optimal channel assignment and L(p, 1)-labeling pp. 539-552 Downloads
Junlei Zhu, Yuehua Bu, Miltiades P. Pardalos, Hongwei Du, Huijuan Wang and Bin Liu
An abstract proximal point algorithm pp. 553-577 Downloads
Laurenţiu Leuştean, Adriana Nicolae and Andrei Sipoş
Limit vector variational inequality problems via scalarization pp. 579-590 Downloads
M. Bianchi, I. V. Konnov and R. Pini
On maximal monotonicity of bifunctions on Hadamard manifolds pp. 591-601 Downloads
J. X. Cruz Neto, F. M. O. Jacinto, P. A. Soares and J. C. O. Souza

Volume 72, issue 2, 2018

On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation pp. 129-153 Downloads
Emily Speakman and Jon Lee
Unifying local–global type properties in vector optimization pp. 155-179 Downloads
Ovidiu Bagdasar and Nicolae Popovici
A simplicial homology algorithm for Lipschitz optimisation pp. 181-217 Downloads
Stefan C. Endres, Carl Sandrock and Walter W. Focke
A nonconvex quadratic optimization approach to the maximum edge weight clique problem pp. 219-240 Downloads
Seyedmohammadhossein Hosseinian, Dalila B. M. M. Fontes and Sergiy Butenko
Exploiting algebraic structure in global optimization and the Belgian chocolate problem pp. 241-254 Downloads
Zachary Charles and Nigel Boston
Global optimization of nonconvex problems with convex-transformable intermediates pp. 255-276 Downloads
Carlos J. Nohra and Nikolaos V. Sahinidis
Convex envelopes of bivariate functions through the solution of KKT systems pp. 277-303 Downloads
Marco Locatelli
Decomposition-based Inner- and Outer-Refinement Algorithms for Global Optimization pp. 305-321 Downloads
Ivo Nowak, Norman Breitfeld, Eligius M. T. Hendrix and Grégoire Njacheun-Njanzoua
MultiGLODS: global and local multiobjective optimization using direct search pp. 323-345 Downloads
A. L. Custódio and J. F. A. Madeira
A vector linear programming approach for certain global optimization problems pp. 347-372 Downloads
Daniel Ciripoi, Andreas Löhne and Benjamin Weißing

Volume 72, issue 1, 2018

Preface: Special issue dedicated to Distance Geometry pp. 1-4 Downloads
Farid Alizadeh, Douglas Gonçalves, Nathan Krislock and Leo Liberti
Low-rank matrix completion using nuclear norm minimization and facial reduction pp. 5-26 Downloads
Shimeng Huang and Henry Wolkowicz
The minimum distance superset problem: formulations and algorithms pp. 27-53 Downloads
Leonardo Fontoura, Rafael Martinelli, Marcus Poggi and Thibaut Vidal
A new algorithm for the small-field astrometric point-pattern matching problem pp. 55-70 Downloads
Cláudio P. Santiago, Carlile Lavor, Sérgio Assunção Monteiro and Alberto Kroner-Martins
Minimal curvature-constrained networks pp. 71-87 Downloads
D. Kirszenblat, K. G. Sirinanda, M. Brazil, P. A. Grossman, J. H. Rubinstein and D. A. Thomas
Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations pp. 89-107 Downloads
Luiz H. Cherri, Adriana C. Cherri and Edilaine M. Soler
Tuning interval Branch-and-Prune for protein structure determination pp. 109-127 Downloads
Bradley Worley, Florent Delhommel, Florence Cordier, Thérèse E. Malliavin, Benjamin Bardiaux, Nicolas Wolff, Michael Nilges, Carlile Lavor and Leo Liberti

Volume 71, issue 4, 2018

In memoriam: Professor Christodoulos A. Floudas (1959–2016) pp. 651-653 Downloads
Efstratios N. Pistikopoulos
Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness pp. 655-690 Downloads
Radu Baltean-Lugojan and Ruth Misener
Global optimization of MIQCPs with dynamic piecewise relaxations pp. 691-716 Downloads
Pedro A. Castillo Castillo, Pedro M. Castro and Vladimir Mahalec
A symmetry-based splitting strategy for discretizable distance geometry problems pp. 717-733 Downloads
Felipe Fidalgo, Douglas S. Gonçalves, Carlile Lavor, Leo Liberti and Antonio Mucherino
An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems pp. 735-752 Downloads
M. M. Faruque Hasan
Convergence-order analysis of branch-and-bound algorithms for constrained problems pp. 753-813 Downloads
Rohit Kannan and Paul I. Barton
Arbitrarily tight $$\alpha $$ α BB underestimators of general non-linear functions over sub-optimal domains pp. 815-844 Downloads
N. Kazazakis and C. S. Adjiman
Optimization of black-box problems using Smolyak grids and polynomial approximations pp. 845-869 Downloads
Chris A. Kieslich, Fani Boukouvala and Christodoulos A. Floudas
Global optimization algorithm for capacitated multi-facility continuous location-allocation problems pp. 871-889 Downloads
Cristiana L. Lara, Francisco Trespalacios and Ignacio E. Grossmann
Optimal deterministic algorithm generation pp. 891-913 Downloads
Alexander Mitsos, Jaromił Najman and Ioannis G. Kevrekidis
A computational study of global optimization solvers on two trust region subproblems pp. 915-934 Downloads
Tiago Montanher, Arnold Neumaier and Ferenc Domes
A customized branch-and-bound approach for irregular shape nesting pp. 935-955 Downloads
Akang Wang, Christopher L. Hanselman and Chrysanthos E. Gounaris
Surrogate-based feasibility analysis for black-box stochastic simulations with heteroscedastic noise pp. 957-985 Downloads
Zilong Wang and Marianthi Ierapetritou
On solving generalized convex MINLP problems using supporting hyperplane techniques pp. 987-1011 Downloads
Tapio Westerlund, Ville-Pekka Eronen and Marko M. Mäkelä
Preface of the Special JOGO issue in Memory of Professor Christodoulos A. Floudas (1959–2016) pp. 1013-1013 Downloads
Ignacio Grossmann and Panos Pardalos

Volume 71, issue 3, 2018

Preface to the Special Issue “GOW’16” pp. 441-442 Downloads
Ana Maria A. C. Rocha, M. Fernanda P. Costa and Edite M. G. P. Fernandes
Testing pseudoconvexity via interval computation pp. 443-455 Downloads
Milan Hladík
Extensions on ellipsoid bounds for quadratic integer programming pp. 457-482 Downloads
Marcia Fampa and Francisco Pinillos Nieto
lsmear: a variable selection strategy for interval branch and bound solvers pp. 483-500 Downloads
Ignacio Araya and Bertrand Neveu
Feasibility pump for aircraft deconfliction with speed regulation pp. 501-515 Downloads
Sonia Cafieri and Claudia D’Ambrosio
Filter-based DIRECT method for constrained global optimization pp. 517-536 Downloads
M. Fernanda P. Costa, Ana Maria A. C. Rocha and Edite M. G. P. Fernandes
Metabolic pathway analysis using a nash equilibrium approach pp. 537-550 Downloads
Angelo Lucia, Peter A. DiMaggio and Diego Alonso-Martinez
Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations pp. 551-569 Downloads
Immanuel Bomze, Vaithilingam Jeyakumar and Guoyin Li
Reformulations for utilizing separability when solving convex MINLP problems pp. 571-592 Downloads
Jan Kronqvist, Andreas Lundell and Tapio Westerlund
Integrality gap minimization heuristics for binary mixed integer nonlinear programming pp. 593-612 Downloads
Wendel Melo, Marcia Fampa and Fernanda Raupp
A sampling-based exact algorithm for the solution of the minimax diameter clustering problem pp. 613-630 Downloads
Daniel Aloise and Claudio Contardo
Improving the performance and energy of Non-Dominated Sorting for evolutionary multiobjective optimization on GPU/CPU platforms pp. 631-649 Downloads
J. J. Moreno, G. Ortega, E. Filatovas, J. A. Martínez and E. M. Garzón

Volume 71, issue 2, 2018

Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property pp. 237-296 Downloads
M. V. Dolgopolik
A modified simplicial algorithm for convex maximization based on an extension of $$\omega $$ ω -subdivision pp. 297-311 Downloads
Takahito Kuno
Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization pp. 313-339 Downloads
Shinji Yamada and Akiko Takeda
“Optimal” choice of the step length of the projection and contraction methods for solving the split feasibility problem pp. 341-360 Downloads
Q. L. Dong, Y. C. Tang, Y. J. Cho and Th. M. Rassias
Nash game based efficient global optimization for large-scale design problems pp. 361-381 Downloads
Shengguan Xu and Hongquan Chen
Hartley properly and super nondominated solutions in vector optimization with a variable ordering structure pp. 383-405 Downloads
Shokouh Shahbeyk, Majid Soleimani-damaneh and Refail Kasimbeyli
Efficient multiobjective optimization employing Gaussian processes, spectral sampling and a genetic algorithm pp. 407-438 Downloads
Eric Bradford, Artur M. Schweidtmann and Alexei Lapkin
Correction to: Efficient multiobjective optimization employing Gaussian processes, spectral sampling and a genetic algorithm pp. 439-440 Downloads
Eric Bradford, Artur M. Schweidtmann and Alexei Lapkin

Volume 71, issue 1, 2018

Guest editors’ preface to the special issue devoted to the 2nd International Conference “Numerical Computations: Theory and Algorithms”, June 19–25, 2016, Pizzo Calabro, Italy pp. 1-4 Downloads
Renato Leone, Yaroslav D. Sergeyev and Anatoly Zhigljavsky
Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants pp. 5-20 Downloads
Remigijus Paulavičius, Lakhdar Chiter and Julius Žilinskas
Solving a set of global optimization problems by the parallel technique with uniform convergence pp. 21-36 Downloads
Konstantin Barkalov and Roman Strongin
Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations pp. 37-55 Downloads
Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico and Adil M. Bagirov
Performance of global random search algorithms for large dimensions pp. 57-71 Downloads
Andrey Pepelyshev, Anatoly Zhigljavsky and Antanas Žilinskas
Efficient multicriterial optimization based on intensive reuse of search information pp. 73-90 Downloads
Victor Gergel and Evgeny Kozinov
On a class of bilevel linear mixed-integer programs in adversarial settings pp. 91-113 Downloads
M. Hosein Zare, Osman Y. Özaltın and Oleg A. Prokopyev
An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section pp. 115-127 Downloads
Albertas Gimbutas and Antanas Žilinskas
Approximating a solution set of nonlinear inequalities pp. 129-145 Downloads
Yuri Evtushenko, Mikhail Posypkin, Larisa Rybak and Andrei Turkin
Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning pp. 147-163 Downloads
Wenjuan Fan, Jun Pei, Xinbao Liu, Panos M. Pardalos and Min Kong
On convergence rate of a rectangular partition based global optimization algorithm pp. 165-191 Downloads
James Calvin, Gražina Gimbutienė, William O. Phillips and Antanas Žilinskas
GOSH: derivative-free global optimization using multi-dimensional space-filling curves pp. 193-211 Downloads
Daniela Lera and Yaroslav D. Sergeyev
Bayesian optimization of pump operations in water distribution systems pp. 213-235 Downloads
A. Candelieri, R. Perego and F. Archetti
Page updated 2018-12-15