On the Convergence of Grid-Based Methods for Unconstrained Optimization

Authors:
I. D. Coope;C. J. Price
Affiliations:
-;-
Venue:
SIAM Journal on Optimization
Year:
2000

Citing 0
Cited 11

A convergent variant of the Nelder-Mead algorithm

Journal of Optimization Theory and Applications
Positive Bases in Numerical Optimization

Computational Optimization and Applications
Conjugate Grids for Unconstrained Optimisation

Computational Optimization and Applications
Grid Restrained Nelder-Mead Algorithm

Computational Optimization and Applications
A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization

Computers & Mathematics with Applications
Sprouting search-an algorithmic framework for asynchronous parallel unconstrained optimization

Optimization Methods & Software
Unconstrained derivative-free optimization by successive approximation

Journal of Computational and Applied Mathematics
A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization

Computers & Mathematics with Applications
Bayesian recognition of motion related activities with inertial sensors

Proceedings of the 12th ACM international conference adjunct papers on Ubiquitous computing - Adjunct
Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions

Numerical Algorithms
Generalized pattern search and mesh adaptive direct search algorithms for protein structure prediction

WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Interior point methods for semidefinite optimization (SDO) have recently been studied intensively, due to their polynomial complexity and practical efficiency. Most of these methods are extensions of linear optimization (LO) algorithms. As opposed to ...