Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms
From MaRDI portal
Publication:1777602
DOI10.1007/s10957-004-0948-7zbMath1066.90094OpenAlexW2964112186MaRDI QIDQ1777602
Publication date: 24 May 2005
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-004-0948-7
Related Items (7)
Adaptive nested optimization scheme for multidimensional global search ⋮ A hybrid global optimization algorithm for nonlinear least squares regression ⋮ On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization ⋮ Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems ⋮ Lipschitz gradients for global optimization in a one-point-based partitioning scheme ⋮ Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants ⋮ On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients
Uses Software
Cites Work
- The cubic algorithm
- Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions
- The bisection method in higher dimensions
- Lipschitzian optimization without the Lipschitz constant
- A global optimization algorithm for multivariate functions with Lipschitzian first derivatives
- A deterministic algorithm for global optimization
- A comparison of global optimization methods for the design of a high-speed civil transport
- A fully‐distributed parallel global search algorithm
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
This page was built for publication: Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms
