Pages that link to "Item:Q816060"
From MaRDI portal
The following pages link to Beyond convex? global optimization is feasible only for convex objective functions: a theorem (Q816060):
Displaying 3 items.
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties (Q2018512) (← links)
- Using expert knowledge in solving the seismic inverse problem (Q2382784) (← links)
- A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions (Q2393063) (← links)
