- Panos M. Pardalos, Ingrida Steponavičė, Antanas Z̆ilinskas, “Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming”, Optim Lett, 6, no. 4, 2012, 665
- Victor Gergel, Evgeny Kozinov, “Efficient multicriterial optimization based on intensive reuse of search information”, J Glob Optim, 71, no. 1, 2018, 73
- Xueli Jiang, Fenmei Wang, Jingang Jiang, 2019 IEEE 1st International Conference on Civil Aviation Safety and Information Technology (ICCASIT), 2019, 351
- Linas Stripinis, Remigijus Paulavičius, Derivative-free DIRECT-type Global Optimization, 2023, 1
- Antonio Candelieri, Ilaria Giordani, Francesco Archetti, 10556, Learning and Intelligent Optimization, 2017, 34
- Haitao Liu, Shengli Xu, Ying Ma, Xiaofang Wang, “Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces”, J Glob Optim, 63, no. 2, 2015, 229
- Roman Strongin, Konstantin Barkalov, Semen Bevzuk, “Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints”, Soft Comput, 24, no. 16, 2020, 11853
- Antanas Žilinskas, Gražina Gimbutienė, “A hybrid of Bayesian approach based global search with clustering aided local refinement”, Communications in Nonlinear Science and Numerical Simulation, 78, 2019, 104857
- Luc Pronzato, Anatoly A. Zhigljavsky, “Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria”, Journal of Statistical Planning and Inference, 154, 2014, 141
- Nazih-Eddine Belkacem, Lakhdar Chiter, Mohammed Louaked, “A Novel Approach to Enhance DIRECT-Type Algorithms for Hyper-Rectangle Identification”, Mathematics, 12, no. 2, 2024, 283