Frame-based ray search algorithms in unconstrained optimization

DOI10.1023/A:1022414105888zbMath1045.90066OpenAlexW1595972662MaRDI QIDQ1411465

Price, C. J., Ian D. Coope

Publication date: 29 October 2003

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022414105888

zbMATH Keywords

convergence analysispositive basis methodsDerivative-free optimizationframe-based methodsray search

Mathematics Subject Classification ID

Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (4)

Optimal combination of aircraft maintenance tasks by a novel simplex optimization method ⋮ Grid-based methods for linearly equality constrained optimization problems ⋮ Parameter range reduction for ODE models using cumulative backward differentiation formulas ⋮ A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION

Uses Software

• DFO

Cites Work

• Unnamed Item
• Unnamed Item
• A convergent variant of the Nelder--Mead algorithm
• Global convergence and stabilization of unconstrained minimization methods without derivatives
• On the Convergence of Grid-Based Methods for Unconstrained Optimization
• On the Convergence of Pattern Search Algorithms
• Direct Search Methods on Parallel Machines
• On the Convergence of the Multidirectional Search Algorithm
• Analysis of Generalized Pattern Searches
• Fortified-Descent Simplicial Search Method: A General Approach
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• A Simplex Method for Function Minimization
• Theory of Positive Linear Dependence
• Frame based methods for unconstrained optimization
• Positive bases in numerical optimization

This page was built for publication: Frame-based ray search algorithms in unconstrained optimization