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

DOI10.1137/S1052623402407084MaRDI QIDQ4441964zbMATH OpenOpenAlexFDO

Authors C. J. Price, Ian D. Coope

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

derivative-free optimizationframe-based methodsnonsmooth convergence analysispositive basis methods

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Numerical mathematical programming methods (65K05) Derivative-free methods and methods using generalized derivatives (90C56)

Recommendations

• Frame based methods for unconstrained optimization
• Frame-based ray search algorithms in unconstrained optimization
• A direct search method for smooth and nonsmooth unconstrained optimization
• A non-monotone frame-based direct search conjugate gradient method
• Direct search methods for nonlinearly constrained optimization using filters and frames

Cited in

(21)

• Generalized pattern search methods for a class of nonsmooth optimization problems with structure
• Frame-based ray search algorithms in unconstrained optimization
• Direct search methods on reductive homogeneous spaces
• A modified Nelder-Mead barrier method for constrained optimization
• Linear equalities in blackbox optimization
• Direct search based on probabilistic feasible descent for bound and linearly constrained problems
• Geometry of interpolation sets in derivative free optimization
• Direct search methods for nonlinearly constrained optimization using filters and frames
• A direct search method for smooth and nonsmooth unconstrained optimization
• Optimal frames and Newton's method
• A direct search method based on the mixed nonmonotone decrease condition
• Pattern search in the presence of degenerate linear constraints
• A simplex-based numerical framework for simple and efficient robust design optimization
• A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions
• Exploiting problem structure in pattern search methods for unconstrained optimization
• Frame based methods for unconstrained optimization
• Full-low evaluation methods for bound and linearly constrained derivative-free optimization
• Direct-search methods in the year 2025: theoretical guarantees and algorithmic paradigms
• Conjugate grids for unconstrained optimisation
• Unconstrained derivative-free optimization by successive approximation
• A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4441964)