Pages that link to "Item:Q1777602"
From MaRDI portal
The following pages link to Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms (Q1777602):
Displaying 7 items.
- Adaptive nested optimization scheme for multidimensional global search (Q330495) (← links)
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme (Q433950) (← links)
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems (Q907199) (← links)
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants (Q1754443) (← links)
- On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization (Q2199619) (← links)
- A hybrid global optimization algorithm for nonlinear least squares regression (Q2392764) (← links)
- On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients (Q5270520) (← links)
