On the Convergence of Grid-Based Methods for Unconstrained Optimization
From MaRDI portal
Publication:2706358
DOI10.1137/S1052623499354989zbMath1035.90107OpenAlexW1973518536MaRDI QIDQ2706358
Publication date: 19 March 2001
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623499354989
convergence analysispositive basis methodsderivative-free optimizationmultidirectional searchgrid-based optimization
Numerical mathematical programming methods (65K05) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (29)
On the properties of positive spanning sets and positive bases ⋮ Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions ⋮ Extended global convergence framework for unconstrained optimization ⋮ Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems ⋮ Grid restrained Nelder-Mead algorithm ⋮ Exploiting Problem Structure in Derivative Free Optimization ⋮ A quasi-Newton based pattern search algorithm for unconstrained optimization ⋮ A frame-based conjugate gradients direct search method with radial basis function interpolation model ⋮ Improved load forecasting model based on two-stage optimization of gray model with fractional order accumulation and Markov chain ⋮ Grid-based methods for linearly equality constrained optimization problems ⋮ A deterministic algorithm to compute the cosine measure of a finite positive spanning set ⋮ Nicely structured positive bases with maximal cosine measure ⋮ Frame-based ray search algorithms in unconstrained optimization ⋮ New horizons in sphere-packing theory, part II: Lattice-based derivative-free optimization via global surrogates ⋮ Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions ⋮ The UnreliableM/M/1 Retrial Queue in a Random Environment ⋮ A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization ⋮ Unconstrained derivative-free optimization by successive approximation ⋮ Frame based methods for unconstrained optimization ⋮ A convergent variant of the Nelder--Mead algorithm ⋮ A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization ⋮ Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization ⋮ An optimal algorithm for global optimization and adaptive covering ⋮ Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm ⋮ Exploiting problem structure in pattern search methods for unconstrained optimization ⋮ A modified Nelder-Mead barrier method for constrained optimization ⋮ Gradient-free aerodynamic shape optimization using Large Eddy Simulation ⋮ Linear equalities in blackbox optimization ⋮ High-fidelity gradient-free optimization of low-pressure turbine cascades
Uses Software
This page was built for publication: On the Convergence of Grid-Based Methods for Unconstrained Optimization
