Pages that link to "Item:Q2810113"
From MaRDI portal
The following pages link to A second-order globally convergent direct-search method and its worst-case complexity (Q2810113):
Displaying 8 items.
- Worst case complexity of direct search (Q743632) (← links)
- Accelerations for global optimization covering methods using second derivatives (Q1318273) (← links)
- Generating set search using simplex gradients for bound-constrained black-box optimization (Q2028453) (← links)
- A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds (Q2288191) (← links)
- Direct search based on probabilistic feasible descent for bound and linearly constrained problems (Q2419520) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- Direct Search Based on Probabilistic Descent (Q5502242) (← links)
- Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization (Q6057628) (← links)