Pages that link to "Item:Q2419520"

The following pages link to Direct search based on probabilistic feasible descent for bound and linearly constrained problems (Q2419520):

Displaying 10 items.

• Optimal 3D printing of complex objects in a \(5\)-axis printer (Q2147940) (← links)
• Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification (Q2191793) (← links)
• Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates (Q2687061) (← links)
• A Derivative-Free Method for Structured Optimization Problems (Q4987276) (← links)
• Model-Based Derivative-Free Methods for Convex-Constrained Optimization (Q5043286) (← links)
• Derivative-free optimization methods (Q5230522) (← links)
• Scalable subspace methods for derivative-free nonlinear least-squares optimization (Q6038650) (← links)
• Direct Search Based on Probabilistic Descent in Reduced Spaces (Q6071887) (← links)
• Global optimization using random embeddings (Q6160282) (← links)
• Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization (Q6175470) (← links)