Pages that link to "Item:Q4702323"
From MaRDI portal
The following pages link to Pattern Search Algorithms for Bound Constrained Minimization (Q4702323):
Displaying 50 items.
- A method for solving some optimization problems with bounds on variables (Q260512) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Direct zigzag search for discrete multi-objective optimization (Q337599) (← links)
- A Krylov-Arnoldi reduced order modelling framework for efficient, fully coupled, structural-acoustic optimization (Q381585) (← links)
- Sampling-based RBDO using the stochastic sensitivity analysis and dynamic kriging method (Q381619) (← links)
- An efficient class of direct search surrogate methods for solving expensive optimization problems with CPU-time-related functions (Q381689) (← links)
- Adaptive virtual support vector machine for reliability analysis of high-dimensional problems (Q381967) (← links)
- A hybrid genetic pattern search augmented Lagrangian method for constrained global optimization (Q440892) (← links)
- Inexact restoration method for nonlinear optimization without derivatives (Q492056) (← links)
- An inexact restoration derivative-free filter method for nonlinear programming (Q520323) (← links)
- A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization (Q551488) (← links)
- A short proof on the cardinality of maximal positive bases (Q628667) (← links)
- Tumor location and parameter estimation by thermography (Q636417) (← links)
- Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions (Q652326) (← links)
- Continuous global optimization through the generation of parametric curves (Q671196) (← links)
- Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints (Q727385) (← links)
- Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints (Q785630) (← links)
- Survey of derivative-free optimization (Q827577) (← links)
- Optimal sensor placement for enhancing sensitivity to change in stiffness for structural health monitoring (Q833437) (← links)
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints (Q853889) (← links)
- Derivative-free augmented Lagrangian for global optimization: cost minimization in a simplified activated sludge system model (Q894427) (← links)
- Generalized pattern search methods for linearly equality constrained optimization problems (Q945396) (← links)
- A method for stochastic constrained optimization using derivative-free surrogate pattern search and collocation (Q975138) (← links)
- A computational framework for derivative-free optimization of cardiovascular geometries (Q995283) (← links)
- Outdoor WLAN planning via non-monotone derivative-free optimization: Algorithm adaptation and case study (Q1001196) (← links)
- Mesh adaptive direct search algorithms for mixed variable optimization (Q1001325) (← links)
- Generalized pattern search methods for a class of nonsmooth optimization problems with structure (Q1023336) (← links)
- Pattern search ranking and selection algorithms for mixed variable simulation-based optimization (Q1042073) (← links)
- Optimization by pattern search (Q1342017) (← links)
- Trust region model management in multidisciplinary design optimization (Q1593819) (← links)
- Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods (Q1733327) (← links)
- A direct search algorithm for global optimization (Q1736805) (← links)
- X-TMCMC: adaptive kriging for Bayesian inverse modeling (Q1737023) (← links)
- Pseudorandom lattices for global optimization (Q1827238) (← links)
- Derivative-free methods for bound constrained mixed-integer optimization (Q1928748) (← links)
- A deterministic method for continuous global optimization using a dense curve (Q1998159) (← links)
- Generating set search using simplex gradients for bound-constrained black-box optimization (Q2028453) (← links)
- A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints (Q2044568) (← links)
- Recursive modified pattern search on high-dimensional simplex: a blackbox optimization technique (Q2061776) (← links)
- Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization (Q2070360) (← links)
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization (Q2114591) (← links)
- On an unreliable-server retrial queue with customer feedback and impatience (Q2295133) (← links)
- Positive bases with maximal cosine measure (Q2329658) (← links)
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization (Q2340488) (← links)
- Derivative-free robust optimization for circuit design (Q2342134) (← links)
- On the properties of positive spanning sets and positive bases (Q2357977) (← links)
- A dynamic clustering based differential evolution algorithm for global optimization (Q2370329) (← links)
- Global optimization by an improved differential evolutionary algorithm (Q2371478) (← links)
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints (Q2385544) (← links)
- Constrained derivative-free optimization on thin domains (Q2392122) (← links)
