Pages that link to "Item:Q4702335"

The following pages link to Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition (Q4702335):

Displaying 48 items.

• A derivative-free approximate gradient sampling algorithm for finite minimax problems (Q360384) (← links)
• On the optimal design of river fishways (Q400086) (← links)
• Implementing the Nelder-Mead simplex algorithm with adaptive parameters (Q434176) (← links)
• Stackelberg strategies for wastewater management (Q484869) (← links)
• A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization (Q551488) (← links)
• A convergent variant of the Nelder--Mead algorithm (Q700697) (← links)
• A restarted and modified simplex search for unconstrained optimization (Q833553) (← links)
• Grid restrained Nelder-Mead algorithm (Q853559) (← links)
• Vertical slot fishways: Mathematical modeling and optimal management (Q932726) (← links)
• Optimal design and operation of a wastewater purification system (Q960370) (← links)
• Flow regulation for water quality restoration in a river section: modeling and control (Q970421) (← links)
• An application of optimal control theory to river pollution remediation (Q1012235) (← links)
• Disentangling mark/point interaction in marked-point processes (Q1019944) (← 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)
• Sediment minimization in canals: an optimal control approach (Q1997111) (← links)
• Parallel two-phase methods for global optimization on GPU (Q1997322) (← 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)
• Improvement of the Nelder-Mead method using direct inversion in iterative subspace (Q2147934) (← links)
• Quantifying uncertainty with ensembles of surrogates for blackbox optimization (Q2162525) (← links)
• A practical fractional numerical optimization method for designing economically and environmentally friendly super-tall buildings (Q2174400) (← links)
• Improved sampling strategies for ensemble-based optimization (Q2192778) (← links)
• A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement (Q2218908) (← links)
• Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in \(\mathbb{R}\) (Q2222168) (← links)
• Stagnation detection with randomized local search (Q2233520) (← links)
• Proper initialization is crucial for the Nelder-Mead simplex search (Q2311116) (← links)
• Derivative-free optimization: a review of algorithms and comparison of software implementations (Q2392129) (← links)
• Derivative-free filter simulated annealing method for constrained continuous global optimization (Q2457918) (← links)
• A novel three-phase trajectory informed search methodology for global optimization (Q2460111) (← links)
• Tabu search directed by direct search methods for nonlinear global optimization (Q2572240) (← links)
• Convergence of the Nelder-Mead method (Q2672718) (← links)
• Non-intrusive termination of noisy optimization (Q2867421) (← links)
• Measurement of surface temperature and emissivity with stereo dual-wavelength IR thermography (Q3012747) (← 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)
• Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization (Q4657814) (← links)
• A stochastic local search algorithm for constrained continuous global optimization (Q4929093) (← links)
• Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers (Q4960952) (← links)
• Less is more: Simplified Nelder-Mead method for large unconstrained optimization (Q4987781) (← links)
• Rational Spectral Filters with Optimal Convergence Rate (Q5005202) (← links)
• Improved Nelder–Mead algorithm in high dimensions with adaptive parameters based on Chebyshev spacing points (Q5059449) (← links)
• Derivative-free optimization methods (Q5230522) (← links)
• Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization (Q5437525) (← links)
• Scalable subspace methods for derivative-free nonlinear least-squares optimization (Q6038650) (← links)
• A real-time optimization algorithm for the fixed-stress splitting scheme (Q6553982) (← links)
• A hybrid direct search and projected simplex gradient method for convex constrained minimization (Q6640994) (← links)