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 81, issue 4, 2021

A geometric branch and bound method for robust maximization of convex functions pp. 835-859

Fengqiao Luo and Sanjay Mehrotra

Branch-and-price for a class of nonconvex mixed-integer nonlinear programs pp. 861-880

Andrew Allman and Qi Zhang

On global subdifferentials with applications in nonsmooth optimization pp. 881-900

Felipe Lara and Alireza Kabgani

A power penalty approach to a mixed quasilinear elliptic complementarity problem pp. 901-918

Yarui Duan, Song Wang and Yuying Zhou

Integer programming formulations and efficient local search for relaxed correlation clustering pp. 919-966

Eduardo Queiroga, Anand Subramanian, Rosa Figueiredo and Yuri Frota

ORCA: Outlier detection and Robust Clustering for Attributed graphs pp. 967-989

Srinivas Eswar, Ramakrishnan Kannan, Richard Vuduc and Haesun Park

Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization pp. 991-1017

Ting Tao, Shaohua Pan and Shujun Bi

Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations pp. 1019-1055

Chungen Shen and Xiao Liu

Experimental analysis of local searches for sparse reflexive generalized inverses pp. 1057-1093

Marcia Fampa, Jon Lee, Gabriel Ponte and Luze Xu

Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity pp. 1095-1117

T. D. Chuong, V. Jeyakumar, G. Li and D. Woolnough

Volume 81, issue 3, 2021

Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction pp. 559-598

María López Quijorna

An objective penalty function method for biconvex programming pp. 599-620

Zhiqing Meng, Min Jiang, Rui Shen, Leiyan Xu and Chuangyin Dang

Exclusion regions for parameter-dependent systems of equations pp. 621-644

Bettina Ponleitner and Hermann Schichl

A modified simplex partition algorithm to test copositivity pp. 645-658

Mohammadreza Safi, Seyed Saeed Nabavi and Richard J. Caron

An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron pp. 659-689

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

A dual approach to multi-dimensional assignment problems pp. 691-716

Jingqun Li, Thia Kirubarajan, R. Tharmarasa, Daly Brown and Krishna R. Pattipati

Nonconvex and Nonsmooth Sparse Optimization via Adaptively Iterative Reweighted Methods pp. 717-748

Hao Wang, Fan Zhang, Yuanming Shi and Yaohua Hu

Dual-density-based reweighted $$\ell _{1}$$ ℓ 1 -algorithms for a class of $$\ell _{0}$$ ℓ 0 -minimization problems pp. 749-772

Jialiang Xu and Yun-Bin Zhao

Improved interval methods for solving circle packing problems in the unit square pp. 773-803

Mihály Csaba Markót

A branch-cut-and-price algorithm for optimal decoding in digital communication systems pp. 805-834

Banu Kabakulak, Z. Caner Taşkın and Ali Emre Pusane

Volume 81, issue 2, 2021

Decomposition in derivative-free optimization pp. 269-292

Kaiwen Ma, Nikolaos V. Sahinidis, Sreekanth Rajagopalan, Satyajith Amaran and Scott J Bury

Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations pp. 293-321

Jacek Gondzio and E. Alper Yıldırım

A variational approach to the alternating projections method pp. 323-350

Carlo Alberto Bernardi and Enrico Miglierina

Optimality conditions based on the Fréchet second-order subdifferential pp. 351-365

D. T. V. An and N. D. Yen

A branch-and-bound algorithm for solving max-k-cut problem pp. 367-389

Cheng Lu and Zhibin Deng

Scenario-based cuts for structured two-stage stochastic and distributionally robust p-order conic mixed integer programs pp. 391-433

Manish Bansal and Yingqiu Zhang

Copula theory approach to stochastic geometric programming pp. 435-468

Rashed Khanjani-Shiraz, Salman Khodayifar and Panos M. Pardalos

Model risk in mean-variance portfolio selection: an analytic solution to the worst-case approach pp. 469-491

