Pattern Search Algorithms for Bound Constrained Minimization
From MaRDI portal
Publication:4702323
DOI10.1137/S1052623496300507zbMath1031.90047OpenAlexW2016670346MaRDI QIDQ4702323
Robert Michael Lewis, Virginia Torczon
Publication date: 24 November 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623496300507
convergence analysisdirect search methodspattern search methodsbound constrained optimizationmultidirectional searchglobalization strategiescoordinate searchevolutionary operationlocal variationalternating variable searchaxial relaxation
Related Items
On the properties of positive spanning sets and positive bases, A non-monotone pattern search approach for systems of nonlinear equations, Survey of derivative-free optimization, Optimal sensor placement for enhancing sensitivity to change in stiffness for structural health monitoring, A dynamic clustering based differential evolution algorithm for global optimization, Global optimization by an improved differential evolutionary algorithm, Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems, Probabilistic model identification of uncertainties in computational models for dynamical systems and experimental validation, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, An interior-point affine-scaling trust-region method for semismooth equations with box constraints, On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints, Direct zigzag search for discrete multi-objective optimization, Constrained derivative-free optimization on thin domains, Derivative-free optimization: a review of algorithms and comparison of software implementations, Multi-Step Forward Dynamic Gait Simulation, A Krylov-Arnoldi reduced order modelling framework for efficient, fully coupled, structural-acoustic optimization, Sampling-based RBDO using the stochastic sensitivity analysis and dynamic kriging method, An efficient class of direct search surrogate methods for solving expensive optimization problems with CPU-time-related functions, Adaptive virtual support vector machine for reliability analysis of high-dimensional problems, Derivative-free methods for bound constrained mixed-integer optimization, Direct search based on probabilistic feasible descent for bound and linearly constrained problems, Efficient calculation of regular simplex gradients, Black-box optimization on hyper-rectangle using recursive modified pattern search and application to ROC-based classification problem, 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, A short proof on the cardinality of maximal positive bases, Practical initialization of the Nelder-Mead method for computationally expensive optimization problems, Tumor location and parameter estimation by thermography, Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming, A hybrid genetic pattern search augmented Lagrangian method for constrained global optimization, A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions, Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions, The UnreliableM/M/1 Retrial Queue in a Random Environment, Pattern search method for discrete \(L_{1}\)-approximation, A sharp augmented Lagrangian-based method in constrained non-convex optimization, Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods, A direct search algorithm for global optimization, X-TMCMC: adaptive kriging for Bayesian inverse modeling, Inexact restoration method for nonlinear optimization without derivatives, Continuous global optimization through the generation of parametric curves, Generalized pattern search methods for linearly equality constrained optimization problems, Pattern search method for determination of DAEM kinetic parameters from nonisothermal TGA data of biomass, An inexact restoration derivative-free filter method for nonlinear programming, A deterministic method for continuous global optimization using a dense curve, A derivative-based algorithm for a particular class of mixed variable optimization problems, A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization, A method for stochastic constrained optimization using derivative-free surrogate pattern search and collocation, A derivative-free algorithm for unconstrained optimization, Generating set search using simplex gradients for bound-constrained black-box optimization, A computational framework for derivative-free optimization of cardiovascular geometries, Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints, Estimating a semi-parametric duration model without specifying heterogeneity, Outdoor WLAN planning via non-monotone derivative-free optimization: Algorithm adaptation and case study, Mesh adaptive direct search algorithms for mixed variable optimization, A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints, On an unreliable-server retrial queue with customer feedback and impatience, Integrated region-based segmentation using color components and texture features with prior shape knowledge, Generalized pattern search methods for a class of nonsmooth optimization problems with structure, Recursive modified pattern search on high-dimensional simplex: a blackbox optimization technique, Derivative-free optimization methods, Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization, Pseudorandom lattices for global optimization, Pattern search ranking and selection algorithms for mixed variable simulation-based optimization, Positive bases with maximal cosine measure, Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints, A derivative-free trust-funnel method for equality-constrained nonlinear optimization, Trust region model management in multidisciplinary design optimization, Derivative-free robust optimization for circuit design, Review and comparison of algorithms and software for mixed-integer derivative-free optimization, A method for solving some optimization problems with bounds on variables
