Pages that link to "Item:Q276315"
From MaRDI portal
The following pages link to On the optimal order of worst case complexity of direct search (Q276315):
Displaying 11 items.
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization (Q1785005) (← links)
- On the properties of the cosine measure and the uniform angle subspace (Q2028479) (← links)
- Efficient unconstrained black box optimization (Q2146451) (← links)
- A deterministic algorithm to compute the cosine measure of a finite positive spanning set (Q2192976) (← links)
- Positive bases with maximal cosine measure (Q2329658) (← links)
- Direct search based on probabilistic feasible descent for bound and linearly constrained problems (Q2419520) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- Zeroth-order optimization with orthogonal random directions (Q6038668) (← links)
- Direct Search Based on Probabilistic Descent in Reduced Spaces (Q6071887) (← links)
- Quadratic regularization methods with finite-difference gradient approximations (Q6175465) (← links)
- Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization (Q6489314) (← links)
