Pages that link to "Item:Q1642983"

The following pages link to Best practices for comparing optimization algorithms (Q1642983):

Displaying 17 items.

• Methods to compare expensive stochastic optimization algorithms with random restarts (Q1756805) (← links)
• A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← links)
• A filter proximal bundle method for nonsmooth nonconvex constrained optimization (Q2022218) (← links)
• \textsc{Oscars}-II: an algorithm for bound constrained global optimization (Q2022219) (← links)
• Secant update generalized version of PSB: a new approach (Q2028481) (← links)
• Performance indicators in multiobjective optimization (Q2030589) (← links)
• SMGO: a set membership approach to data-driven global optimization (Q2065241) (← links)
• A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization (Q2218904) (← links)
• Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers (Q4960952) (← links)
• Optimization of Stochastic Blackboxes with Adaptive Precision (Q5020850) (← links)
• A symmetric grouped and ordered multi-secant Quasi-Newton update formula (Q5058402) (← links)
• Multi-fidelity algorithms for the horizontal alignment problem in road design (Q5059454) (← links)
• A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization (Q5106116) (← links)
• Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives (Q5153496) (← links)
• The cyclic Douglas–Rachford algorithm with <i>r</i>-sets-Douglas–Rachford operators (Q5379466) (← links)
• COCO: a platform for comparing continuous optimizers in a black-box setting (Q5859012) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)