Pages that link to "Item:Q4509743"
From MaRDI portal
The following pages link to Pattern Search Methods for Linearly Constrained Minimization (Q4509743):
Displaying 16 items.
- Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems (Q3458824) (← links)
- Pattern search in the presence of degenerate linear constraints (Q3514838) (← links)
- Towards the design of an optimal mixer (Q3573319) (← links)
- Pattern Search Algorithms for Bound Constrained Minimization (Q4702323) (← links)
- A Derivative-Free Method for Structured Optimization Problems (Q4987276) (← links)
- A non-monotone pattern search approach for systems of nonlinear equations (Q5031793) (← links)
- Exploiting Problem Structure in Derivative Free Optimization (Q5066599) (← links)
- A derivative-free algorithm for non-linear optimization with linear equality constraints (Q5110328) (← links)
- Near-Regular Structure Discovery Using Linear Programming (Q5176491) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions (Q5379464) (← links)
- The Unreliable<i>M</i>/<i>M</i>/1 Retrial Queue in a Random Environment (Q5389046) (← links)
- Exploiting problem structure in pattern search methods for unconstrained optimization (Q5475286) (← links)
- A MILP formulation and a metaheuristic approach for the scheduling of drone landings and payload changes on an automatic platform (Q6619782) (← links)
- Full-low evaluation methods for bound and linearly constrained derivative-free optimization (Q6624429) (← links)
- A hybrid direct search and projected simplex gradient method for convex constrained minimization (Q6640994) (← links)
