Journal: J. Global Optimization

Volume 86, Issue 4

821 -- 844Zhili Ge, Zhongming Wu, Xin Zhang 0087, Qin Ni. An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems
845 -- 865Alireza Kabgani, Felipe Lara. Semistrictly and neatly quasiconvex programming using lower global subdifferentials
867 -- 883Tong-tong Shang, Guo-ji Tang. Structured tensor tuples to polynomial complementarity problems
885 -- 903Brijnesh J. Jain, Vincent Froese, David Schultz. An average-compress algorithm for the sample mean problem under dynamic time warping
905 -- 930Feng Guo, Liguo Jiao. A new scheme for approximating the weakly efficient solution set of vector rational optimization problems
931 -- 952Elena Molho, Domenico Scopelliti. On the study of multistage stochastic vector quasi-variational problems
953 -- 988Tong-tong Shang, Guo-ji Tang. Mixed polynomial variational inequalities
989 -- 1003Fatemeh Fakhar, Hamid Reza Hajisharifi, Z. Soltani. Noncoercive and noncontinuous equilibrium problems: existence theorem in infinite-dimensional spaces
1005 -- 1023Mohammad Taghi Nadi, Jafar Zafarani. Second-order characterization of convex mappings in Banach spaces and its applications
1025 -- 1061Markus Friedemann, Felix Harder, Gerd Wachsmuth. Finding global solutions of some inverse optimal control problems using penalization and semismooth Newton methods

Volume 86, Issue 3

545 -- 572Huiyi Cao, Kamil A. Khan. General convex relaxations of implicit functions and inverse functions
573 -- 588Jens Deussen, Uwe Naumann. Subdomain separability in global optimization
589 -- 620Liping Pang, Xiaoliang Wang, Fan-Yun Meng. A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
621 -- 636R. Díaz Millán, Orizon Pereira Ferreira, Julien Ugon. Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems
637 -- 670Alireza Olama, Eduardo Camponogara, Paulo R. C. Mendes. Distributed primal outer approximation algorithm for sparse convex programming with separable structures
671 -- 691Godai Azuma, Mituhiro Fukuda, Sunyoung Kim, Makoto Yamashita. Exact SDP relaxations for quadratic programs with bipartite graph structures
693 -- 711Jixiang Qing, Ivo Couckuyt, Tom Dhaene. A robust multi-objective Bayesian optimization framework considering input uncertainty
713 -- 739Bogdan Iftimie. A robust investment-consumption optimization problem in a switching regime interest rate setting
741 -- 780Gabriella Colajanni, Patrizia Daniele, Anna Nagurney, Ladimer S. Nagurney, Daniele Sciacca. A three-stage stochastic optimization model integrating 5G technology and UAVs for disaster management
781 -- 820Rui Ding, Chaoren Ding, Quan Shen. The interpolating element-free Galerkin method for the p-Laplace double obstacle mixed complementarity problem

Volume 86, Issue 2

285 -- 301Marco Locatelli 0001. KKT-based primal-dual exactness conditions for the Shor relaxation
303 -- 321Peiping Shen, Dianxiao Wu, Kaimin Wang. Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound
323 -- 353Qian Li, Wei Zhang 0172, Yanqin Bai, Guoqiang Wang. 0 regularization: theory and accelerated algorithm
355 -- 391Nejat Arinik, Rosa Figueiredo 0001, Vincent Labatut. Efficient enumeration of the optimal solutions to the correlation clustering problem
393 -- 415Arne Herzel, Stephan Helfrich, Stefan Ruzika, Clemens Thielen. Approximating biobjective minimization problems using general ordering cones
417 -- 440Stephan Helfrich, Tyler A. Perini, Pascal Halffmann, Natashia Boland, Stefan Ruzika. Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems
441 -- 466Sergio Cabello. Faster distance-based representative skyline and k-center along pareto front in the plane
467 -- 494Sanath Darshana Kahagalage, Hasan Hüseyin Turan, Fatemeh Jalalvand, Sondoss El Sawah. A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems
495 -- 520Zheng-Hai Huang, Yu-Fan Li, Yong Wang. A fixed point iterative method for tensor complementarity problems with the implicit Z-tensors
521 -- 543Andreas Ernst, Lars Grüne, Janosch Rieger. A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems

Volume 86, Issue 1

1 -- 23Youssef Diouane, Victor Picheny, Rodolphe Le Riche, Alexandre Scotto Di Perrotolo. TREGO: a trust-region framework for efficient global optimization
25 -- 36Heinz H. Bauschke, Manish Krishan Lal, Xianfu Wang. Projections onto hyperbolas or bilinear constraint sets in Hilbert spaces
37 -- 60Jia-Jiang Lin, Feng Xu, Xiong-Lin Luo. Nonconvex sensitivity-based generalized Benders decomposition
61 -- 92Bo Zhang, Yuelin Gao, Xia Liu, Xiaoli Huang. Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
93 -- 122Pham Duy Khanh, Boris S. Mordukhovich, Vo Thanh Phat, Dat Ba Tran. Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials
123 -- 140Chinedu Izuchukwu, Yekini Shehu, Chibueze Christian Okeke. Extension of forward-reflected-backward method to non-convex mixed variational inequalities
141 -- 161Nguyen Xuan Hai, Nguyen Hong Quan, Vo Viet Tri. Some saddle-point theorems for vector-valued functions
163 -- 203Cheikh Toure, Anne Auger, Nikolaus Hansen. Global linear convergence of evolution strategies with recombination on scaling-invariant functions
205 -- 249Wei-Kun Chen, Liang Chen, Yu-Hong Dai. Lifting for the integer knapsack cover polyhedron
251 -- 284Qiao Zhang, Xiucui Guan, Junhua Jia, Xinqiang Qian, Panos M. Pardalos. 1 norm on trees