Pages that link to "Item:Q4441964"

The following pages link to Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach (Q4441964):

Displayed 12 items.

• A simplex-based numerical framework for simple and efficient robust design optimization (Q360385) ‎ (← links)
• Unconstrained derivative-free optimization by successive approximation (Q953370) ‎ (← links)
• A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization (Q979825) ‎ (← links)
• Generalized pattern search methods for a class of nonsmooth optimization problems with structure (Q1023336) ‎ (← links)
• Direct search methods on reductive homogeneous spaces (Q1752640) ‎ (← links)
• A modified Nelder-Mead barrier method for constrained optimization (Q2062438) ‎ (← links)
• Linear equalities in blackbox optimization (Q2340487) ‎ (← links)
• Direct search based on probabilistic feasible descent for bound and linearly constrained problems (Q2419520) ‎ (← links)
• Geometry of interpolation sets in derivative free optimization (Q2467163) ‎ (← links)
• Pattern search in the presence of degenerate linear constraints (Q3514838) ‎ (← links)
• A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions (Q5379464) ‎ (← links)
• Exploiting problem structure in pattern search methods for unconstrained optimization (Q5475286) ‎ (← links)