Pages that link to "Item:Q1024739"
From MaRDI portal
The following pages link to A univariate global search working with a set of Lipschitz constants for the first derivative (Q1024739):
Displaying 22 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)
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization (Q506481) (← links)
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants (Q727093) (← links)
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization (Q727229) (← links)
- Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces (Q746814) (← links)
- Diagonal generalizaton of the DIRECT method for problems with constraints (Q828532) (← links)
- A deterministic global optimization using smooth diagonal auxiliary functions (Q907200) (← links)
- A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set (Q1675572) (← links)
- Geodesic and contour optimization using conformal mapping (Q1675629) (← links)
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants (Q1754443) (← links)
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves (Q1754461) (← links)
- An adaptive univariate global optimization algorithm and its convergence rate for twice continuously differentiable functions (Q1935284) (← links)
- A partition-based global optimization algorithm (Q1959242) (← links)
- A deterministic method for continuous global optimization using a dense curve (Q1998159) (← links)
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties (Q2018512) (← links)
- Convergence rate of a rectangular subdivision-based optimization algorithm for smooth multivariate functions (Q2128765) (← links)
- On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization (Q2199619) (← links)
- Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives (Q2199788) (← links)
- A Simulink-based software solution using the infinity computer methodology for higher order differentiation (Q2244122) (← links)
- Simplicial Lipschitz optimization without the Lipschitz constant (Q2249819) (← links)
- Globally-biased disimpl algorithm for expensive global optimization (Q2250095) (← links)