Pages that link to "Item:Q4943618"

The following pages link to Fortified-Descent Simplicial Search Method: A General Approach (Q4943618):

Displaying 18 items.

• Implementing the Nelder-Mead simplex algorithm with adaptive parameters (Q434176) (← links)
• Survey of derivative-free optimization (Q827577) (← links)
• A restarted and modified simplex search for unconstrained optimization (Q833553) (← links)
• Grid restrained Nelder-Mead algorithm (Q853559) (← links)
• Frame-based ray search algorithms in unconstrained optimization (Q1411465) (← links)
• Mesh-based Nelder-Mead algorithm for inequality constrained optimization (Q1616932) (← links)
• Theoretical connections between optimization algorithms based on an approximate gradient (Q1663476) (← links)
• Calibration of parameters in dynamic energy budget models using direct-search methods (Q1741538) (← links)
• Generating set search using simplex gradients for bound-constrained black-box optimization (Q2028453) (← links)
• A modified Nelder-Mead barrier method for constrained optimization (Q2062438) (← links)
• A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement (Q2218908) (← links)
• Derivative-free optimization: a review of algorithms and comparison of software implementations (Q2392129) (← links)
• Effect of dimensionality on the Nelder–Mead simplex method (Q3377969) (← links)
• Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization (Q4405945) (← links)
• Improved Nelder–Mead algorithm in high dimensions with adaptive parameters based on Chebyshev spacing points (Q5059449) (← links)
• Black-Box Optimization: Methods and Applications (Q5153493) (← links)
• Derivative-free optimization methods (Q5230522) (← links)
• A derivative-free optimization algorithm combining line-search and trust-region techniques (Q6183896) (← links)