Roberto Baviera and Giulia Bianchi

Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization pp. 493-528

Ken Kobayashi, Yuichi Takano and Kazuhide Nakata

Detecting and solving aircraft conflicts using bilevel programming pp. 529-557

Martina Cerulli, Claudia D’Ambrosio, Leo Liberti and Mercedes Pelegrín

Volume 81, issue 1, 2021

Preface to the special issue of JOGO on the occasion of the 40th anniversary of the Group for Research in Decision Analysis (GERAD) pp. 1-2

Daniel Aloise, Gilles Caporossi and Sébastien Digabel

Learning chordal extensions pp. 3-22

Defeng Liu, Andrea Lodi and Mathieu Tanneau

The conditional p-dispersion problem pp. 23-83

Marilène Cherkesly and Claudio Contardo

Learning discontinuous piecewise affine fitting functions using mixed integer programming over lattice pp. 85-108

Ruobing Shen, Bo Tang, Leo Liberti, Claudia D’Ambrosio and Stéphane Canu

Advances in verification of ReLU neural networks pp. 109-152

Ansgar Rössig and Milena Petkovic

Resolving sets and integer programs for recommender systems pp. 153-178

Alain Hertz, Tsvi Kuflik and Noa Tuval

An outer–inner linearization method for non-convex and nondifferentiable composite regularization problems pp. 179-202

Minh Pham, Xiaodong Lin, Andrzej Ruszczyński and Yu Du

Surrogate optimization of deep neural networks for groundwater predictions pp. 203-231

Juliane Müller, Jangho Park, Reetik Sahu, Charuleka Varadharajan, Bhavna Arora, Boris Faybishenko and Deborah Agarwal

Optimal decision trees for categorical data via integer programming pp. 233-260

Oktay Günlük, Jayant Kalagnanam, Minhan Li, Matt Menickelly and Katya Scheinberg

Using symbolic calculations to determine largest small polygons pp. 261-268

Charles Audet, Pierre Hansen and Dragutin Svrtan

Volume 80, issue 4, 2021

Linearization of McCormick relaxations and hybridization with the auxiliary variable method pp. 731-756

Jaromił Najman, Dominik Bongartz and Alexander Mitsos

Convex hull representations for bounded products of variables pp. 757-778

Kurt M. Anstreicher, Samuel Burer and Kyungchan Park

On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic pp. 779-804

B. G.-Tóth, L. G. Casado, E. M. T. Hendrix and F. Messine

Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization pp. 805-840

Andriy Shapoval and Eva K. Lee

Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems pp. 841-864

Zehui Jia, Jieru Huang and Xingju Cai

MVMOO: Mixed variable multi-objective optimisation pp. 865-886

Jamie A. Manson, Thomas W. Chamberlain and Richard A. Bourne

Optimizing generalized kernels of polygons pp. 887-920

Alejandra Martinez-Moraian, David Orden, Leonidas Palios, Carlos Seara and Paweł Żyliński

Unique solvability of weakly homogeneous generalized variational inequalities pp. 921-943

Xueli Bai, Mengmeng Zheng and Zheng-Hai Huang

Dynamical system for solving bilevel variational inequalities pp. 945-963

Pham Ky Anh and Trinh Ngoc Hai

Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system pp. 965-989

Bismark Singh and Bernard Knueven

Volume 80, issue 3, 2021

An interval branch and bound method for global Robust optimization pp. 507-522

Emilio Carrizosa and Frédéric Messine

Partially distributed outer approximation pp. 523-550

Alexander Murray, Timm Faulwasser, Veit Hagenmeyer, Mario E. Villanueva and Boris Houska

Near optimal minimal convex hulls of disks pp. 551-594

Josef Kallrath, Joonghyun Ryu, Chanyoung Song, Mokwon Lee and Deok-Soo Kim

Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint pp. 595-616

