default search action
Journal of Global Optimization, Volume 86
Volume 86, Number 1, May 2023
- Youssef Diouane
, Victor Picheny, Rodolphe Le Riche
TREGO: a trust-region framework for efficient global optimization. 1-23 - Heinz H. Bauschke, Manish Krishan Lal
Projections onto hyperbolas or bilinear constraint sets in Hilbert spaces. 25-36 - Jia-Jiang Lin, Feng Xu, Xiong-Lin Luo
Nonconvex sensitivity-based generalized Benders decomposition. 37-60 - Bo Zhang, Yuelin Gao
Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems. 61-92 - Pham Duy Khanh
Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials. 93-122 - Chinedu Izuchukwu
Extension of forward-reflected-backward method to non-convex mixed variational inequalities. 123-140 - Nguyen Xuan Hai, Nguyen Hong Quan, Vo Viet Tri:
Some saddle-point theorems for vector-valued functions. 141-161 - Cheikh Toure, Anne Auger, Nikolaus Hansen:
Global linear convergence of evolution strategies with recombination on scaling-invariant functions. 163-203 - Wei-Kun Chen
Lifting for the integer knapsack cover polyhedron. 205-249 - Qiao Zhang, Xiucui Guan
The restricted inverse optimal value problem on shortest path under l1 norm on trees. 251-284
Volume 86, Number 2, June 2023
- Marco Locatelli
KKT-based primal-dual exactness conditions for the Shor relaxation. 285-301 - Peiping Shen
Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound. 303-321 - Qian Li, Wei Zhang
A non-convex piecewise quadratic approximation of ℓ 0 regularization: theory and accelerated algorithm. 323-353 - Nejat Arinik
Efficient enumeration of the optimal solutions to the correlation clustering problem. 355-391 - Arne Herzel, Stephan Helfrich
Approximating biobjective minimization problems using general ordering cones. 393-415 - Stephan Helfrich
Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems. 417-440 - Sergio Cabello
Faster distance-based representative skyline and k-center along pareto front in the plane. 441-466 - Sanath Darshana Kahagalage
A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems. 467-494 - Zheng-Hai Huang, Yu-Fan Li, Yong Wang:
A fixed point iterative method for tensor complementarity problems with the implicit Z-tensors. 495-520 - Andreas T. Ernst, Lars Grüne, Janosch Rieger
A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems. 521-543
Volume 86, Number 3, July 2023
- Huiyi Cao, Kamil A. Khan
General convex relaxations of implicit functions and inverse functions. 545-572 - Jens Deussen
Subdomain separability in global optimization. 573-588 - Liping Pang
A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems. 589-620 - R. Díaz Millán
Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems. 621-636 - Alireza Olama
Distributed primal outer approximation algorithm for sparse convex programming with separable structures. 637-670 - Godai Azuma
Exact SDP relaxations for quadratic programs with bipartite graph structures. 671-691 - Jixiang Qing
A robust multi-objective Bayesian optimization framework considering input uncertainty. 693-711 - Bogdan Iftimie
A robust investment-consumption optimization problem in a switching regime interest rate setting. 713-739 - Gabriella Colajanni
A three-stage stochastic optimization model integrating 5G technology and UAVs for disaster management. 741-780 - Rui Ding, Chaoren Ding, Quan Shen:
The interpolating element-free Galerkin method for the p-Laplace double obstacle mixed complementarity problem. 781-820
Volume 86, Number 4, August 2023
- Zhili Ge, Zhongming Wu, Xin Zhang
An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems. 821-844 - Alireza Kabgani
Semistrictly and neatly quasiconvex programming using lower global subdifferentials. 845-865 - Tong-tong Shang, Guo-ji Tang
Structured tensor tuples to polynomial complementarity problems. 867-883 - Brijnesh J. Jain, Vincent Froese
An average-compress algorithm for the sample mean problem under dynamic time warping. 885-903 - Feng Guo, Liguo Jiao
A new scheme for approximating the weakly efficient solution set of vector rational optimization problems. 905-930 - Elena Molho
On the study of multistage stochastic vector quasi-variational problems. 931-952 - Tong-tong Shang, Guo-ji Tang
Mixed polynomial variational inequalities. 953-988 - Fatemeh Fakhar, Hamid Reza Hajisharifi, Zeinab Soltani:
Noncoercive and noncontinuous equilibrium problems: existence theorem in infinite-dimensional spaces. 989-1003 - Mohammad Taghi Nadi, Jafar Zafarani
Second-order characterization of convex mappings in Banach spaces and its applications. 1005-1023 - Markus Friedemann, Felix Harder, Gerd Wachsmuth
Finding global solutions of some inverse optimal control problems using penalization and semismooth Newton methods. 1025-1061
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: