Pattern Search Algorithms for Bound Constrained Minimization
From MaRDI portal
Recommendations
- Pattern Search Methods for Linearly Constrained Minimization
- Pattern search methods for finite minimax problems
- Filter pattern search algorithms for mixed variable constrained optimization problems
- Pattern search in the presence of degenerate linear constraints
- Generalized pattern search methods for linearly equality constrained optimization problems
- On the Convergence of Pattern Search Algorithms
- Exploiting problem structure in pattern search methods for unconstrained optimization
- Optimization by pattern search
- A pattern search filter method for linearly equality constrained optimization problems
Cited in
(79)- A method for solving some optimization problems with bounds on variables
- A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- Survey of derivative-free optimization
- A sharp augmented Lagrangian-based method in constrained non-convex optimization
- Clustering Sequence Data with Mixture Markov Chains with Covariates Using Multiple Simplex Constrained Optimization Routine (MSiCOR)
- A deterministic method for continuous global optimization using a dense curve
- Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems
- A derivative-free algorithm for unconstrained optimization
- Generalized pattern search methods for linearly equality constrained optimization problems
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization
- Outdoor WLAN planning via non-monotone derivative-free optimization: Algorithm adaptation and case study
- Generalized pattern search methods for a class of nonsmooth optimization problems with structure
- Pattern search method for determination of DAEM kinetic parameters from nonisothermal TGA data of biomass
- A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization
- A short proof on the cardinality of maximal positive bases
- Integrated region-based segmentation using color components and texture features with prior shape knowledge
- A non-monotone pattern search approach for systems of nonlinear equations
- Optimization by pattern search
- Derivative-free robust optimization for circuit design
- Pattern Search Methods for Linearly Constrained Minimization
- Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods
- Probabilistic model identification of uncertainties in computational models for dynamical systems and experimental validation
- Generating set search using simplex gradients for bound-constrained black-box optimization
- A hybrid genetic pattern search augmented Lagrangian method for constrained global optimization
- Trust region model management in multidisciplinary design optimization
- Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints
- Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints
- Efficient calculation of regular simplex gradients
- Exploiting problem structure in pattern search methods for unconstrained optimization
- On an unreliable-server retrial queue with customer feedback and impatience
- A direct search algorithm for global optimization
- X-TMCMC: adaptive kriging for Bayesian inverse modeling
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization
- Multi-step forward dynamic gait simulation
- A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions
- Black-box optimization on hyper-rectangle using recursive modified pattern search and application to ROC-based classification problem
- Positive bases with maximal cosine measure
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- An efficient class of direct search surrogate methods for solving expensive optimization problems with CPU-time-related functions
- Direct search based on probabilistic feasible descent for bound and linearly constrained problems
- Inexact restoration method for nonlinear optimization without derivatives
- Full-low evaluation methods for bound and linearly constrained derivative-free optimization
- Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization
- Derivative-free augmented Lagrangian for global optimization: cost minimization in a simplified activated sludge system model
- Direct zigzag search for discrete multi-objective optimization
- A particle swarm pattern search method for bound constrained global optimization
- Norm-induced cuts: outer approximation for Lipschitzian constraint functions
- On the properties of positive spanning sets and positive bases
- Global optimization by an improved differential evolutionary algorithm
- The unreliable M/M/1 retrial queue in a random environment
- Mesh adaptive direct search algorithms for mixed variable optimization
- A method for stochastic constrained optimization using derivative-free surrogate pattern search and collocation
- A computational framework for derivative-free optimization of cardiovascular geometries
- A hybrid direct search and projected simplex gradient method for convex constrained minimization
- Recursive modified pattern search on high-dimensional simplex: a blackbox optimization technique
- Estimating a semi-parametric duration model without specifying heterogeneity
- Pattern search ranking and selection algorithms for mixed variable simulation-based optimization
- Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
- Practical initialization of the Nelder-Mead method for computationally expensive optimization problems
- Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions
- Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming
- Pattern search method for discrete \(L_{1}\)-approximation
- A derivative-based algorithm for a particular class of mixed variable optimization problems
- Pseudorandom lattices for global optimization
- A Krylov-Arnoldi reduced order modelling framework for efficient, fully coupled, structural-acoustic optimization
- Adaptive virtual support vector machine for reliability analysis of high-dimensional problems
- Sampling-based RBDO using the stochastic sensitivity analysis and dynamic kriging method
- Continuous global optimization through the generation of parametric curves
- Derivative-free methods for bound constrained mixed-integer optimization
- An inexact restoration derivative-free filter method for nonlinear programming
- Tumor location and parameter estimation by thermography
- Derivative-free optimization methods
- A dynamic clustering based differential evolution algorithm for global optimization
- Optimal sensor placement for enhancing sensitivity to change in stiffness for structural health monitoring
- Constrained derivative-free optimization on thin domains
- Derivative-free optimization: a review of algorithms and comparison of software implementations
This page was built for publication: Pattern Search Algorithms for Bound Constrained Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702323)
