default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Global Optimization, Volume 88
Volume 88, Number 1, January 2024
- Jack Noonan, Anatoly Zhigljavsky
:
Improving exploration strategies in large dimensions and rate of convergence of global random search algorithms. 1-26 - Enrico Bettiol, Christoph Buchheim, Marianna De Santis, Francesco Rinaldi:
An oracle-based framework for robust combinatorial optimization. 27-51 - Gintautas Dzemyda, Martynas Sabaliauskas:
Geometric multidimensional scaling: efficient approach for data dimensionality reduction. 53-77 - Xin Li, Dongya Wu:
Low-rank matrix estimation via nonconvex optimization methods in multi-response errors-in-variables regression. 79-114 - Cheng Lu, Jitao Ma, Zhibin Deng, Wenxun Xing:
A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem. 115-137 - Linas Stripinis, Remigijus Paulavicius:
Lipschitz-inspired HALRECT algorithm for derivative-free global optimization. 139-169 - Kai Jia, Xiaojun Duan, Zhengming Wang, Taihe Yi, Liang Yan, Xuan Chen:
A new partition method for DIRECT-type algorithm based on minimax design. 171-197 - Tomás Lagos, Oleg A. Prokopyev, Alexander Veremyev:
Finding groups with maximum betweenness centrality via integer programming with random path sampling. 199-232 - Vishwanath R. Singireddy, Manjanna Basappa:
Dispersing facilities on planar segment and circle amidst repulsion. 233-252 - Vu Thi Huong, Duong Thi Viet An, Hong-Kun Xu:
Subdifferentials of optimal value functions under metric qualification conditions. 253-283
Volume 88, Number 2, February 2024
- Christian Kanzow, Tanja Neder:
A bundle-type method for nonsmooth DC programs. 285-326 - Dawei Zhan, Jintao Wu, Huanlai Xing, Tianrui Li:
A cooperative approach to efficient global optimization. 327-357 - Yan-Chao Liang, Gui-Hua Lin:
Relaxed method for optimization problems with cardinality constraints. 359-375 - Eszter Julianna Csókás, Tamás Vinkó:
Constraint generation approaches for submodular function maximization leveraging graph properties. 377-394 - Polina Barabanshchikova, Alexandr Polyanskii:
Intersecting ellipses induced by a max-sum matching. 395-407 - Wenjie Zhao, Guangming Zhou:
Hausdorff distance between convex semialgebraic sets. 409-429 - Tao Jie, Gao Yan:
Directional shadow price in linearly constrained nonconvex optimization models. 431-460 - Tianyi Han, Liguo Jiao, Jae-Hyoung Lee, Junping Yin:
A utopia point method-based robust vector polynomial optimization scheme. 461-483 - Xian Zhang, Dingtao Peng, Yanyan Su:
A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems. 485-508 - Tie-jun Jiang, Dong-Ling Cai, Yi-bin Xiao, Stanislaw Migórski:
Time-dependent elliptic quasi-variational-hemivariational inequalities: well-posedness and application. 509-530
Volume 88, Number 3, March 2024
- Ilias S. Kotsireas, Panos M. Pardalos, Julius Zilinskas:
Preface. 531-532 - Hoai An Le Thi, Tao Pham Dinh:
Open issues and recent advances in DC programming and DCA. 533-590 - Dmitry V. Gribanov, Ivan A. Shumilov, Dmitriy S. Malyshev, Panos M. Pardalos:
On Δ-modular integer linear problems in the canonical form and equivalent problems. 591-651 - Alla R. Kammerdiner, Alexander Semenov, Eduardo L. Pasiliao:
Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem. 653-683 - Konstantinos E. Parsopoulos, Vasileios A. Tatsis, Ilias S. Kotsireas, Panos M. Pardalos:
Parallel algorithm portfolios with adaptive resource allocation strategy. 685-705 - Yaroslav D. Sergeyev, Maria Chiara Nasso, Daniela Lera:
Numerical methods using two different approximations of space-filling curves for black-box global optimization. 707-722 - Linas Stripinis, Remigijus Paulavicius:
An empirical study of various candidate selection and partitioning techniques in the DIRECT framework. 723-753 - Xiang-Kai Sun, Jiayi Huang, Kok Lay Teo:
On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems. 755-776 - Saulius Tautvaisas, Julius Zilinskas:
Scalable Bayesian optimization with generalized product of experts. 777-802
Volume 88, Number 4, April 2024
- Huu-Quang Nguyen, Ya-Chi Chu, Ruey-Lin Sheu:
Separating disconnected quadratic level sets by other quadratic level sets. 803-829 - Mitsuhiro Nishijima, Kazuhide Nakata:
Approximation hierarchies for copositive cone over symmetric cone and their comparison. 831-870 - Yueyao Li, Wenxun Xing:
Globalized distributionally robust optimization based on samples. 871-900 - Cao Thanh Tinh, Thai Doan Chuong:
Robust second order cone conditions and duality for multiobjective problems under uncertainty data. 901-926 - Weitian Wu, Xinmin Yang:
Reference-point-based branch and bound algorithm for multiobjective optimization. 927-945 - Donald R. Jones, Alberto Lovison:
Constrained multiobjective optimization of expensive black-box functions using a heuristic branch-and-bound approach. 947-978 - Wenyan Han, Guolin Yu:
Optimality and error bound for set optimization with application to uncertain multi-objective programming. 979-998 - Zhiming Zhong, Neng Fan, Lei Wu:
Multistage robust optimization for the day-ahead scheduling of hybrid thermal-hydro-wind-solar systems. 999-1034 - Christian Bingane, Michael J. Mossinghoff:
Small polygons with large area. 1035-1050 - Shimin Zhao, Tao Yan, Yuanguo Zhu:
Proximal gradient algorithm with trust region scheme on Riemannian manifold. 1051-1076
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 2025-12-02 23:28 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:
