Pages that link to "Item:Q4093226"
From MaRDI portal
The following pages link to A superlinearly convergent algorithm for minimization without evaluating derivatives (Q4093226):
Displayed 11 items.
- A discussion on variational analysis in derivative-free optimization (Q829491) (← links)
- Global convergence and stabilization of unconstrained minimization methods without derivatives (Q1090237) (← links)
- A variable metric algorithm for unconstrained minimization without evaluation of derivatives (Q1157671) (← links)
- On the convergence of a class of derivative-free minimization algorithms (Q1231764) (← links)
- Optimization of SMES and superconducting magnets with a derivative free deterministic method. (Q1418557) (← links)
- A derivative-free trust-region algorithm for composite nonsmooth optimization (Q2013620) (← links)
- Linear equalities in blackbox optimization (Q2340487) (← links)
- A second-order globally convergent direct-search method and its worst-case complexity (Q2810113) (← links)
- Stopping criteria for linesearch methods without derivatives (Q3696884) (← links)
- Optimization of functions whose values are subject to small errors (Q4140303) (← links)
- Derivative-free optimization methods (Q5230522) (← links)