Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach

DOI10.1137/S1052623402407084zbMath1041.49029OpenAlexW2061368966MaRDI QIDQ4441964

Ian D. Coope, Price, C. J.

Publication date: 19 January 2004

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623402407084

zbMATH Keywords

positive basis methodsderivative-free optimizationframe-based methodsnonsmooth convergence analysis

Mathematics Subject Classification ID

Related Items (12)

A simplex-based numerical framework for simple and efficient robust design optimization ⋮ Direct search based on probabilistic feasible descent for bound and linearly constrained problems ⋮ Pattern search in the presence of degenerate linear constraints ⋮ A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions ⋮ Geometry of interpolation sets in derivative free optimization ⋮ Unconstrained derivative-free optimization by successive approximation ⋮ Direct search methods on reductive homogeneous spaces ⋮ A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization ⋮ Exploiting problem structure in pattern search methods for unconstrained optimization ⋮ Generalized pattern search methods for a class of nonsmooth optimization problems with structure ⋮ A modified Nelder-Mead barrier method for constrained optimization ⋮ Linear equalities in blackbox optimization

This page was built for publication: Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach