On the convergence of grid-based methods for unconstrained optimization
From MaRDI portal
Recommendations
- Frame based methods for unconstrained optimization
- On the Convergence of Pattern Search Algorithms
- A direct search conjugate directions algorithm for unconstrained minimization
- On the Local Convergence of Pattern Search
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
Cited in
(35)- Frame based methods for unconstrained optimization
- Extended global convergence framework for unconstrained optimization
- A characterization of positive spanning sets with ties to strongly edge-connected digraphs
- Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm
- Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems
- Conjugate grids for unconstrained optimisation
- High-fidelity gradient-free optimization of low-pressure turbine cascades
- Exploiting Problem Structure in Derivative Free Optimization
- Improved load forecasting model based on two-stage optimization of gray model with fractional order accumulation and Markov chain
- A quasi-Newton based pattern search algorithm for unconstrained optimization
- Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization
- Grid-based methods for linearly equality constrained optimization problems
- An optimal algorithm for global optimization and adaptive covering
- A frame-based conjugate gradients direct search method with radial basis function interpolation model
- Exploiting problem structure in pattern search methods for unconstrained optimization
- Linear equalities in blackbox optimization
- Unconstrained derivative-free optimization by successive approximation
- A deterministic algorithm to compute the cosine measure of a finite positive spanning set
- Frame-based ray search algorithms in unconstrained optimization
- A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization
- On the properties of positive spanning sets and positive bases
- The unreliable M/M/1 retrial queue in a random environment
- New horizons in sphere-packing theory, part II: Lattice-based derivative-free optimization via global surrogates
- An Efficient, Globally Convergent Method for Optimization Under Uncertainty Using Adaptive Model Reduction and Sparse Grids
- Nicely structured positive bases with maximal cosine measure
- Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions
- A modified Nelder-Mead barrier method for constrained optimization
- Direct-search methods in the year 2025: theoretical guarantees and algorithmic paradigms
- On the Convergence of Pattern Search Algorithms
- Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions
- Gradient-free aerodynamic shape optimization using Large Eddy Simulation
- A direct search method based on the mixed nonmonotone decrease condition
- A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization
- A convergent variant of the Nelder--Mead algorithm
- Grid restrained Nelder-Mead algorithm
This page was built for publication: On the convergence of grid-based methods for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2706358)
