Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation

DOI10.2307/1266283zbMath0121.35603OpenAlexW4238255529MaRDI QIDQ5732997

G. R. Hext, W. Spendley, F. R. Himsworth

Publication date: 1962

Full work available at URL: https://doi.org/10.2307/1266283

zbMATH Keywords

statistics

Related Items (64)

Hybrid simplex genetic algorithm for blind equalization using RBF networks ⋮ Gradient and diagonal Hessian approximations using quadratic interpolation models and aligned regular bases ⋮ Survey of derivative-free optimization ⋮ A restarted and modified simplex search for unconstrained optimization ⋮ A dynamic clustering based differential evolution algorithm for global optimization ⋮ Global optimization by an improved differential evolutionary algorithm ⋮ Some remarks on computer-aided design of optical lens systems ⋮ An improved saddlepoint approximation ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Optimization of discrete variable stochastic systems by computer simulation ⋮ Aerodynamic shape optimization in aeronautics: a fast and effective multi-objective approach ⋮ An extension of the simplex method to constrained nonlinear optimization ⋮ A bilevel partial interdiction problem with capacitated facilities and demand outsourcing ⋮ Derivative-free optimization: a review of algorithms and comparison of software implementations ⋮ Recent progress in unconstrained nonlinear optimization without derivatives ⋮ Pair potential calculation of molecular associations: A vectorized version ⋮ Optimal PID automatic voltage regulator for synchronous machines ⋮ Optimal guaranteed cost control of uncertain systems via static and dynamic output feedback ⋮ A hybrid simplex search and particle swarm optimization for unconstrained optimization ⋮ Stochastic Nelder-Mead simplex method -- a new globally convergent direct search method for simulation optimization ⋮ A systematic procedure for setting parameters in simulated annealing algorithms ⋮ An efficient hybrid algorithm based on genetic algorithm (GA) and Nelder–Mead (NM) for solving nonlinear inverse parabolic problems ⋮ Efficient calculation of regular simplex gradients ⋮ An on-line search for optimum operating conditions of noisy systems ⋮ A hybrid shuffled complex evolution approach based on differential evolution for unconstrained optimization ⋮ Optimization of stochastic simulation models ⋮ Practical initialization of the Nelder-Mead method for computationally expensive optimization problems ⋮ A derivative-free modified tensor method with curvilinear linesearch for unconstrained nonlinear programming ⋮ Parameter sensitivity study of the Nelder-Mead simplex method ⋮ New horizons in sphere-packing theory, part II: Lattice-based derivative-free optimization via global surrogates ⋮ Role of optimal control theory in cancer chemotherapy ⋮ Reliability optimization through sequential simplex search ⋮ A generalized model of logistic regression for clustered data ⋮ Low dimensional simplex evolution: a new heuristic for global optimization ⋮ Robust optimization for multiple responses using response surface methodology ⋮ Automatic construction of feedforward/recurrent fuzzy systems by clustering-aided simplex particle swarm optimization ⋮ A direct search algorithm for global optimization ⋮ A coupled 3D isogeometric and discrete element approach for modeling interactions between structures and granular matters ⋮ A global optimization heuristic for estimating agent based models ⋮ Follow-up procedure for gravitational wave searches from isolated neutron stars using the time-domain $\boldsymbol {\mathcal{F}}$ -statistic method ⋮ On the Foundations and the Applications of Evolutionary Computing ⋮ Parallel two-phase methods for global optimization on GPU ⋮ Optimal control and properties of nonlinear multistage dynamical system for planning horizontal well paths ⋮ A multistage system of microbial fed-batch fermentation and its parameter identification ⋮ Tuning BARON using derivative-free optimization algorithms ⋮ Approximation methods for the unconstrained optimization ⋮ One-dimensional simplex search ⋮ Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints ⋮ Linearized ridge-path method for function minimization ⋮ Effect of dimensionality on the Nelder–Mead simplex method ⋮ The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables ⋮ Information-efficient design of an automatic aircraft maintenance supervisor ⋮ Evaluation of the simplex method for training simple multilayer neural networks ⋮ Proper initialization is crucial for the Nelder-Mead simplex search ⋮ Derivative-free optimization methods ⋮ Derivative free analogues of the Levenberg-Marquardt and Gauss algorithms for nonlinear least squares approximation ⋮ MERLIN-3. 0. A multidimensional optimization environment ⋮ Interactive multiobjective complex search ⋮ Direct search methods: Then and now ⋮ Optimised one-class classification performance ⋮ A THREE-LEVEL PARALLELISATION SCHEME AND APPLICATION TO THE NELDER-MEAD ALGORITHM ⋮ Analysis of serial production lines: characterisation study and a new heuristic procedure for optimal buffer allocation ⋮ Review and comparison of algorithms and software for mixed-integer derivative-free optimization ⋮ A GA-simplex hybrid algorithm for global minimization of molecular potential energy functions

This page was built for publication: Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation