Exploiting problem structure in pattern search methods for unconstrained optimization

DOI10.1080/10556780500137116zbMath1136.90516OpenAlexW1976240149WikidataQ58185791 ScholiaQ58185791MaRDI QIDQ5475286

Price, C. J., Phillipe L. Toint

Publication date: 16 June 2006

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780500137116

zbMATH Keywords

pattern searchpartial separabilityderivative free

Mathematics Subject Classification ID

Derivative-free methods and methods using generalized derivatives (90C56) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Improving Direct Search algorithms by multilevel optimization techniques, Exploiting Problem Structure in Derivative Free Optimization, Coordinate search algorithms in multilevel optimization, A generating set search method using curvature information, Derivative-free optimization methods

Uses Software

• ve08
• minpack

Cites Work

• Unnamed Item
• Generalized descent for global optimization
• Exploiting band structure in unconstrained optimization without derivatives
• On the Convergence of Grid-Based Methods for Unconstrained Optimization
• On the Convergence of Pattern Search Algorithms
• `` Direct Search Solution of Numerical and Statistical Problems
• Testing Unconstrained Optimization Software
• Direct Search Methods on Parallel Machines
• Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach
• Optimizing partially separable functions without derivatives
• Theory of Positive Linear Dependence