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 82, issue 4, 2022

Preface to the special issue dedicated to the 6th World Congress on Global Optimization held in Metz, France, July 8–10, 2019 pp. 655-657

Hoai An Le Thi, Tao Pham Dinh and Yaroslav D. Sergeyev

New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming pp. 659-689

Mohand Bentobache, Mohamed Telli and Abdelkader Mokhtari

A binary search algorithm for univariate data approximation and estimation of extrema by piecewise monotonic constraints pp. 691-726

Ioannis C. Demetriou

Low-rank matrix recovery with Ky Fan 2-k-norm pp. 727-751

Xuan Vinh Doan and Stephen Vavasis

Global sensing search for nonlinear global optimization pp. 753-802

Abdel-Rahman Hedar, Wael Deabes, Hesham H. Amin, Majid Almaraashi and Masao Fukushima

Asynchronous optimization of part logistics routing problem pp. 803-834

Yaoting Huang, Boyu Chen, Wenlian Lu, Zhong-Xiao Jin and Ren Zheng

Gaining or losing perspective pp. 835-862

Jon Lee, Daphne Skipper and Emily Speakman

Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT pp. 863-896

Andreas Lundell and Jan Kronqvist

Alternating DC algorithm for partial DC programming problems pp. 897-928

Tao Pham Dinh, Huynh Van Ngai, Hoai An Le Thi and Vinh Thanh Ho

On stationarity for nonsmooth multiobjective problems with vanishing constraints pp. 929-949

Ali Sadeghieh, Nader Kanzi, Giuseppe Caristi and David Barilla

Characterization results of solutions in interval-valued optimization problems with mixed constraints pp. 951-964

Savin Treanţă

Integrating $$\varepsilon $$ ε -dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems pp. 965-992

Wenyu Wang, Taimoor Akhtar and Christine A. Shoemaker

Optimal deterministic and robust selection of electricity contracts pp. 993-1013

David Wu, Viet Hung Nguyen, Michel Minoux and Hai Tran

Graph, clique and facet of boolean logical polytope pp. 1015-1052

Kedong Yan and Hong Seo Ryoo

On canonical duality theory and constrained optimization problems pp. 1053-1070

Constantin Zălinescu

Volume 82, issue 3, 2022

Review and comparison of algorithms and software for mixed-integer derivative-free optimization pp. 433-462

Nikolaos Ploskas and Nikolaos V. Sahinidis

Sparse regularization via bidualization pp. 463-482

Amir Beck and Yehonathan Refael

Brezis pseudomonotone bifunctions and quasi equilibrium problems via penalization pp. 483-498

M. Bianchi, G. Kassay and R. Pini

Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities pp. 499-522

Zhong-bao Wang, Xue Chen, Jiang Yi and Zhang-you Chen

Strong convergence of inertial projection and contraction methods for pseudomonotone variational inequalities with applications to optimal control problems pp. 523-557

Bing Tan, Xiaolong Qin and Jen-Chih Yao

Generalized $${\varepsilon }$$ ε -quasi solutions of set optimization problems pp. 559-576

C. Gutiérrez, Rigoberto Lopez and J. Martínez

Linear convergence of a nonmonotone projected gradient method for multiobjective optimization pp. 577-594

Xiaopeng Zhao and Jen-Chih Yao

Multi-objective dynamic programming with limited precision pp. 595-614

L. Mandow, J. L. Perez- de-la-Cruz and N. Pozas

A note on completely positive relaxations of quadratic problems in a multiobjective framework pp. 615-626

Gabriele Eichfelder and Patrick Groetzner

Global optimization for the multilevel European gas market system with nonlinear flow models on trees pp. 627-653

Lars Schewe, Martin Schmidt and Johannes Thürauf

Volume 82, issue 2, 2022

On nondegenerate M-stationary points for sparsity constrained nonlinear optimization pp. 219-242

S. Lämmel and V. Shikhman

Exact SDP relaxations of quadratically constrained quadratic programs with forest structures pp. 243-262

Godai Azuma, Mituhiro Fukuda, Sunyoung Kim and Makoto Yamashita

Hidden invariant convexity for global and conic-intersection optimality guarantees in discrete-time optimal control pp. 263-281

Jorn H. Baayen and Krzysztof Postek

Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem pp. 283-312

Rok Hribar, Timotej Hrga, Gregor Papa, Gašper Petelin, Janez Povh, Nataša Pržulj and Vida Vukašinović

An extension of the proximal point algorithm beyond convexity pp. 313-329

Sorin-Mihai Grad and Felipe Lara

A unified Douglas–Rachford algorithm for generalized DC programming pp. 331-349

Chih-Sheng Chuang, Hongjin He and Zhiyuan Zhang

Conical averagedness and convergence analysis of fixed point algorithms pp. 351-373

Sedi Bartz, Minh N. Dao and Hung M. Phan

Improperly efficient solutions in a class of vector optimization problems pp. 375-387

Nguyen Thi Thu Huong and Nguyen Dong Yen

Existence results for solutions of mixed tensor variational inequalities pp. 389-412

Wenjie Mu and Jianghua Fan

Adaptive seeding for profit maximization in social networks pp. 413-432

Chuangen Gao, Shuyang Gu, Jiguo Yu, Hai Du and Weili Wu

Volume 82, issue 1, 2022

An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs pp. 1-20

E. Alper Yıldırım

Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization pp. 21-50

Jianyuan Zhai and Fani Boukouvala

Augmented Lagrangian method for second-order cone programs under second-order sufficiency pp. 51-81

Nguyen T. V. Hang, Boris S. Mordukhovich and M. Ebrahim Sarabi

An efficient alternating minimization method for fourth degree polynomial optimization pp. 83-103

Haibin Chen, Hongjin He, Yiju Wang and Guanglu Zhou

On reduction of exhausters via a support function representation pp. 105-118

Didem Tozkan

Strict directional solutions in vectorial problems: necessary optimality conditions pp. 119-138

Mohamed Ait Mansour, Marius Durea and Hassan Riahi

Error bound analysis for vector equilibrium problems with partial order provided by a polyhedral cone pp. 139-159

Nguyen Van Hung, Vicente Novo and Vo Minh Tam

Variational rationality, variational principles and the existence of traps in a changing environment pp. 161-177

Majid Fakhar, Mohammadreza Khodakhah, Ali Mazyaki, Antoine Soubeyran and Jafar Zafarani

Maximization problems of balancing submodular relevance and supermodular diversity pp. 179-194

Zhicheng Liu, Longkun Guo, Donglei Du, Dachuan Xu and Xiaoyan Zhang

Identification of mechanical properties of arteries with certification of global optimality pp. 195-217

Jan-Lucas Gade, Carl-Johan Thore and Jonas Stålhand

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