Zhenning Zhang, Donglei Du, Yanjun Jiang and Chenchen Wu

Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems pp. 617-634

Janusz Miroforidis

Smoothing Newton method for nonsmooth second-order cone complementarity problems with application to electric power markets pp. 635-659

Pin-Bo Chen, Gui-Hua Lin, Xide Zhu and Fusheng Bai

Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks pp. 661-677

Yingli Ran, Xiaohui Huang, Zhao Zhang and Ding-Zhu Du

Efficient approximation of the metric CVRP in spaces of fixed doubling dimension pp. 679-710

Michael Khachay, Yuri Ogorodnikov and Daniel Khachay

An optimization approach for winner determination problem considering transportation cost discounts pp. 711-728

Fang Yang and Yao-Huei Huang

Review on the monograph Deterministic Global Optimization: An Introduction to the Diagonal Approach, Springer, 2017, written by Yaroslav D. Sergeyev and Dmitri E. Kvasov pp. 729-730

Timoleon Kipouros

Volume 80, issue 2, 2021

Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation pp. 231-248

Sourour Elloumi, Amélie Lambert and Arnaud Lazare

Convexification techniques for linear complementarity constraints pp. 249-286

Trang T. Nguyen, Jean-Philippe P. Richard and Mohit Tawarmalani

Convexification of bilinear forms through non-symmetric lifting pp. 287-305

Marcia Fampa and Jon Lee

Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks pp. 307-340

Frauke Liers, Alexander Martin, Maximilian Merkert, Nick Mertens and Dennis Michaels

Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension pp. 341-356

Zhuoyi Xu, Yong Xia and Jiulin Wang

On tackling reverse convex constraints for non-overlapping of unequal circles pp. 357-385

Akang Wang and Chrysanthos E. Gounaris

A robust method based on LOVO functions for solving least squares problems pp. 387-414

E. V. Castelani, R. Lopes, W. V. I. Shirabayashi and F. N. C. Sobral

A smoothing quasi-Newton method for solving general second-order cone complementarity problems pp. 415-438

Jingyong Tang and Jinchuan Zhou

A method for convex black-box integer global optimization pp. 439-477

Jeffrey Larson, Sven Leyffer, Prashant Palkar and Stefan M. Wild

Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning pp. 479-505

Hideaki Iiduka

Volume 80, issue 1, 2021

Preface of the special issue on global multiobjective optimization pp. 1-2

Kaisa Miettinen and Serpil Sayin

Inverse multiobjective optimization: Inferring decision criteria from data pp. 3-29

Bennet Gebken and Sebastian Peitz

Nonconvex constrained optimization by a filtering branch and bound pp. 31-61

Gabriele Eichfelder, Kathrin Klamroth and Julia Niebling

Proximity measures based on KKT points for constrained multi-objective optimization pp. 63-86

Gabriele Eichfelder and Leo Warnow

One-exact approximate Pareto sets pp. 87-115

Arne Herzel, Cristina Bazgan, Stefan Ruzika, Clemens Thielen and Daniel Vanderpooten

Multi-objective convex polynomial optimization and semidefinite programming relaxations pp. 117-138

Jae Hyoung Lee, Nithirat Sisarat and Liguo Jiao

Duality in nonconvex vector optimization pp. 139-160

Refail Kasimbeyli and Masoud Karimi

Essential stability in unified vector optimization pp. 161-175

Shiva Kapoor and C. S. Lalitha

Necessary conditions for weak minima and for strict minima of order two in nonsmooth constrained multiobjective optimization pp. 177-193

Elena Constantin

A general branch-and-bound framework for continuous global multiobjective optimization pp. 195-227

Gabriele Eichfelder, Peter Kirst, Laura Meng and Oliver Stein

Correction to: A general branch-and-bound framework for continuous global multiobjective optimization pp. 229-229

Gabriele Eichfelder, Peter Kirst, Laura Meng and Oliver Stein