An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section
From MaRDI portal
Publication:1754452
DOI10.1007/s10898-017-0550-9zbMath1402.90129OpenAlexW2741386617MaRDI QIDQ1754452
Albertas Gimbutas, Antanas Žilinskas
Publication date: 30 May 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0550-9
Related Items
Revisiting norm optimization for multi-objective black-box problems: a finite-time analysis ⋮ Guest editors' preface to the special issue devoted to the 2nd international conference ``Numerical computations: theory and algorithms, June 19--25, 2016, Pizzo Calabro, Italy ⋮ A \textsc{direct}-type global optimization algorithm for image registration ⋮ Bi-objective decision making in global optimization based on statistical models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Lipschitz global optimization methods in control problems
- On the worst-case optimal multi-objective global optimization
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
- Lipschitzian optimization without the Lipschitz constant
- Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Introduction to global optimization
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- A one-dimensional deterministic global minimization algorithm
- On similarities between two models of global optimization: Statistical models and radial basis functions
- Simplicial Lipschitz optimization without the Lipschitz constant
- Globally-biased disimpl algorithm for expensive global optimization
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- Simplicial Global Optimization
- Algorithm 829
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- A Sequential Method Seeking the Global Maximum of a Function
- Optimal strategies of the search for an extremum
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- A locally-biased form of the DIRECT algorithm.
