Pages that link to "Item:Q2465562"
From MaRDI portal
The following pages link to A global minimization algorithm for Lipschitz functions (Q2465562):
Displaying 14 items.
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function (Q386486) (← links)
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme (Q433950) (← links)
- A new exclusion test for finding the global minimum (Q869487) (← links)
- An algorithm for global optimization of Lipschitz continuous functions (Q1090241) (← links)
- Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions (Q1102868) (← links)
- On the investigation of the practical convergence of an algorithm of global optimization (Q1309090) (← links)
- One-dimensional center-based l 1-clustering method (Q1936788) (← links)
- Stochastic global optimization using tangent minorants for Lipschitz functions (Q1989202) (← links)
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties (Q2018512) (← links)
- Metaheuristic vs. deterministic global optimization algorithms: the univariate case (Q2422871) (← links)
- Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics (Q2660836) (← links)
- Algorithms for global minimizers in Lipschitz programming (Q3983760) (← links)
- (Q4302077) (← links)
- (Q4714336) (← links)
