Pages that link to "Item:Q2706358"
From MaRDI portal
The following pages link to On the Convergence of Grid-Based Methods for Unconstrained Optimization (Q2706358):
Displayed 29 items.
- Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions (Q652326) (← links)
- A convergent variant of the Nelder--Mead algorithm (Q700697) (← links)
- An optimal algorithm for global optimization and adaptive covering (Q727397) (← links)
- Grid restrained Nelder-Mead algorithm (Q853559) (← links)
- A quasi-Newton based pattern search algorithm for unconstrained optimization (Q864827) (← links)
- Grid-based methods for linearly equality constrained optimization problems (Q874345) (← links)
- A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization (Q931755) (← links)
- Unconstrained derivative-free optimization by successive approximation (Q953370) (← links)
- A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization (Q979825) (← links)
- Frame-based ray search algorithms in unconstrained optimization (Q1411465) (← links)
- Extended global convergence framework for unconstrained optimization (Q1882487) (← links)
- New horizons in sphere-packing theory, part II: Lattice-based derivative-free optimization via global surrogates (Q1955548) (← links)
- A modified Nelder-Mead barrier method for constrained optimization (Q2062438) (← links)
- Gradient-free aerodynamic shape optimization using Large Eddy Simulation (Q2072308) (← links)
- High-fidelity gradient-free optimization of low-pressure turbine cascades (Q2102011) (← links)
- A deterministic algorithm to compute the cosine measure of a finite positive spanning set (Q2192976) (← links)
- Linear equalities in blackbox optimization (Q2340487) (← links)
- On the properties of positive spanning sets and positive bases (Q2357977) (← links)
- A frame-based conjugate gradients direct search method with radial basis function interpolation model (Q2398571) (← links)
- Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm (Q2518730) (← links)
- Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems (Q3458824) (← links)
- Direct search nonsmooth constrained optimization via rounded ℓ<sub>1</sub> penalty functions (Q5038179) (← links)
- Exploiting Problem Structure in Derivative Free Optimization (Q5066599) (← links)
- Improved load forecasting model based on two-stage optimization of gray model with fractional order accumulation and Markov chain (Q5079972) (← links)
- The Unreliable<i>M</i>/<i>M</i>/1 Retrial Queue in a Random Environment (Q5389046) (← links)
- Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization (Q5437525) (← links)
- Exploiting problem structure in pattern search methods for unconstrained optimization (Q5475286) (← links)
- Frame based methods for unconstrained optimization (Q5925722) (← links)
- Nicely structured positive bases with maximal cosine measure (Q6164951) (← links)