Pages that link to "Item:Q5925722"
From MaRDI portal
The following pages link to Frame based methods for unconstrained optimization (Q5925722):
Displaying 34 items.
- An efficient class of direct search surrogate methods for solving expensive optimization problems with CPU-time-related functions (Q381689) (← links)
- Adapting derivative free optimization methods to engineering models with discrete variables (Q400044) (← links)
- Globally convergent evolution strategies (Q494335) (← links)
- Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions (Q652326) (← links)
- A convergent variant of the Nelder--Mead algorithm (Q700697) (← links)
- Gradient and diagonal Hessian approximations using quadratic interpolation models and aligned regular bases (Q820723) (← links)
- Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods (Q828735) (← links)
- Spent potliner treatment process optimization using a MADS algorithm (Q833446) (← links)
- Grid restrained Nelder-Mead algorithm (Q853559) (← links)
- Grid-based methods for linearly equality constrained optimization problems (Q874345) (← links)
- Globally convergent evolution strategies for constrained optimization (Q887166) (← links)
- Equal angle distribution of polling directions in direct-search methods (Q896733) (← links)
- Mesh adaptive direct search with second directional derivative-based Hessian update (Q902088) (← links)
- Unconstrained derivative-free optimization by successive approximation (Q953370) (← links)
- A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization (Q979825) (← links)
- Mesh adaptive direct search algorithms for mixed variable optimization (Q1001325) (← links)
- Frame-based ray search algorithms in unconstrained optimization (Q1411465) (← links)
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization (Q1616932) (← links)
- Optimal combination of aircraft maintenance tasks by a novel simplex optimization method (Q1664843) (← links)
- Direct search methods on reductive homogeneous spaces (Q1752640) (← links)
- A modified Nelder-Mead barrier method for constrained optimization (Q2062438) (← links)
- Mesh adaptive direct search with simplicial Hessian update (Q2282812) (← links)
- Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization (Q2358022) (← links)
- A frame-based conjugate gradients direct search method with radial basis function interpolation model (Q2398571) (← links)
- Using QR decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions (Q2442697) (← links)
- Deterministic parallel global parameter estimation for a model of the budding yeast cell cycle (Q2481377) (← links)
- Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm (Q2518730) (← links)
- On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization (Q2867433) (← links)
- A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION (Q4608945) (← links)
- Direct search nonsmooth constrained optimization via rounded ℓ<sub>1</sub> penalty functions (Q5038179) (← links)
- Exploiting Problem Structure in Derivative Free Optimization (Q5066599) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- Spherical Mesh Adaptive Direct Search for Separating Quasi-Uncorrelated Sources by Range-Based Independent Component Analysis (Q5378265) (← links)
- Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization (Q5437525) (← links)
